Average Error: 0.0 → 0.0
Time: 351.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r132273 = x;
        double r132274 = r132273 * r132273;
        double r132275 = r132273 + r132274;
        return r132275;
}
↓
double f(double x) {
        double r132276 = x;
        double r132277 = r132276 * r132276;
        double r132278 = r132276 + r132277;
        return r132278;
}

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 2020062 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))