Average Error: 0.0 → 0.0
Time: 12.3s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(z \cdot t + x \cdot y\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(z \cdot t + x \cdot y\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r6906931 = x;
        double r6906932 = y;
        double r6906933 = r6906931 * r6906932;
        double r6906934 = z;
        double r6906935 = t;
        double r6906936 = r6906934 * r6906935;
        double r6906937 = r6906933 + r6906936;
        double r6906938 = a;
        double r6906939 = b;
        double r6906940 = r6906938 * r6906939;
        double r6906941 = r6906937 + r6906940;
        return r6906941;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r6906942 = z;
        double r6906943 = t;
        double r6906944 = r6906942 * r6906943;
        double r6906945 = x;
        double r6906946 = y;
        double r6906947 = r6906945 * r6906946;
        double r6906948 = r6906944 + r6906947;
        double r6906949 = a;
        double r6906950 = b;
        double r6906951 = r6906949 * r6906950;
        double r6906952 = r6906948 + r6906951;
        return r6906952;
}

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(z \cdot t + x \cdot y\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019169 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))