16.812 * [progress]: [Phase 1 of 3] Setting up. 0.001 * * * [progress]: [1/2] Preparing points 0.011 * * * [progress]: [2/2] Setting up program. 0.012 * [progress]: [Phase 2 of 3] Improving. 0.012 * [simplify]: Simplifying using # : (* (* x x) x) 0.013 * * [simplify]: iteration 0 : 3 enodes (cost 5 ) 0.014 * * [simplify]: iteration 1 : 4 enodes (cost 5 ) 0.014 * * [simplify]: iteration 2 : 6 enodes (cost 3 ) 0.016 * * [simplify]: iteration 3 : 11 enodes (cost 3 ) 0.018 * * [simplify]: iteration 4 : 17 enodes (cost 3 ) 0.021 * * [simplify]: iteration 5 : 27 enodes (cost 3 ) 0.025 * * [simplify]: iteration 6 : 50 enodes (cost 3 ) 0.038 * * [simplify]: iteration 7 : 113 enodes (cost 3 ) 0.082 * * [simplify]: iteration 8 : 331 enodes (cost 3 ) 0.462 * * [simplify]: iteration 9 : 1250 enodes (cost 3 ) 2.411 * * [simplify]: iteration done : 5000 enodes (cost 3 ) 2.411 * [simplify]: Simplified to: (pow x 3) 2.414 * * [progress]: iteration 1 / 4 2.415 * * * [progress]: picking best candidate 2.416 * * * * [pick]: Picked # 2.416 * * * [progress]: localizing error 2.419 * * * [progress]: generating rewritten candidates 2.419 * * * [progress]: generating series expansions 2.419 * * * [progress]: simplifying candidates 2.419 * [simplify]: Simplifying using # : 2.420 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 2.420 * * [simplify]: iteration done : 0 enodes (cost 0 ) 2.420 * [simplify]: Simplified to: 2.420 * * * [progress]: adding candidates to table 2.420 * [progress]: [Phase 3 of 3] Extracting. 2.422 * [simplify]: Simplifying using # : (pow x 3) 2.422 * * [simplify]: iteration 0 : 3 enodes (cost 3 ) 2.422 * * [simplify]: iteration done : 3 enodes (cost 3 ) 2.422 * [simplify]: Simplified to: (pow x 3) 2.777 * [regime-testing]: End program error score: 0