Average Error: 0.0 → 0.0
Time: 474.0ms
Precision: binary64
Cost: 576
\[0 \leq x \land x \leq 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
x \cdot \left(x \cdot x\right) + x \cdot x
(FPCore (x) :precision binary64 (+ (* x (* x x)) (* x x)))
↓
(FPCore (x) :precision binary64 (+ (* x (* x x)) (* x x)))
double code(double x) {
	return (x * (x * x)) + (x * x);
}
↓
double code(double x) {
	return (x * (x * x)) + (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
\[\left(\left(1 + x\right) \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x \cdot x\right) + x \cdot x\]

Reproduce

herbie shell --seed 2021042 
(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)))