Average Error: 0.0 → 0.0
Time: 3.5s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r6657167 = x;
        double r6657168 = r6657167 * r6657167;
        double r6657169 = r6657167 + r6657168;
        return r6657169;
}
↓
double f(double x) {
        double r6657170 = x;
        double r6657171 = r6657170 * r6657170;
        double r6657172 = r6657171 + r6657170;
        return r6657172;
}

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