Average Error: 0.0 → 0.0
Time: 23.9s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot \left(1 + x\right)\]
x + x \cdot x
↓
x \cdot \left(1 + x\right)
double f(double x) {
        double r6890550 = x;
        double r6890551 = r6890550 * r6890550;
        double r6890552 = r6890550 + r6890551;
        return r6890552;
}
↓
double f(double x) {
        double r6890553 = x;
        double r6890554 = 1.0;
        double r6890555 = r6890554 + r6890553;
        double r6890556 = r6890553 * r6890555;
        return r6890556;
}

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 *-un-lft-identity0.0

    \[\leadsto \color{blue}{1 \cdot x} + x \cdot x\]

  4. Applied distribute-rgt-out0.0

    \[\leadsto \color{blue}{x \cdot \left(1 + x\right)}\]

  5. Final simplification0.0

    \[\leadsto x \cdot \left(1 + x\right)\]

Reproduce

herbie shell --seed 2019164 
(FPCore (x)
  :name "Main:bigenough1 from B"
  (+ x (* x x)))