Average Error: 0.0 → 0.0
Time: 25.9s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r5973592 = x;
        double r5973593 = r5973592 * r5973592;
        double r5973594 = r5973592 + r5973593;
        return r5973594;
}
↓
double f(double x) {
        double r5973595 = x;
        double r5973596 = r5973595 * r5973595;
        double r5973597 = r5973596 + r5973595;
        return r5973597;
}

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