Average Error: 0.0 → 0.0
Time: 24.8s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r6497762 = x;
        double r6497763 = r6497762 * r6497762;
        double r6497764 = r6497762 + r6497763;
        return r6497764;
}
↓
double f(double x) {
        double r6497765 = x;
        double r6497766 = r6497765 * r6497765;
        double r6497767 = r6497766 + r6497765;
        return r6497767;
}

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)))