Average Error: 0.0 → 0.0
Time: 12.6s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(x \cdot y + z \cdot t\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r157709 = x;
        double r157710 = y;
        double r157711 = r157709 * r157710;
        double r157712 = z;
        double r157713 = t;
        double r157714 = r157712 * r157713;
        double r157715 = r157711 + r157714;
        double r157716 = a;
        double r157717 = b;
        double r157718 = r157716 * r157717;
        double r157719 = r157715 + r157718;
        return r157719;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r157720 = x;
        double r157721 = y;
        double r157722 = r157720 * r157721;
        double r157723 = z;
        double r157724 = t;
        double r157725 = r157723 * r157724;
        double r157726 = r157722 + r157725;
        double r157727 = a;
        double r157728 = b;
        double r157729 = r157727 * r157728;
        double r157730 = r157726 + r157729;
        return r157730;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + z \cdot t\right) + a \cdot b\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2020083 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  :precision binary64
  (+ (+ (* x y) (* z t)) (* a b)))