Average Error: 0.0 → 0.0

Time: 1.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 r81096 = x;
        double r81097 = r81096 * r81096;
        double r81098 = r81096 + r81097;
        return r81098;
}

↓

double f(double x) {
        double r81099 = x;
        double r81100 = r81099 * r81099;
        double r81101 = r81099 + r81100;
        return r81101;
}

Error

The X axis uses an exponential scale — Bits error versus `x`

Try it out

In
Out

Enter valid numbers for all inputs

Target

Original	0.0
Target	0.0
Herbie	0.0

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

Derivation

Initial program 0.0
\[x + x \cdot x\]
Final simplification0.0
\[\leadsto x + x \cdot x\]

Reproduce

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

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

  (+ x (* x x)))