1.032 * [progress]: [Phase 1 of 3] Setting up. 0.002 * * * [progress]: [1/2] Preparing points 0.032 * * * [progress]: [2/2] Setting up program. 0.037 * [progress]: [Phase 2 of 3] Improving. 0.040 * [simplify]: Simplifying using # : (- (+ 1.0 x) x) 1.067 * * [simplify]: iteration 0 : 4 enodes (cost 5 ) 1.067 * * [simplify]: iteration 1 : 9 enodes (cost 3 ) 1.067 * * [simplify]: iteration 2 : 17 enodes (cost 1 ) 1.067 * * [simplify]: iteration 3 : 21 enodes (cost 1 ) 1.067 * * [simplify]: iteration 4 : 91 enodes (cost 1 ) 1.067 * * [simplify]: iteration 5 : 309 enodes (cost 1 ) 1.067 * * [simplify]: iteration 6 : 597 enodes (cost 1 ) 1.068 * * [simplify]: iteration 7 : 823 enodes (cost 1 ) 1.068 * * [simplify]: iteration 8 : 2440 enodes (cost 1 ) 1.068 * * [simplify]: iteration 9 : 4732 enodes (cost 1 ) 1.068 * * [simplify]: iteration 10 : 5272 enodes (cost 1 ) 1.069 * [simplify]: Simplified to: 1.0 1.080 * * [progress]: iteration 1 / 4 1.080 * * * [progress]: picking best candidate 1.083 * * * * [pick]: Picked # 1.083 * * * [progress]: localizing error 1.085 * * * [progress]: generating rewritten candidates 1.086 * * * [progress]: generating series expansions 1.087 * * * [progress]: simplifying candidates 1.087 * [simplify]: Simplifying using # : 1.090 * * [simplify]: iteration 0 : 0 enodes (cost 0 ) 1.090 * [simplify]: Simplified to: 1.090 * * * [progress]: adding candidates to table 1.091 * [progress]: [Phase 3 of 3] Extracting. 1.094 * [simplify]: Simplifying using # : 1.0 1.095 * * [simplify]: iteration 0 : 1 enodes (cost 1 ) 1.095 * * [simplify]: iteration 1 : 1 enodes (cost 1 ) 1.095 * [simplify]: Simplified to: 1.0 1.981 * [regime-testing]: End program error score: 0