Average Error: 0.0 → 0.0
Time: 3.8s
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 r136720 = x;
        double r136721 = y;
        double r136722 = r136720 * r136721;
        double r136723 = z;
        double r136724 = t;
        double r136725 = r136723 * r136724;
        double r136726 = r136722 + r136725;
        double r136727 = a;
        double r136728 = b;
        double r136729 = r136727 * r136728;
        double r136730 = r136726 + r136729;
        return r136730;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r136731 = x;
        double r136732 = y;
        double r136733 = r136731 * r136732;
        double r136734 = z;
        double r136735 = t;
        double r136736 = r136734 * r136735;
        double r136737 = r136733 + r136736;
        double r136738 = a;
        double r136739 = b;
        double r136740 = r136738 * r136739;
        double r136741 = r136737 + r136740;
        return r136741;
}

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