Average Error: 0.0 → 0.0
Time: 2.8s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r94179 = x;
        double r94180 = r94179 * r94179;
        double r94181 = r94179 + r94180;
        return r94181;
}
↓
double f(double x) {
        double r94182 = x;
        double r94183 = r94182 * r94182;
        double r94184 = r94182 + r94183;
        return r94184;
}

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