22.176 * [progress]: [Phase 1 of 3] Setting up. 0.001 * * * [progress]: [1/2] Preparing points 0.011 * * * [progress]: [2/2] Setting up program. 0.013 * [progress]: [Phase 2 of 3] Improving. 0.013 * [simplify]: Simplifying using # : (- (+ x y) (* x y)) 0.015 * * [simplify]: iteration 0 : 11 enodes (cost 3 ) 0.017 * * [simplify]: iteration 1 : 25 enodes (cost 3 ) 0.018 * * [simplify]: iteration 2 : 43 enodes (cost 3 ) 0.020 * * [simplify]: iteration 3 : 66 enodes (cost 3 ) 0.021 * * [simplify]: iteration 4 : 92 enodes (cost 3 ) 0.024 * * [simplify]: iteration 5 : 166 enodes (cost 3 ) 0.026 * * [simplify]: iteration 6 : 384 enodes (cost 2 ) 0.031 * * [simplify]: iteration 7 : 629 enodes (cost 2 ) 0.039 * * [simplify]: iteration 8 : 1019 enodes (cost 2 ) 0.050 * * [simplify]: iteration 9 : 1201 enodes (cost 2 ) 0.062 * * [simplify]: iteration 10 : 1503 enodes (cost 2 ) 0.085 * * [simplify]: iteration 11 : 3124 enodes (cost 2 ) 0.200 * * [simplify]: iteration 12 : 5001 enodes (cost 2 ) 0.201 * [simplify]: Simplified to: (fma (- 1 x) y x) 0.206 * * [progress]: iteration 1 / 4 0.206 * * * [progress]: picking best candidate 0.208 * * * * [pick]: Picked # 0.208 * * * [progress]: localizing error 0.212 * * * [progress]: generating rewritten candidates 0.212 * * * [progress]: generating series expansions 0.212 * * * [progress]: simplifying candidates 0.212 * [simplify]: Simplifying using # : 0.214 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 0.214 * [simplify]: Simplified to: 0.214 * * * [progress]: adding candidates to table 0.215 * [progress]: [Phase 3 of 3] Extracting. 0.216 * [simplify]: Simplifying using # : (fma (- 1 x) y x) 0.217 * * [simplify]: iteration 0 : 7 enodes (cost 2 ) 0.217 * * [simplify]: iteration 1 : 7 enodes (cost 2 ) 0.217 * [simplify]: Simplified to: (fma (- 1 x) y x) 0.594 * [regime-testing]: End program error score: 0.005125640705088136