Average Error: 0.0 → 0.0
Time: 9.8s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r115363 = x;
        double r115364 = r115363 * r115363;
        double r115365 = r115363 + r115364;
        return r115365;
}
↓
double f(double x) {
        double r115366 = x;
        double r115367 = r115366 * r115366;
        double r115368 = r115366 + r115367;
        return r115368;
}

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)))