Average Error: 0.0 → 0.0
Time: 637.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 r151095 = x;
        double r151096 = r151095 * r151095;
        double r151097 = r151095 + r151096;
        return r151097;
}
↓
double f(double x) {
        double r151098 = 1.0;
        double r151099 = x;
        double r151100 = r151098 + r151099;
        double r151101 = r151100 * r151099;
        return r151101;
}

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