Average Error: 0.0 → 0.0
Time: 797.0ms
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 r115440 = x;
        double r115441 = y;
        double r115442 = r115440 * r115441;
        double r115443 = r115442 + r115440;
        double r115444 = r115443 + r115441;
        return r115444;
}
↓
double f(double x, double y) {
        double r115445 = x;
        double r115446 = y;
        double r115447 = r115445 * r115446;
        double r115448 = r115447 + r115445;
        double r115449 = r115448 + r115446;
        return r115449;
}

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