Average Error: 0.0 → 0.0

Time: 20.7s

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 r9084793 = x;
        double r9084794 = r9084793 * r9084793;
        double r9084795 = r9084793 + r9084794;
        return r9084795;
}

↓

double f(double x) {
        double r9084796 = x;
        double r9084797 = r9084796 * r9084796;
        double r9084798 = r9084797 + r9084796;
        return r9084798;
}

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

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

  (+ x (* x x)))