LIB "recover.lib";
//First, we write the input file for bertini, then run bertini
ring r=0,(x,y,z),dp;
ideal I=(x-y)*(y-z)*(x-z);
writeBertiniInput(I,40);
system("sh","bertini input");
==> 
==>    Bertini(TM) v1.6
==>     (May 22, 2018)
==> 
==>  D.J. Bates, J.D. Hauenstein,
==>  A.J. Sommese, C.W. Wampler
==> 
==> (using GMP v6.0.0, MPFR v3.1.2)
==> 
==> 
==> 
==> NOTE: You have requested to use adaptive path tracking.  Please make sure\
    that you have
==> setup the following tolerances appropriately:
==> CoeffBound: 6.000000000000e+00, DegreeBound: 3.000000000000e+00
==> AMPSafetyDigits1: 1, AMPSafetyDigits2: 1, AMPMaxPrec: 160
==> 
==> 
==> Tracking regeneration codim 1 of 1: 3 paths to track.
==> Tracking path 0 of 3
==> Tracking path 1 of 3
==> Tracking path 2 of 3
==> 
==> Sorting codimension 1 of 1: 3 paths to sort.
==> Sorting 0 of 3
==> Sorting 1 of 3
==> Sorting 2 of 3
==> 
==> 
==> ************ Regenerative Cascade Summary ************
==> 
==> NOTE: nonsingular vs singular is based on rank deficiency and identical e\
   ndpoints
==> 
==> |codim|   paths   |witness superset| nonsingular | singular |nonsolutions\
   | inf endpoints | other bad endpoints
==> ----------------------------------------------------------------------------------------------------------------
==> | 1   |   3       |   3            |  3          |  0       |  0         \
   |   0           |  0
==> ----------------------------------------------------------------------------------------------------------------
==> |total|   3
==> 
==> ****************************************************
==> 
==> 
==> 
==> *************** Witness Set Summary ****************
==> 
==> NOTE: nonsingular vs singular is based on rank deficiency and identical e\
   ndpoints
==> 
==> |codim| witness points | nonsingular | singular 
==> -------------------------------------------------
==> | 1   |   3            |  3          |  0       
==> -------------------------------------------------
==> 
==> ****************************************************
==> 
==> 
==> Calculating traces for codimension 1.
==> Calculating 0 of 3
==> Calculating 1 of 3
==> Calculating 2 of 3
==> 
==> Using combinatorial trace test to decompose codimension 1.
==> 
==> 
==> ************* Witness Set Decomposition *************
==> 
==> | dimension | components | classified | unclassified
==> -----------------------------------------------------
==> |   1       |   0        |   0        |  3
==> -----------------------------------------------------
==> 
==> ************** Decomposition by Degree **************
==> 
==> *****************************************************
==> 
==> 0
//Then we change the ring and extract the witness set from main_data
ring R=(complex,40,i),(x,y,z),dp;
list P=getWitnessSet();
P;
==> [1]:
==>    [1]:
==> (0.3438502561503233888885904100285972614013-i*0.6286988059665164790356122\
   200751207405754)
==>    [2]:
==> (0.3170400209428280594874549758074190955358+i*0.0625320974232521741601017\
   8988994026949984)
==>    [3]:
==> (0.3170400209428280594874549758074190955358+i*0.0625320974232521741601017\
   8988994026949984)
==> [2]:
==>    [1]:
==> (0.4630469516540209174647586470364305502678+i*0.4012980625757469496043106\
   802785382186619)
==>    [2]:
==> (-0.4917502234911466087306455201188421286946-i*0.488161430387012263512258\
   1658999356162795)
==>    [3]:
==> (0.4630469516540209174647586470364305502678+i*0.4012980625757469496043106\
   802785382186619)
==> [3]:
==>    [1]:
==> (0.1720890346955354256782525010740420965315-i*0.2770997905247993991230625\
   37103846215786)
==>    [2]:
==> (0.1720890346955354256782525010740420965315-i*0.2770997905247993991230625\
   37103846215786)
==>    [3]:
==> (0.2944903187941803288082994380477814021992+i*0.1999114069275137600997690\
   736431379436284)