Average Error: 0.0 → 0.0
Time: 2.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 r146680 = x;
        double r146681 = y;
        double r146682 = r146680 * r146681;
        double r146683 = z;
        double r146684 = t;
        double r146685 = r146683 * r146684;
        double r146686 = r146682 - r146685;
        return r146686;
}
↓
double f(double x, double y, double z, double t) {
        double r146687 = x;
        double r146688 = y;
        double r146689 = r146687 * r146688;
        double r146690 = z;
        double r146691 = t;
        double r146692 = r146690 * r146691;
        double r146693 = r146689 - r146692;
        return r146693;
}

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