Average Error: 0.0 → 0.0
Time: 14.2s
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 r126595 = x;
        double r126596 = y;
        double r126597 = r126595 * r126596;
        double r126598 = z;
        double r126599 = t;
        double r126600 = r126598 * r126599;
        double r126601 = r126597 + r126600;
        double r126602 = a;
        double r126603 = b;
        double r126604 = r126602 * r126603;
        double r126605 = r126601 + r126604;
        return r126605;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r126606 = x;
        double r126607 = y;
        double r126608 = r126606 * r126607;
        double r126609 = z;
        double r126610 = t;
        double r126611 = r126609 * r126610;
        double r126612 = r126608 + r126611;
        double r126613 = a;
        double r126614 = b;
        double r126615 = r126613 * r126614;
        double r126616 = r126612 + r126615;
        return r126616;
}

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