Average Error: 0.0 → 0.0
Time: 8.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 r670 = x;
        double r671 = y;
        double r672 = r670 * r671;
        double r673 = z;
        double r674 = t;
        double r675 = r673 * r674;
        double r676 = r672 + r675;
        double r677 = a;
        double r678 = b;
        double r679 = r677 * r678;
        double r680 = r676 + r679;
        return r680;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r681 = x;
        double r682 = y;
        double r683 = r681 * r682;
        double r684 = z;
        double r685 = t;
        double r686 = r684 * r685;
        double r687 = r683 + r686;
        double r688 = a;
        double r689 = b;
        double r690 = r688 * r689;
        double r691 = r687 + r690;
        return r691;
}

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