Average Error: 0.0 → 0.0
Time: 3.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r124557 = x;
        double r124558 = r124557 * r124557;
        double r124559 = r124557 + r124558;
        return r124559;
}
↓
double f(double x) {
        double r124560 = x;
        double r124561 = r124560 * r124560;
        double r124562 = r124561 + r124560;
        return r124562;
}

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 \cdot x + x\]

Reproduce

herbie shell --seed 2019179 
(FPCore (x)
  :name "Main:bigenough1 from B"
  (+ x (* x x)))