22.678 * [progress]: [Phase 1 of 3] Setting up. 0.001 * * * [progress]: [1/2] Preparing points 0.012 * * * [progress]: [2/2] Setting up program. 0.014 * [progress]: [Phase 2 of 3] Improving. 0.014 * [simplify]: Simplifying using # : (* (* (* d1 d1) d1) d1) 0.015 * * [simplify]: iteration 0 : 4 enodes (cost 7 ) 0.016 * * [simplify]: iteration 1 : 7 enodes (cost 7 ) 0.017 * * [simplify]: iteration 2 : 9 enodes (cost 5 ) 0.019 * * [simplify]: iteration 3 : 18 enodes (cost 3 ) 0.023 * * [simplify]: iteration 4 : 33 enodes (cost 3 ) 0.028 * * [simplify]: iteration 5 : 59 enodes (cost 3 ) 0.040 * * [simplify]: iteration 6 : 130 enodes (cost 3 ) 0.078 * * [simplify]: iteration 7 : 344 enodes (cost 3 ) 0.337 * * [simplify]: iteration 8 : 1184 enodes (cost 3 ) 2.551 * * [simplify]: iteration done : 5000 enodes (cost 3 ) 2.551 * [simplify]: Simplified to: (pow d1 4) 2.554 * * [progress]: iteration 1 / 4 2.554 * * * [progress]: picking best candidate 2.555 * * * * [pick]: Picked # 2.555 * * * [progress]: localizing error 2.558 * * * [progress]: generating rewritten candidates 2.558 * * * [progress]: generating series expansions 2.558 * * * [progress]: simplifying candidates 2.558 * [simplify]: Simplifying using # : 2.559 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 2.559 * * [simplify]: iteration done : 0 enodes (cost 0 ) 2.559 * [simplify]: Simplified to: 2.559 * * * [progress]: adding candidates to table 2.559 * [progress]: [Phase 3 of 3] Extracting. 2.561 * [simplify]: Simplifying using # : (pow d1 4) 2.561 * * [simplify]: iteration 0 : 3 enodes (cost 3 ) 2.561 * * [simplify]: iteration done : 3 enodes (cost 3 ) 2.561 * [simplify]: Simplified to: (pow d1 4) 2.967 * [regime-testing]: End program error score: 0 2.992 * [regime-testing]: Target error score: 0