Average Error: 0.0 → 0.0
Time: 845.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 r11939 = x;
        double r11940 = y;
        double r11941 = r11939 * r11940;
        double r11942 = r11941 + r11939;
        double r11943 = r11942 + r11940;
        return r11943;
}
↓
double f(double x, double y) {
        double r11944 = x;
        double r11945 = y;
        double r11946 = r11944 * r11945;
        double r11947 = r11946 + r11944;
        double r11948 = r11947 + r11945;
        return r11948;
}

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