Average Error: 0.0 → 0.0

Time: 789.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 r94069 = x;
        double r94070 = r94069 * r94069;
        double r94071 = r94069 + r94070;
        return r94071;
}

↓

double f(double x) {
        double r94072 = x;
        double r94073 = r94072 * r94072;
        double r94074 = r94072 + r94073;
        return r94074;
}

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

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

  (+ x (* x x)))