Average Error: 0.0 → 0.0

Time: 35.1s

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 r5402222 = x;
        double r5402223 = r5402222 * r5402222;
        double r5402224 = r5402222 + r5402223;
        return r5402224;
}

↓

double f(double x) {
        double r5402225 = x;
        double r5402226 = r5402225 * r5402225;
        double r5402227 = r5402226 + r5402225;
        return r5402227;
}

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

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

  (+ x (* x x)))