Average Error: 0.0 → 0.0
Time: 1.3s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) (x * ((double) (x * x)))) + ((double) (x * x))));
}

↓
double code(double x) {
	return ((double) (x * ((double) (x + ((double) (x * x))))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original0.0
Target0.0
Herbie0.0
\[\]
Derivation
  1. Initial program 0.0
    \[\]
  2. Simplified0.0
    \[\leadsto \]
  3. Using strategy rm
  4. Applied cube-mult0.0
    \[\leadsto \]
  5. Applied distribute-lft-out0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2.0)

  :herbie-target
  (* (* (+ 1.0 x) x) x)

  (+ (* x (* x x)) (* x x)))