Average Error: 0.0 → 0.0
Time: 1.3s
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 r122392 = x;
        double r122393 = y;
        double r122394 = r122392 * r122393;
        double r122395 = z;
        double r122396 = t;
        double r122397 = r122395 * r122396;
        double r122398 = r122394 - r122397;
        return r122398;
}
↓
double f(double x, double y, double z, double t) {
        double r122399 = x;
        double r122400 = y;
        double r122401 = r122399 * r122400;
        double r122402 = z;
        double r122403 = t;
        double r122404 = r122402 * r122403;
        double r122405 = r122401 - r122404;
        return r122405;
}

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