Average Error: 0.0 → 0.0
Time: 11.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 r5410989 = x;
        double r5410990 = y;
        double r5410991 = r5410989 * r5410990;
        double r5410992 = r5410991 + r5410989;
        double r5410993 = r5410992 + r5410990;
        return r5410993;
}
↓
double f(double x, double y) {
        double r5410994 = y;
        double r5410995 = x;
        double r5410996 = r5410995 * r5410994;
        double r5410997 = r5410995 + r5410996;
        double r5410998 = r5410994 + r5410997;
        return r5410998;
}

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