Average Error: 0.0 → 0.0

Time: 17.9s

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 r3855300 = x;
        double r3855301 = r3855300 * r3855300;
        double r3855302 = r3855300 + r3855301;
        return r3855302;
}

↓

double f(double x) {
        double r3855303 = x;
        double r3855304 = r3855303 * r3855303;
        double r3855305 = r3855304 + r3855303;
        return r3855305;
}

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

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

  (+ x (* x x)))