Average Error: 0.0 → 0.0
Time: 6.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 r101250 = x;
        double r101251 = r101250 * r101250;
        double r101252 = r101250 + r101251;
        return r101252;
}
↓
double f(double x) {
        double r101253 = x;
        double r101254 = r101253 * r101253;
        double r101255 = r101253 + r101254;
        return r101255;
}

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 2019199 +o rules:numerics
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0.0 x 2.0)

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

  (+ x (* x x)))