1.322 * [progress]: [Phase 1 of 3] Setting up. 0.000 * * * [progress]: [1/2] Preparing points 0.523 * * * [progress]: [2/2] Setting up program. 0.526 * [progress]: [Phase 2 of 3] Improving. 0.526 * [simplify]: Simplifying using # : (if (>=.f64 b 0) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))) (*.f64 2 a)) (/.f64 (*.f64 2 c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))))) 0.526 * * [simplify]: iteration 0 : 22 enodes (cost 58 ) 0.526 * * [simplify]: iteration 1 : 22 enodes (cost 58 ) 0.526 * [simplify]: Simplified to: (if (>=.f64 b 0) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))) (*.f64 2 a)) (/.f64 (*.f64 2 c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))))) 0.526 * * [progress]: iteration 1 / 4 0.527 * * * [progress]: picking best candidate 0.528 * * * * [pick]: Picked #=.f64 b 0) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))) (*.f64 2 a)) (/.f64 (*.f64 2 c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 4 a) c)))))))> 0.528 * * * [progress]: localizing error 0.550 * * * [progress]: generating rewritten candidates 0.550 * * * * [progress]: [ 1 / 4 ] rewriting at (2 3 2 2) 0.550 * * * * [progress]: [ 2 / 4 ] rewriting at (2 2 1 2) 0.550 * * * * [progress]: [ 3 / 4 ] rewriting at (2 2 1) 0.550 * * * * [progress]: [ 4 / 4 ] rewriting at (2 3 2) 0.550 * * * [progress]: generating series expansions 0.550 * * * * [progress]: [ 1 / 4 ] generating series at (2 3 2 2)