Average Error: 0.0 → 0.0
Time: 653.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r96608 = x;
        double r96609 = r96608 * r96608;
        double r96610 = r96608 + r96609;
        return r96610;
}
↓
double f(double x) {
        double r96611 = x;
        double r96612 = r96611 * r96611;
        double r96613 = r96611 + r96612;
        return r96613;
}

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