Average Error: 0.0 → 0.0
Time: 24.1s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r4619088 = x;
        double r4619089 = r4619088 * r4619088;
        double r4619090 = r4619088 + r4619089;
        return r4619090;
}
↓
double f(double x) {
        double r4619091 = x;
        double r4619092 = r4619091 * r4619091;
        double r4619093 = r4619092 + r4619091;
        return r4619093;
}

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