Average Error: 0.0 → 0.0
Time: 1.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 r152928 = x;
        double r152929 = y;
        double r152930 = r152928 * r152929;
        double r152931 = z;
        double r152932 = t;
        double r152933 = r152931 * r152932;
        double r152934 = r152930 + r152933;
        double r152935 = a;
        double r152936 = b;
        double r152937 = r152935 * r152936;
        double r152938 = r152934 + r152937;
        return r152938;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r152939 = x;
        double r152940 = y;
        double r152941 = r152939 * r152940;
        double r152942 = z;
        double r152943 = t;
        double r152944 = r152942 * r152943;
        double r152945 = r152941 + r152944;
        double r152946 = a;
        double r152947 = b;
        double r152948 = r152946 * r152947;
        double r152949 = r152945 + r152948;
        return r152949;
}

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