Average Error: 0.0 → 0.0
Time: 2.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 r102922 = x;
        double r102923 = y;
        double r102924 = r102922 * r102923;
        double r102925 = z;
        double r102926 = t;
        double r102927 = r102925 * r102926;
        double r102928 = r102924 + r102927;
        double r102929 = a;
        double r102930 = b;
        double r102931 = r102929 * r102930;
        double r102932 = r102928 + r102931;
        return r102932;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r102933 = x;
        double r102934 = y;
        double r102935 = r102933 * r102934;
        double r102936 = z;
        double r102937 = t;
        double r102938 = r102936 * r102937;
        double r102939 = r102935 + r102938;
        double r102940 = a;
        double r102941 = b;
        double r102942 = r102940 * r102941;
        double r102943 = r102939 + r102942;
        return r102943;
}

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