1.456 * [progress]: [Phase 1 of 3] Setting up. 0.002 * * * [progress]: [1/2] Preparing points 0.048 * * * [progress]: [2/2] Setting up program. 0.055 * [progress]: [Phase 2 of 3] Improving. 0.059 * [simplify]: Simplifying using # : (- (* re re) (* im im)) 0.070 * * [simplify]: iteration 0 : 10 enodes (cost 3 ) 0.072 * * [simplify]: iteration 1 : 17 enodes (cost 3 ) 0.073 * * [simplify]: iteration 2 : 32 enodes (cost 3 ) 0.075 * * [simplify]: iteration 3 : 58 enodes (cost 3 ) 0.078 * * [simplify]: iteration 4 : 129 enodes (cost 3 ) 0.082 * * [simplify]: iteration 5 : 207 enodes (cost 3 ) 0.087 * * [simplify]: iteration 6 : 393 enodes (cost 3 ) 0.102 * * [simplify]: iteration 7 : 1794 enodes (cost 3 ) 0.207 * * [simplify]: iteration 8 : 5001 enodes (cost 3 ) 0.209 * [simplify]: Simplified to: (- (* re re) (* im im)) 0.212 * * [progress]: iteration 1 / 4 0.212 * * * [progress]: picking best candidate 0.218 * * * * [pick]: Picked # 0.219 * * * [progress]: localizing error 0.489 * * * [progress]: generating rewritten candidates 0.490 * * * [progress]: generating series expansions 0.490 * * * [progress]: simplifying candidates 0.490 * [simplify]: Simplifying using # : 0.505 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 0.505 * [simplify]: Simplified to: 0.505 * * * [progress]: adding candidates to table 0.505 * [progress]: [Phase 3 of 3] Extracting. 0.510 * [simplify]: Simplifying using # : (- (* re re) (* im im)) 0.511 * * [simplify]: iteration 0 : 5 enodes (cost 3 ) 0.511 * [simplify]: Simplified to: (- (* re re) (* im im)) 2.259 * [regime-testing]: End program error score: 0.006375796974621828