Average Error: 0.0 → 0.0
Time: 7.9s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r71838 = x;
        double r71839 = r71838 * r71838;
        double r71840 = r71838 + r71839;
        return r71840;
}
↓
double f(double x) {
        double r71841 = x;
        double r71842 = r71841 * r71841;
        double r71843 = r71841 + r71842;
        return r71843;
}

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