Average Error: 0.0 → 0.0
Time: 6.4s
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 r97880 = x;
        double r97881 = y;
        double r97882 = r97880 * r97881;
        double r97883 = z;
        double r97884 = t;
        double r97885 = r97883 * r97884;
        double r97886 = r97882 - r97885;
        return r97886;
}
↓
double f(double x, double y, double z, double t) {
        double r97887 = x;
        double r97888 = y;
        double r97889 = r97887 * r97888;
        double r97890 = z;
        double r97891 = t;
        double r97892 = r97890 * r97891;
        double r97893 = r97889 - r97892;
        return r97893;
}

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