Average Error: 0.0 → 0.0
Time: 1.6s
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 r10982 = x;
        double r10983 = y;
        double r10984 = r10982 * r10983;
        double r10985 = z;
        double r10986 = t;
        double r10987 = r10985 * r10986;
        double r10988 = r10984 - r10987;
        return r10988;
}
↓
double f(double x, double y, double z, double t) {
        double r10989 = x;
        double r10990 = y;
        double r10991 = r10989 * r10990;
        double r10992 = z;
        double r10993 = t;
        double r10994 = r10992 * r10993;
        double r10995 = r10991 - r10994;
        return r10995;
}

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