Average Error: 0.0 → 0.0
Time: 8.5s
Precision: 64
\[\left(x \cdot y + x\right) + y\]
↓
\[\left(x \cdot y + x\right) + y\]
\left(x \cdot y + x\right) + y
↓
\left(x \cdot y + x\right) + y
double f(double x, double y) {
        double r69624 = x;
        double r69625 = y;
        double r69626 = r69624 * r69625;
        double r69627 = r69626 + r69624;
        double r69628 = r69627 + r69625;
        return r69628;
}
↓
double f(double x, double y) {
        double r69629 = x;
        double r69630 = y;
        double r69631 = r69629 * r69630;
        double r69632 = r69631 + r69629;
        double r69633 = r69632 + r69630;
        return r69633;
}

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 \left(x \cdot y + x\right) + y\]

Reproduce

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