Average Error: 0.0 → 0.0
Time: 743.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r192604 = x;
        double r192605 = r192604 * r192604;
        double r192606 = r192604 + r192605;
        return r192606;
}
↓
double f(double x) {
        double r192607 = x;
        double r192608 = r192607 * r192607;
        double r192609 = r192607 + r192608;
        return r192609;
}

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