Average Error: 0.0 → 0.0
Time: 3.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r98459 = x;
        double r98460 = r98459 * r98459;
        double r98461 = r98459 + r98460;
        return r98461;
}
↓
double f(double x) {
        double r98462 = x;
        double r98463 = r98462 * r98462;
        double r98464 = r98462 + r98463;
        return r98464;
}

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