Average Error: 0.0 → 0.0
Time: 1.5s
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 r101877 = x;
        double r101878 = y;
        double r101879 = r101877 * r101878;
        double r101880 = z;
        double r101881 = t;
        double r101882 = r101880 * r101881;
        double r101883 = r101879 - r101882;
        return r101883;
}
↓
double f(double x, double y, double z, double t) {
        double r101884 = x;
        double r101885 = y;
        double r101886 = r101884 * r101885;
        double r101887 = z;
        double r101888 = t;
        double r101889 = r101887 * r101888;
        double r101890 = r101886 - r101889;
        return r101890;
}

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