Average Error: 0.0 → 0.0
Time: 3.8s
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 r74863 = x;
        double r74864 = y;
        double r74865 = r74863 * r74864;
        double r74866 = z;
        double r74867 = t;
        double r74868 = r74866 * r74867;
        double r74869 = r74865 - r74868;
        return r74869;
}
↓
double f(double x, double y, double z, double t) {
        double r74870 = x;
        double r74871 = y;
        double r74872 = r74870 * r74871;
        double r74873 = z;
        double r74874 = t;
        double r74875 = r74873 * r74874;
        double r74876 = r74872 - r74875;
        return r74876;
}

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