Average Error: 0.0 → 0.0

Time: 785.0ms

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 r77007 = x;
        double r77008 = r77007 * r77007;
        double r77009 = r77007 + r77008;
        return r77009;
}

↓

double f(double x) {
        double r77010 = x;
        double r77011 = r77010 * r77010;
        double r77012 = r77010 + r77011;
        return r77012;
}

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

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

  (+ x (* x x)))