Average Error: 0.0 → 0.0
Time: 491.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r116116 = x;
        double r116117 = r116116 * r116116;
        double r116118 = r116116 + r116117;
        return r116118;
}
↓
double f(double x) {
        double r116119 = x;
        double r116120 = r116119 * r116119;
        double r116121 = r116119 + r116120;
        return r116121;
}

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