Average Error: 0.0 → 0.0

Time: 17.8s

Precision: 64

\[0.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 r3667491 = x;
        double r3667492 = r3667491 * r3667491;
        double r3667493 = r3667491 + r3667492;
        return r3667493;
}

↓

double f(double x) {
        double r3667494 = x;
        double r3667495 = r3667494 * r3667494;
        double r3667496 = r3667495 + r3667494;
        return r3667496;
}

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 \cdot x + x\]

Reproduce

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

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

  (+ x (* x x)))