Average Error: 0.0 → 0.0
Time: 24.9s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r6472814 = x;
        double r6472815 = r6472814 * r6472814;
        double r6472816 = r6472814 + r6472815;
        return r6472816;
}
↓
double f(double x) {
        double r6472817 = x;
        double r6472818 = r6472817 * r6472817;
        double r6472819 = r6472818 + r6472817;
        return r6472819;
}

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