Average Error: 0.0 → 0.0
Time: 5.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 r93523 = x;
        double r93524 = y;
        double r93525 = r93523 * r93524;
        double r93526 = z;
        double r93527 = t;
        double r93528 = r93526 * r93527;
        double r93529 = r93525 + r93528;
        double r93530 = a;
        double r93531 = b;
        double r93532 = r93530 * r93531;
        double r93533 = r93529 + r93532;
        return r93533;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r93534 = x;
        double r93535 = y;
        double r93536 = r93534 * r93535;
        double r93537 = z;
        double r93538 = t;
        double r93539 = r93537 * r93538;
        double r93540 = r93536 + r93539;
        double r93541 = a;
        double r93542 = b;
        double r93543 = r93541 * r93542;
        double r93544 = r93540 + r93543;
        return r93544;
}

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