Average Error: 0.0 → 0.0
Time: 7.2s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x + y \cdot x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x + y \cdot x\right) + y
double f(double x, double y) {
        double r79176 = x;
        double r79177 = y;
        double r79178 = r79176 * r79177;
        double r79179 = r79178 + r79176;
        double r79180 = r79179 + r79177;
        return r79180;
}
↓
double f(double x, double y) {
        double r79181 = x;
        double r79182 = y;
        double r79183 = r79182 * r79181;
        double r79184 = r79181 + r79183;
        double r79185 = r79184 + r79182;
        return r79185;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + x\right) + y\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019194 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  (+ (+ (* x y) x) y))