Average Error: 0.0 → 0.0
Time: 790.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r130336 = x;
        double r130337 = r130336 * r130336;
        double r130338 = r130336 + r130337;
        return r130338;
}
↓
double f(double x) {
        double r130339 = x;
        double r130340 = r130339 * r130339;
        double r130341 = r130339 + r130340;
        return r130341;
}

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