Average Error: 0.0 → 0.0
Time: 7.6s
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 r2622720 = x;
        double r2622721 = y;
        double r2622722 = r2622720 * r2622721;
        double r2622723 = z;
        double r2622724 = t;
        double r2622725 = r2622723 * r2622724;
        double r2622726 = r2622722 - r2622725;
        return r2622726;
}
↓
double f(double x, double y, double z, double t) {
        double r2622727 = x;
        double r2622728 = y;
        double r2622729 = r2622727 * r2622728;
        double r2622730 = z;
        double r2622731 = t;
        double r2622732 = r2622730 * r2622731;
        double r2622733 = r2622729 - r2622732;
        return r2622733;
}

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