Average Error: 0.0 → 0.0
Time: 1.4s
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 r72922 = x;
        double r72923 = y;
        double r72924 = r72922 * r72923;
        double r72925 = z;
        double r72926 = t;
        double r72927 = r72925 * r72926;
        double r72928 = r72924 - r72927;
        return r72928;
}
↓
double f(double x, double y, double z, double t) {
        double r72929 = x;
        double r72930 = y;
        double r72931 = r72929 * r72930;
        double r72932 = z;
        double r72933 = t;
        double r72934 = r72932 * r72933;
        double r72935 = r72931 - r72934;
        return r72935;
}

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 1978988140 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))