Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[y + \left(x + x \cdot y\right)\]
\left(x \cdot y + x\right) + y
↓
y + \left(x + x \cdot y\right)
double f(double x, double y) {
        double r4178655 = x;
        double r4178656 = y;
        double r4178657 = r4178655 * r4178656;
        double r4178658 = r4178657 + r4178655;
        double r4178659 = r4178658 + r4178656;
        return r4178659;
}
↓
double f(double x, double y) {
        double r4178660 = y;
        double r4178661 = x;
        double r4178662 = r4178661 * r4178660;
        double r4178663 = r4178661 + r4178662;
        double r4178664 = r4178660 + r4178663;
        return r4178664;
}

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. Final simplification0.0

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

Reproduce

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