Average Error: 0.0 → 0.0

Time: 446.0ms

Precision: 64

\[0.0 \le x \le 2\]

\[x + x \cdot x\]

↓

\[x + x \cdot x\]

x + x \cdot x

↓

x + x \cdot x

double f(double x) {
        double r99399 = x;
        double r99400 = r99399 * r99399;
        double r99401 = r99399 + r99400;
        return r99401;
}

↓

double f(double x) {
        double r99402 = x;
        double r99403 = r99402 * r99402;
        double r99404 = r99402 + r99403;
        return r99404;
}

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

Reproduce

herbie shell --seed 2020025 +o rules:numerics
(FPCore (x)
  :name "Expression 2, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

  (+ x (* x x)))