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 r173881 = x;
        double r173882 = y;
        double r173883 = r173881 * r173882;
        double r173884 = z;
        double r173885 = t;
        double r173886 = r173884 * r173885;
        double r173887 = r173883 - r173886;
        return r173887;
}
↓
double f(double x, double y, double z, double t) {
        double r173888 = x;
        double r173889 = y;
        double r173890 = r173888 * r173889;
        double r173891 = z;
        double r173892 = t;
        double r173893 = r173891 * r173892;
        double r173894 = r173890 - r173893;
        return r173894;
}

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