Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r109040 = x;
        double r109041 = r109040 * r109040;
        double r109042 = r109040 + r109041;
        return r109042;
}
↓
double f(double x) {
        double r109043 = x;
        double r109044 = r109043 * r109043;
        double r109045 = r109043 + r109044;
        return r109045;
}

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