Average Error: 0.0 → 0.0
Time: 6.0s
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 r75275 = x;
        double r75276 = y;
        double r75277 = r75275 * r75276;
        double r75278 = r75277 + r75275;
        double r75279 = r75278 + r75276;
        return r75279;
}
↓
double f(double x, double y) {
        double r75280 = x;
        double r75281 = y;
        double r75282 = r75281 * r75280;
        double r75283 = r75280 + r75282;
        double r75284 = r75283 + r75281;
        return r75284;
}

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 2019179 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  (+ (+ (* x y) x) y))