Average Error: 0.0 → 0.0
Time: 2.7s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r81092 = x;
        double r81093 = r81092 * r81092;
        double r81094 = r81092 + r81093;
        return r81094;
}
↓
double f(double x) {
        double r81095 = x;
        double r81096 = r81095 * r81095;
        double r81097 = r81095 + r81096;
        return r81097;
}

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