25.766 * [progress]: [Phase 1 of 3] Setting up. 0.001 * * * [progress]: [1/2] Preparing points 0.008 * * * [progress]: [2/2] Setting up program. 0.010 * [progress]: [Phase 2 of 3] Improving. 0.010 * [simplify]: Simplifying using # : (+ (+ (+ (+ x x) x) x) x) 0.012 * * [simplify]: iteration 0 : 12 enodes (cost 4 ) 0.014 * * [simplify]: iteration 1 : 22 enodes (cost 3 ) 0.015 * * [simplify]: iteration 2 : 43 enodes (cost 1 ) 0.017 * * [simplify]: iteration 3 : 62 enodes (cost 1 ) 0.019 * * [simplify]: iteration 4 : 156 enodes (cost 1 ) 0.021 * * [simplify]: iteration 5 : 270 enodes (cost 1 ) 0.023 * * [simplify]: iteration 6 : 296 enodes (cost 1 ) 0.026 * * [simplify]: iteration 7 : 308 enodes (cost 1 ) 0.029 * * [simplify]: iteration 8 : 406 enodes (cost 1 ) 0.035 * * [simplify]: iteration 9 : 730 enodes (cost 1 ) 0.061 * * [simplify]: iteration 10 : 3279 enodes (cost 1 ) 0.279 * * [simplify]: iteration 11 : 5001 enodes (cost 1 ) 0.280 * [simplify]: Simplified to: (fma x 4 x) 0.282 * * [progress]: iteration 1 / 4 0.282 * * * [progress]: picking best candidate 0.283 * * * * [pick]: Picked # 0.283 * * * [progress]: localizing error 0.290 * * * [progress]: generating rewritten candidates 0.290 * * * [progress]: generating series expansions 0.290 * * * [progress]: simplifying candidates 0.290 * [simplify]: Simplifying using # : 0.292 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 0.292 * [simplify]: Simplified to: 0.292 * * * [progress]: adding candidates to table 0.293 * [progress]: [Phase 3 of 3] Extracting. 0.294 * [simplify]: Simplifying using # : (+ (+ (+ (+ x x) x) x) x) 0.294 * * [simplify]: iteration 0 : 8 enodes (cost 4 ) 0.295 * * [simplify]: iteration 1 : 8 enodes (cost 4 ) 0.295 * [simplify]: Simplified to: (+ (+ (+ (+ x x) x) x) x) 0.536 * [regime-testing]: End program error score: 0