Average Error: 0.0 → 0.0
Time: 11.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 r108489 = x;
        double r108490 = y;
        double r108491 = r108489 * r108490;
        double r108492 = z;
        double r108493 = t;
        double r108494 = r108492 * r108493;
        double r108495 = r108491 - r108494;
        return r108495;
}
↓
double f(double x, double y, double z, double t) {
        double r108496 = x;
        double r108497 = y;
        double r108498 = r108496 * r108497;
        double r108499 = z;
        double r108500 = t;
        double r108501 = r108499 * r108500;
        double r108502 = r108498 - r108501;
        return r108502;
}

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