Average Error: 0.0 → 0.0
Time: 5.7s
Precision: 64
\[0.0 \le x \le 2\]
\[x \cdot \left(x \cdot x\right) + x \cdot x\]
↓
\[{x}^{3} + x \cdot x\]
x \cdot \left(x \cdot x\right) + x \cdot x
↓
{x}^{3} + x \cdot x
double f(double x) {
        double r110090 = x;
        double r110091 = r110090 * r110090;
        double r110092 = r110090 * r110091;
        double r110093 = r110092 + r110091;
        return r110093;
}
↓
double f(double x) {
        double r110094 = x;
        double r110095 = 3.0;
        double r110096 = pow(r110094, r110095);
        double r110097 = r110094 * r110094;
        double r110098 = r110096 + r110097;
        return r110098;
}

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. Simplified0.0

    \[\leadsto \color{blue}{{x}^{3} + x \cdot x}\]

  3. Final simplification0.0

    \[\leadsto {x}^{3} + x \cdot x\]

Reproduce

herbie shell --seed 2019351 
(FPCore (x)
  :name "Expression 3, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

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