Average Error: 0.0 → 0.0
Time: 307.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r98700 = x;
        double r98701 = r98700 * r98700;
        double r98702 = r98700 + r98701;
        return r98702;
}
↓
double f(double x) {
        double r98703 = x;
        double r98704 = r98703 * r98703;
        double r98705 = r98703 + r98704;
        return r98705;
}

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