Average Error: 0.0 → 0.0
Time: 3.0s
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 r104491 = x;
        double r104492 = r104491 * r104491;
        double r104493 = r104491 + r104492;
        return r104493;
}
↓
double f(double x) {
        double r104494 = x;
        double r104495 = 1.0;
        double r104496 = r104495 + r104494;
        double r104497 = r104494 * r104496;
        return r104497;
}

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. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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