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 r166841 = x;
        double r166842 = y;
        double r166843 = r166841 * r166842;
        double r166844 = z;
        double r166845 = t;
        double r166846 = r166844 * r166845;
        double r166847 = r166843 - r166846;
        return r166847;
}
↓
double f(double x, double y, double z, double t) {
        double r166848 = x;
        double r166849 = y;
        double r166850 = r166848 * r166849;
        double r166851 = z;
        double r166852 = t;
        double r166853 = r166851 * r166852;
        double r166854 = r166850 - r166853;
        return r166854;
}

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