Average Error: 0.0 → 0.0
Time: 640.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r56447 = x;
        double r56448 = r56447 * r56447;
        double r56449 = r56447 + r56448;
        return r56449;
}
↓
double f(double x) {
        double r56450 = x;
        double r56451 = r56450 * r56450;
        double r56452 = r56450 + r56451;
        return r56452;
}

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