Average Error: 0.0 → 0.0
Time: 6.3s
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 r120882 = x;
        double r120883 = y;
        double r120884 = r120882 * r120883;
        double r120885 = z;
        double r120886 = t;
        double r120887 = r120885 * r120886;
        double r120888 = r120884 - r120887;
        return r120888;
}
↓
double f(double x, double y, double z, double t) {
        double r120889 = x;
        double r120890 = y;
        double r120891 = r120889 * r120890;
        double r120892 = z;
        double r120893 = t;
        double r120894 = r120892 * r120893;
        double r120895 = r120891 - r120894;
        return r120895;
}

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