Average Error: 0.0 → 0.0
Time: 535.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 r119335 = x;
        double r119336 = r119335 * r119335;
        double r119337 = r119335 + r119336;
        return r119337;
}
↓
double f(double x) {
        double r119338 = x;
        double r119339 = r119338 * r119338;
        double r119340 = r119338 + r119339;
        return r119340;
}

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

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

  (+ x (* x x)))