Average Error: 0.0 → 0.0
Time: 5.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r119243 = x;
        double r119244 = r119243 * r119243;
        double r119245 = r119243 + r119244;
        return r119245;
}
↓
double f(double x) {
        double r119246 = x;
        double r119247 = r119246 * r119246;
        double r119248 = r119246 + r119247;
        return r119248;
}

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