Average Error: 0.0 → 0.0

Time: 2.3s

Precision: 64

\[0 \le x \le 2\]

\[x + x \cdot x\]

↓

\[x \cdot x + x\]

x + x \cdot x

↓

x \cdot x + x

double f(double x) {
        double r13511676 = x;
        double r13511677 = r13511676 * r13511676;
        double r13511678 = r13511676 + r13511677;
        return r13511678;
}

↓

double f(double x) {
        double r13511679 = x;
        double r13511680 = r13511679 * r13511679;
        double r13511681 = r13511680 + r13511679;
        return r13511681;
}

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.0 + x\right) \cdot x\]

Derivation

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

Reproduce

herbie shell --seed 2019124 
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0 x 2)

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

  (+ x (* x x)))