Average Error: 0.0 → 0.0
Time: 3.3s
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 r104163 = x;
        double r104164 = y;
        double r104165 = r104163 * r104164;
        double r104166 = z;
        double r104167 = t;
        double r104168 = r104166 * r104167;
        double r104169 = r104165 + r104168;
        double r104170 = a;
        double r104171 = b;
        double r104172 = r104170 * r104171;
        double r104173 = r104169 + r104172;
        return r104173;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r104174 = x;
        double r104175 = y;
        double r104176 = r104174 * r104175;
        double r104177 = z;
        double r104178 = t;
        double r104179 = r104177 * r104178;
        double r104180 = r104176 + r104179;
        double r104181 = a;
        double r104182 = b;
        double r104183 = r104181 * r104182;
        double r104184 = r104180 + r104183;
        return r104184;
}

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