Average Error: 0.0 → 0.0

Time: 1.7s

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 r175574 = x;
        double r175575 = r175574 * r175574;
        double r175576 = r175574 + r175575;
        return r175576;
}

↓

double f(double x) {
        double r175577 = x;
        double r175578 = r175577 * r175577;
        double r175579 = r175578 + r175577;
        return r175579;
}

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

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

  (+ x (* x x)))