Average Error: 0.0 → 0.0
Time: 7.0s
Precision: 64
\[x + x \cdot x\]
↓
\[\left(x + 1\right) \cdot x\]
x + x \cdot x
↓
\left(x + 1\right) \cdot x
double f(double x) {
        double r143469 = x;
        double r143470 = r143469 * r143469;
        double r143471 = r143469 + r143470;
        return r143471;
}
↓
double f(double x) {
        double r143472 = x;
        double r143473 = 1.0;
        double r143474 = r143472 + r143473;
        double r143475 = r143474 * r143472;
        return r143475;
}

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. Final simplification0.0

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

Reproduce

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