Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r105613 = x;
        double r105614 = r105613 * r105613;
        double r105615 = r105613 + r105614;
        return r105615;
}
↓
double f(double x) {
        double r105616 = x;
        double r105617 = r105616 * r105616;
        double r105618 = r105617 + r105616;
        return r105618;
}

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