Average Error: 0.0 → 0.0
Time: 2.2s
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 r96158 = x;
        double r96159 = r96158 * r96158;
        double r96160 = r96158 + r96159;
        return r96160;
}
↓
double f(double x) {
        double r96161 = 1.0;
        double r96162 = x;
        double r96163 = r96161 + r96162;
        double r96164 = r96163 * r96162;
        return r96164;
}

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