Average Error: 0.0 → 0.0
Time: 26.5s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r6603593 = x;
        double r6603594 = r6603593 * r6603593;
        double r6603595 = r6603593 + r6603594;
        return r6603595;
}
↓
double f(double x) {
        double r6603596 = x;
        double r6603597 = r6603596 * r6603596;
        double r6603598 = r6603597 + r6603596;
        return r6603598;
}

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