Average Error: 0.0 → 0.0
Time: 12.9s
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 r4766152 = x;
        double r4766153 = y;
        double r4766154 = r4766152 * r4766153;
        double r4766155 = r4766154 + r4766152;
        double r4766156 = r4766155 + r4766153;
        return r4766156;
}
↓
double f(double x, double y) {
        double r4766157 = y;
        double r4766158 = x;
        double r4766159 = r4766158 * r4766157;
        double r4766160 = r4766158 + r4766159;
        double r4766161 = r4766157 + r4766160;
        return r4766161;
}

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))