Average Error: 0.0 → 0.0
Time: 2.1s
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 r100710 = x;
        double r100711 = y;
        double r100712 = r100710 * r100711;
        double r100713 = z;
        double r100714 = t;
        double r100715 = r100713 * r100714;
        double r100716 = r100712 + r100715;
        double r100717 = a;
        double r100718 = b;
        double r100719 = r100717 * r100718;
        double r100720 = r100716 + r100719;
        return r100720;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r100721 = x;
        double r100722 = y;
        double r100723 = r100721 * r100722;
        double r100724 = z;
        double r100725 = t;
        double r100726 = r100724 * r100725;
        double r100727 = r100723 + r100726;
        double r100728 = a;
        double r100729 = b;
        double r100730 = r100728 * r100729;
        double r100731 = r100727 + r100730;
        return r100731;
}

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