Average Error: 0.0 → 0.0

Time: 654.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 r62231 = x;
        double r62232 = r62231 * r62231;
        double r62233 = r62231 + r62232;
        return r62233;
}

↓

double f(double x) {
        double r62234 = x;
        double r62235 = r62234 * r62234;
        double r62236 = r62234 + r62235;
        return r62236;
}

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 2019303 +o rules:numerics
(FPCore (x)
  :name "Expression 2, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

  (+ x (* x x)))