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 r144891 = x;
        double r144892 = y;
        double r144893 = r144891 * r144892;
        double r144894 = z;
        double r144895 = t;
        double r144896 = r144894 * r144895;
        double r144897 = r144893 - r144896;
        return r144897;
}
↓
double f(double x, double y, double z, double t) {
        double r144898 = x;
        double r144899 = y;
        double r144900 = r144898 * r144899;
        double r144901 = z;
        double r144902 = t;
        double r144903 = r144901 * r144902;
        double r144904 = r144900 - r144903;
        return r144904;
}

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