Average Error: 0.0 → 0.0
Time: 1.7s
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 r103925 = x;
        double r103926 = y;
        double r103927 = r103925 * r103926;
        double r103928 = z;
        double r103929 = t;
        double r103930 = r103928 * r103929;
        double r103931 = r103927 - r103930;
        return r103931;
}
↓
double f(double x, double y, double z, double t) {
        double r103932 = x;
        double r103933 = y;
        double r103934 = r103932 * r103933;
        double r103935 = z;
        double r103936 = t;
        double r103937 = r103935 * r103936;
        double r103938 = r103934 - r103937;
        return r103938;
}

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