Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r109689 = x;
        double r109690 = r109689 * r109689;
        double r109691 = r109689 + r109690;
        return r109691;
}
↓
double f(double x) {
        double r109692 = x;
        double r109693 = r109692 * r109692;
        double r109694 = r109692 + r109693;
        return r109694;
}

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