Average Error: 0.0 → 0.0
Time: 8.4s
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 r119161 = x;
        double r119162 = r119161 * r119161;
        double r119163 = r119161 + r119162;
        return r119163;
}
↓
double f(double x) {
        double r119164 = x;
        double r119165 = 1.0;
        double r119166 = r119164 + r119165;
        double r119167 = r119166 * r119164;
        return r119167;
}

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