Average Error: 0.0 → 0.0
Time: 1.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r128450 = x;
        double r128451 = r128450 * r128450;
        double r128452 = r128450 + r128451;
        return r128452;
}
↓
double f(double x) {
        double r128453 = x;
        double r128454 = r128453 * r128453;
        double r128455 = r128453 + r128454;
        return r128455;
}

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