Average Error: 0.0 → 0.0

Time: 995.0ms

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 r3717513 = x;
        double r3717514 = r3717513 * r3717513;
        double r3717515 = r3717513 + r3717514;
        return r3717515;
}

↓

double f(double x) {
        double r3717516 = x;
        double r3717517 = r3717516 * r3717516;
        double r3717518 = r3717517 + r3717516;
        return r3717518;
}

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

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

  (+ x (* x x)))