Average Error: 0.0 → 0.0
Time: 751.0ms
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 r131279 = x;
        double r131280 = y;
        double r131281 = r131279 * r131280;
        double r131282 = z;
        double r131283 = t;
        double r131284 = r131282 * r131283;
        double r131285 = r131281 - r131284;
        return r131285;
}
↓
double f(double x, double y, double z, double t) {
        double r131286 = x;
        double r131287 = y;
        double r131288 = r131286 * r131287;
        double r131289 = z;
        double r131290 = t;
        double r131291 = r131289 * r131290;
        double r131292 = r131288 - r131291;
        return r131292;
}

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