Average Error: 0.0 → 0.0
Time: 13.2s
Precision: 64
\[x \cdot y - z \cdot t\]
↓
\[x \cdot y - z \cdot t\]
x \cdot y - z \cdot t
↓
x \cdot y - z \cdot t
double f(double x, double y, double z, double t) {
        double r114888 = x;
        double r114889 = y;
        double r114890 = r114888 * r114889;
        double r114891 = z;
        double r114892 = t;
        double r114893 = r114891 * r114892;
        double r114894 = r114890 - r114893;
        return r114894;
}
↓
double f(double x, double y, double z, double t) {
        double r114895 = x;
        double r114896 = y;
        double r114897 = r114895 * r114896;
        double r114898 = z;
        double r114899 = t;
        double r114900 = r114898 * r114899;
        double r114901 = r114897 - r114900;
        return r114901;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y - z \cdot t\]

  2. Final simplification0.0

    \[\leadsto x \cdot y - z \cdot t\]

Reproduce

herbie shell --seed 2019326 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))