Average Error: 0.0 → 0.0
Time: 1.0s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r62430 = x;
        double r62431 = r62430 * r62430;
        double r62432 = r62430 + r62431;
        return r62432;
}
↓
double f(double x) {
        double r62433 = x;
        double r62434 = r62433 * r62433;
        double r62435 = r62433 + r62434;
        return r62435;
}

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