Average Error: 0.0 → 0.0
Time: 583.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 r110921 = x;
        double r110922 = r110921 * r110921;
        double r110923 = r110921 + r110922;
        return r110923;
}
↓
double f(double x) {
        double r110924 = x;
        double r110925 = r110924 * r110924;
        double r110926 = r110924 + r110925;
        return r110926;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(1 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Final simplification0.0

    \[\leadsto x + x \cdot x\]

Reproduce

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

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

  (+ x (* x x)))