Average Error: 0.0 → 0.0
Time: 1.1s
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 r103928 = x;
        double r103929 = r103928 * r103928;
        double r103930 = r103928 + r103929;
        return r103930;
}
↓
double f(double x) {
        double r103931 = 1.0;
        double r103932 = x;
        double r103933 = r103931 + r103932;
        double r103934 = r103933 * r103932;
        return r103934;
}

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