Average Error: 0.0 → 0.0
Time: 7.5s
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 r9386907 = x;
        double r9386908 = y;
        double r9386909 = r9386907 * r9386908;
        double r9386910 = z;
        double r9386911 = t;
        double r9386912 = r9386910 * r9386911;
        double r9386913 = r9386909 + r9386912;
        double r9386914 = a;
        double r9386915 = b;
        double r9386916 = r9386914 * r9386915;
        double r9386917 = r9386913 + r9386916;
        return r9386917;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r9386918 = x;
        double r9386919 = y;
        double r9386920 = r9386918 * r9386919;
        double r9386921 = z;
        double r9386922 = t;
        double r9386923 = r9386921 * r9386922;
        double r9386924 = r9386920 + r9386923;
        double r9386925 = a;
        double r9386926 = b;
        double r9386927 = r9386925 * r9386926;
        double r9386928 = r9386924 + r9386927;
        return r9386928;
}

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 2019174 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))