Average Error: 0.0 → 0.0
Time: 5.8s
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 r3945792 = x;
        double r3945793 = y;
        double r3945794 = r3945792 * r3945793;
        double r3945795 = r3945794 + r3945792;
        double r3945796 = r3945795 + r3945793;
        return r3945796;
}
↓
double f(double x, double y) {
        double r3945797 = y;
        double r3945798 = x;
        double r3945799 = r3945798 * r3945797;
        double r3945800 = r3945798 + r3945799;
        double r3945801 = r3945797 + r3945800;
        return r3945801;
}

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