Average Error: 0.0 → 0.0
Time: 7.6s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r58691 = x;
        double r58692 = r58691 * r58691;
        double r58693 = r58691 + r58692;
        return r58693;
}
↓
double f(double x) {
        double r58694 = x;
        double r58695 = r58694 * r58694;
        double r58696 = r58694 + r58695;
        return r58696;
}

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)))