Average Error: 0.0 → 0.0
Time: 12.8s
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 r119351 = x;
        double r119352 = y;
        double r119353 = r119351 * r119352;
        double r119354 = z;
        double r119355 = t;
        double r119356 = r119354 * r119355;
        double r119357 = r119353 - r119356;
        return r119357;
}
↓
double f(double x, double y, double z, double t) {
        double r119358 = x;
        double r119359 = y;
        double r119360 = r119358 * r119359;
        double r119361 = z;
        double r119362 = t;
        double r119363 = r119361 * r119362;
        double r119364 = r119360 - r119363;
        return r119364;
}

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