Average Error: 0.0 → 0.0
Time: 3.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 r107867 = x;
        double r107868 = y;
        double r107869 = r107867 * r107868;
        double r107870 = z;
        double r107871 = t;
        double r107872 = r107870 * r107871;
        double r107873 = r107869 + r107872;
        double r107874 = a;
        double r107875 = b;
        double r107876 = r107874 * r107875;
        double r107877 = r107873 + r107876;
        return r107877;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r107878 = x;
        double r107879 = y;
        double r107880 = r107878 * r107879;
        double r107881 = z;
        double r107882 = t;
        double r107883 = r107881 * r107882;
        double r107884 = r107880 + r107883;
        double r107885 = a;
        double r107886 = b;
        double r107887 = r107885 * r107886;
        double r107888 = r107884 + r107887;
        return r107888;
}

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