Average Error: 0.0 → 0.0
Time: 9.4s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r119706 = x;
        double r119707 = r119706 * r119706;
        double r119708 = r119706 + r119707;
        return r119708;
}
↓
double f(double x) {
        double r119709 = x;
        double r119710 = r119709 * r119709;
        double r119711 = r119709 + r119710;
        return r119711;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020045 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))