Average Error: 0.0 → 0.0
Time: 592.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r125469 = x;
        double r125470 = r125469 * r125469;
        double r125471 = r125469 + r125470;
        return r125471;
}
↓
double f(double x) {
        double r125472 = x;
        double r125473 = r125472 * r125472;
        double r125474 = r125472 + r125473;
        return r125474;
}

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