Average Error: 0.0 → 0.0
Time: 9.6s
Precision: 64
\[0.0 \le x \le 2\]
\[x + x \cdot x\]
\[x + x \cdot x\]
x + x \cdot x
x + x \cdot x
double f(double x) {
        double r71891 = x;
        double r71892 = r71891 * r71891;
        double r71893 = r71891 + r71892;
        return r71893;
}

double f(double x) {
        double r71894 = x;
        double r71895 = r71894 * r71894;
        double r71896 = r71894 + r71895;
        return r71896;
}

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(1 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]
  2. Final simplification0.0

    \[\leadsto x + x \cdot x\]

Reproduce

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

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

  (+ x (* x x)))