Average Error: 0.0 → 0.0
Time: 794.0ms
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 r119693 = x;
        double r119694 = y;
        double r119695 = r119693 * r119694;
        double r119696 = z;
        double r119697 = t;
        double r119698 = r119696 * r119697;
        double r119699 = r119695 - r119698;
        return r119699;
}
↓
double f(double x, double y, double z, double t) {
        double r119700 = x;
        double r119701 = y;
        double r119702 = r119700 * r119701;
        double r119703 = z;
        double r119704 = t;
        double r119705 = r119703 * r119704;
        double r119706 = r119702 - r119705;
        return r119706;
}

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