Average Error: 0.0 → 0.0
Time: 641.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[\left(1 + x\right) \cdot x\]
x + x \cdot x
↓
\left(1 + x\right) \cdot x
double f(double x) {
        double r131979 = x;
        double r131980 = r131979 * r131979;
        double r131981 = r131979 + r131980;
        return r131981;
}
↓
double f(double x) {
        double r131982 = 1.0;
        double r131983 = x;
        double r131984 = r131982 + r131983;
        double r131985 = r131984 * r131983;
        return r131985;
}

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. Using strategy rm

  3. Applied distribute-rgt1-in0.0

    \[\leadsto \color{blue}{\left(x + 1\right) \cdot x}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{\left(1 + x\right)} \cdot x\]

  5. Final simplification0.0

    \[\leadsto \left(1 + x\right) \cdot x\]

Reproduce

herbie shell --seed 2019354 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))