Average Error: 0.0 → 0.0
Time: 7.6s
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 r217817 = x;
        double r217818 = y;
        double r217819 = r217817 * r217818;
        double r217820 = z;
        double r217821 = t;
        double r217822 = r217820 * r217821;
        double r217823 = r217819 + r217822;
        double r217824 = a;
        double r217825 = b;
        double r217826 = r217824 * r217825;
        double r217827 = r217823 + r217826;
        return r217827;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r217828 = x;
        double r217829 = y;
        double r217830 = r217828 * r217829;
        double r217831 = z;
        double r217832 = t;
        double r217833 = r217831 * r217832;
        double r217834 = r217830 + r217833;
        double r217835 = a;
        double r217836 = b;
        double r217837 = r217835 * r217836;
        double r217838 = r217834 + r217837;
        return r217838;
}

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