2.696 * [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.011 * * [simplify]: iteration 0 : 5 enodes (cost 9 ) 0.012 * * [simplify]: iteration 1 : 12 enodes (cost 9 ) 0.014 * * [simplify]: iteration 2 : 24 enodes (cost 5 ) 0.019 * * [simplify]: iteration 3 : 47 enodes (cost 3 ) 0.030 * * [simplify]: iteration 4 : 65 enodes (cost 3 ) 0.045 * * [simplify]: iteration 5 : 130 enodes (cost 3 ) 0.087 * * [simplify]: iteration 6 : 174 enodes (cost 3 ) 0.162 * * [simplify]: iteration 7 : 197 enodes (cost 3 ) 0.243 * * [simplify]: iteration 8 : 207 enodes (cost 3 ) 0.343 * * [simplify]: iteration 9 : 380 enodes (cost 3 ) 0.690 * * [simplify]: iteration 10 : 887 enodes (cost 3 ) 5.812 * * [simplify]: iteration 11 : 3708 enodes (cost 3 ) 50.395 * * [simplify]: iteration done : 5000 enodes (cost 3 ) 50.395 * [simplify]: Simplified to: (* x 5) 50.397 * * [progress]: iteration 1 / 4 50.397 * * * [progress]: picking best candidate 50.398 * * * * [pick]: Picked # 50.398 * * * [progress]: localizing error 50.403 * * * [progress]: generating rewritten candidates 50.403 * * * [progress]: generating series expansions 50.403 * * * [progress]: simplifying candidates 50.404 * [simplify]: Simplifying using # : 50.404 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 50.404 * * [simplify]: iteration done : 0 enodes (cost 0 ) 50.405 * [simplify]: Simplified to: 50.405 * * * [progress]: adding candidates to table 50.405 * [progress]: [Phase 3 of 3] Extracting. 50.406 * [simplify]: Simplifying using # : (+ (+ (+ (+ x x) x) x) x) 50.406 * * [simplify]: iteration 0 : 5 enodes (cost 9 ) 50.407 * * [simplify]: iteration 1 : 8 enodes (cost 9 ) 50.407 * * [simplify]: iteration done : 8 enodes (cost 9 ) 50.407 * [simplify]: Simplified to: (+ (+ (+ (+ x x) x) x) x) 50.660 * [regime-testing]: End program error score: 0