Average Error: 0.0 → 0.0
Time: 7.0s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r60530 = x;
        double r60531 = r60530 * r60530;
        double r60532 = r60530 + r60531;
        return r60532;
}
↓
double f(double x) {
        double r60533 = x;
        double r60534 = r60533 * r60533;
        double r60535 = r60533 + r60534;
        return r60535;
}

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