Average Error: 0.0 → 0.0
Time: 594.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 r132382 = x;
        double r132383 = y;
        double r132384 = r132382 * r132383;
        double r132385 = z;
        double r132386 = t;
        double r132387 = r132385 * r132386;
        double r132388 = r132384 - r132387;
        return r132388;
}
↓
double f(double x, double y, double z, double t) {
        double r132389 = x;
        double r132390 = y;
        double r132391 = r132389 * r132390;
        double r132392 = z;
        double r132393 = t;
        double r132394 = r132392 * r132393;
        double r132395 = r132391 - r132394;
        return r132395;
}

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