Average Error: 0.0 → 0.0
Time: 3.0s
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 r108870 = x;
        double r108871 = y;
        double r108872 = r108870 * r108871;
        double r108873 = z;
        double r108874 = t;
        double r108875 = r108873 * r108874;
        double r108876 = r108872 - r108875;
        return r108876;
}
↓
double f(double x, double y, double z, double t) {
        double r108877 = x;
        double r108878 = y;
        double r108879 = r108877 * r108878;
        double r108880 = z;
        double r108881 = t;
        double r108882 = r108880 * r108881;
        double r108883 = r108879 - r108882;
        return r108883;
}

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