Average Error: 0.0 → 0.0
Time: 567.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 r102388 = x;
        double r102389 = r102388 * r102388;
        double r102390 = r102388 + r102389;
        return r102390;
}
↓
double f(double x) {
        double r102391 = 1.0;
        double r102392 = x;
        double r102393 = r102391 + r102392;
        double r102394 = r102393 * r102392;
        return r102394;
}

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