Average Error: 0.0 → 0.0
Time: 3.1s
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 r145766 = x;
        double r145767 = y;
        double r145768 = r145766 * r145767;
        double r145769 = z;
        double r145770 = t;
        double r145771 = r145769 * r145770;
        double r145772 = r145768 - r145771;
        return r145772;
}
↓
double f(double x, double y, double z, double t) {
        double r145773 = x;
        double r145774 = y;
        double r145775 = r145773 * r145774;
        double r145776 = z;
        double r145777 = t;
        double r145778 = r145776 * r145777;
        double r145779 = r145775 - r145778;
        return r145779;
}

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