Average Error: 0.0 → 0.0
Time: 15.7s
Precision: 64
\[0.0 \le x \le 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
double f(double x) {
        double r10396967 = x;
        double r10396968 = r10396967 * r10396967;
        double r10396969 = r10396967 * r10396968;
        double r10396970 = r10396969 + r10396968;
        return r10396970;
}
↓
double f(double x) {
        double r10396971 = x;
        double r10396972 = r10396971 * r10396971;
        double r10396973 = r10396971 * r10396972;
        double r10396974 = r10396973 + r10396972;
        return r10396974;
}

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\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019173 
(FPCore (x)
  :name "Expression 3, p15"
  :pre (<= 0.0 x 2.0)

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

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