Average Error: 0.0 → 0.0
Time: 659.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r130428 = x;
        double r130429 = r130428 * r130428;
        double r130430 = r130428 + r130429;
        return r130430;
}
↓
double f(double x) {
        double r130431 = x;
        double r130432 = r130431 * r130431;
        double r130433 = r130431 + r130432;
        return r130433;
}

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