Average Error: 0.0 → 0.0
Time: 2.8s
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 r151927 = x;
        double r151928 = y;
        double r151929 = r151927 * r151928;
        double r151930 = z;
        double r151931 = t;
        double r151932 = r151930 * r151931;
        double r151933 = r151929 - r151932;
        return r151933;
}
↓
double f(double x, double y, double z, double t) {
        double r151934 = x;
        double r151935 = y;
        double r151936 = r151934 * r151935;
        double r151937 = z;
        double r151938 = t;
        double r151939 = r151937 * r151938;
        double r151940 = r151936 - r151939;
        return r151940;
}

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