Average Error: 0.0 → 0.0
Time: 15.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 r8038917 = x;
        double r8038918 = y;
        double r8038919 = r8038917 * r8038918;
        double r8038920 = z;
        double r8038921 = t;
        double r8038922 = r8038920 * r8038921;
        double r8038923 = r8038919 - r8038922;
        return r8038923;
}
↓
double f(double x, double y, double z, double t) {
        double r8038924 = x;
        double r8038925 = y;
        double r8038926 = r8038924 * r8038925;
        double r8038927 = z;
        double r8038928 = t;
        double r8038929 = r8038927 * r8038928;
        double r8038930 = r8038926 - r8038929;
        return r8038930;
}

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