Average Error: 0.0 → 0.0
Time: 2.0s
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 r106055 = x;
        double r106056 = y;
        double r106057 = r106055 * r106056;
        double r106058 = z;
        double r106059 = t;
        double r106060 = r106058 * r106059;
        double r106061 = r106057 - r106060;
        return r106061;
}
↓
double f(double x, double y, double z, double t) {
        double r106062 = x;
        double r106063 = y;
        double r106064 = r106062 * r106063;
        double r106065 = z;
        double r106066 = t;
        double r106067 = r106065 * r106066;
        double r106068 = r106064 - r106067;
        return r106068;
}

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