Average Error: 0.0 → 0.0
Time: 6.2s
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 r66924 = x;
        double r66925 = y;
        double r66926 = r66924 * r66925;
        double r66927 = z;
        double r66928 = t;
        double r66929 = r66927 * r66928;
        double r66930 = r66926 - r66929;
        return r66930;
}
↓
double f(double x, double y, double z, double t) {
        double r66931 = x;
        double r66932 = y;
        double r66933 = r66931 * r66932;
        double r66934 = z;
        double r66935 = t;
        double r66936 = r66934 * r66935;
        double r66937 = r66933 - r66936;
        return r66937;
}

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