Average Error: 0.0 → 0.0
Time: 3.0s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r2660628 = x;
        double r2660629 = r2660628 * r2660628;
        double r2660630 = r2660628 + r2660629;
        return r2660630;
}
↓
double f(double x) {
        double r2660631 = x;
        double r2660632 = r2660631 * r2660631;
        double r2660633 = r2660632 + r2660631;
        return r2660633;
}

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