Average Error: 0.0 → 0.0
Time: 11.2s
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 r4865177 = x;
        double r4865178 = y;
        double r4865179 = r4865177 * r4865178;
        double r4865180 = r4865179 + r4865177;
        double r4865181 = r4865180 + r4865178;
        return r4865181;
}
↓
double f(double x, double y) {
        double r4865182 = y;
        double r4865183 = x;
        double r4865184 = r4865183 * r4865182;
        double r4865185 = r4865183 + r4865184;
        double r4865186 = r4865182 + r4865185;
        return r4865186;
}

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