Average Error: 0.0 → 0.0
Time: 28.8s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r4722896 = x;
        double r4722897 = r4722896 * r4722896;
        double r4722898 = r4722896 + r4722897;
        return r4722898;
}
↓
double f(double x) {
        double r4722899 = x;
        double r4722900 = r4722899 * r4722899;
        double r4722901 = r4722900 + r4722899;
        return r4722901;
}

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