Average Error: 0.0 → 0.0
Time: 4.4s
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 r7363877 = x;
        double r7363878 = y;
        double r7363879 = r7363877 * r7363878;
        double r7363880 = z;
        double r7363881 = t;
        double r7363882 = r7363880 * r7363881;
        double r7363883 = r7363879 + r7363882;
        double r7363884 = a;
        double r7363885 = b;
        double r7363886 = r7363884 * r7363885;
        double r7363887 = r7363883 + r7363886;
        return r7363887;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r7363888 = z;
        double r7363889 = t;
        double r7363890 = r7363888 * r7363889;
        double r7363891 = x;
        double r7363892 = y;
        double r7363893 = r7363891 * r7363892;
        double r7363894 = r7363890 + r7363893;
        double r7363895 = a;
        double r7363896 = b;
        double r7363897 = r7363895 * r7363896;
        double r7363898 = r7363894 + r7363897;
        return r7363898;
}

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