Average Error: 0.0 → 0.0
Time: 8.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r130913 = x;
        double r130914 = r130913 * r130913;
        double r130915 = r130913 + r130914;
        return r130915;
}
↓
double f(double x) {
        double r130916 = x;
        double r130917 = r130916 * r130916;
        double r130918 = r130916 + r130917;
        return r130918;
}

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