Average Error: 0.0 → 0.0
Time: 26.0s
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 r5194089 = x;
        double r5194090 = r5194089 * r5194089;
        double r5194091 = r5194089 + r5194090;
        return r5194091;
}
↓
double f(double x) {
        double r5194092 = x;
        double r5194093 = r5194092 * r5194092;
        double r5194094 = r5194092 + r5194093;
        return r5194094;
}

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 2019200 
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0.0 x 2.0)

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

  (+ x (* x x)))