Average Error: 0.0 → 0.0
Time: 9.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 r151839 = x;
        double r151840 = y;
        double r151841 = r151839 * r151840;
        double r151842 = z;
        double r151843 = t;
        double r151844 = r151842 * r151843;
        double r151845 = r151841 + r151844;
        double r151846 = a;
        double r151847 = b;
        double r151848 = r151846 * r151847;
        double r151849 = r151845 + r151848;
        return r151849;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r151850 = x;
        double r151851 = y;
        double r151852 = r151850 * r151851;
        double r151853 = z;
        double r151854 = t;
        double r151855 = r151853 * r151854;
        double r151856 = r151852 + r151855;
        double r151857 = a;
        double r151858 = b;
        double r151859 = r151857 * r151858;
        double r151860 = r151856 + r151859;
        return r151860;
}

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