Average Error: 0.0 → 0.0
Time: 18.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 r124880 = x;
        double r124881 = y;
        double r124882 = r124880 * r124881;
        double r124883 = z;
        double r124884 = t;
        double r124885 = r124883 * r124884;
        double r124886 = r124882 + r124885;
        double r124887 = a;
        double r124888 = b;
        double r124889 = r124887 * r124888;
        double r124890 = r124886 + r124889;
        return r124890;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r124891 = x;
        double r124892 = y;
        double r124893 = r124891 * r124892;
        double r124894 = z;
        double r124895 = t;
        double r124896 = r124894 * r124895;
        double r124897 = r124893 + r124896;
        double r124898 = a;
        double r124899 = b;
        double r124900 = r124898 * r124899;
        double r124901 = r124897 + r124900;
        return r124901;
}

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