Average Error: 0.0 → 0.0
Time: 1.5s
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 r119812 = x;
        double r119813 = y;
        double r119814 = r119812 * r119813;
        double r119815 = z;
        double r119816 = t;
        double r119817 = r119815 * r119816;
        double r119818 = r119814 - r119817;
        return r119818;
}
↓
double f(double x, double y, double z, double t) {
        double r119819 = x;
        double r119820 = y;
        double r119821 = r119819 * r119820;
        double r119822 = z;
        double r119823 = t;
        double r119824 = r119822 * r119823;
        double r119825 = r119821 - r119824;
        return r119825;
}

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