6.575 * [progress]: [Phase 1 of 3] Setting up. 0.001 * * * [progress]: [1/2] Preparing points 0.010 * * * [progress]: [2/2] Setting up program. 0.011 * [progress]: [Phase 2 of 3] Improving. 0.011 * [simplify]: Simplifying using # : (+ x (* x x)) 0.012 * * [simplify]: iteration 0 : 3 enodes (cost 5 ) 0.013 * * [simplify]: iteration 1 : 7 enodes (cost 5 ) 0.014 * * [simplify]: iteration 2 : 12 enodes (cost 4 ) 0.016 * * [simplify]: iteration 3 : 18 enodes (cost 4 ) 0.018 * * [simplify]: iteration 4 : 20 enodes (cost 4 ) 0.021 * * [simplify]: iteration 5 : 35 enodes (cost 4 ) 0.030 * * [simplify]: iteration 6 : 43 enodes (cost 4 ) 0.040 * * [simplify]: iteration 7 : 55 enodes (cost 4 ) 0.064 * * [simplify]: iteration 8 : 94 enodes (cost 4 ) 0.138 * * [simplify]: iteration 9 : 240 enodes (cost 4 ) 0.521 * * [simplify]: iteration 10 : 1254 enodes (cost 4 ) 3.644 * * [simplify]: iteration done : 5000 enodes (cost 4 ) 3.644 * [simplify]: Simplified to: (fma x x x) 3.646 * * [progress]: iteration 1 / 4 3.647 * * * [progress]: picking best candidate 3.648 * * * * [pick]: Picked # 3.648 * * * [progress]: localizing error 3.650 * * * [progress]: generating rewritten candidates 3.650 * * * [progress]: generating series expansions 3.650 * * * [progress]: simplifying candidates 3.651 * [simplify]: Simplifying using # : 3.652 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 3.652 * * [simplify]: iteration done : 0 enodes (cost 0 ) 3.652 * [simplify]: Simplified to: 3.652 * * * [progress]: adding candidates to table 3.652 * [progress]: [Phase 3 of 3] Extracting. 3.653 * [simplify]: Simplifying using # : (fma x x x) 3.653 * * [simplify]: iteration 0 : 2 enodes (cost 4 ) 3.654 * * [simplify]: iteration done : 2 enodes (cost 4 ) 3.654 * [simplify]: Simplified to: (fma x x x) 3.979 * [regime-testing]: End program error score: 0