Average Error: 0.0 → 0.0
Time: 589.0ms
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 r122886 = x;
        double r122887 = y;
        double r122888 = r122886 * r122887;
        double r122889 = z;
        double r122890 = t;
        double r122891 = r122889 * r122890;
        double r122892 = r122888 - r122891;
        return r122892;
}
↓
double f(double x, double y, double z, double t) {
        double r122893 = x;
        double r122894 = y;
        double r122895 = r122893 * r122894;
        double r122896 = z;
        double r122897 = t;
        double r122898 = r122896 * r122897;
        double r122899 = r122895 - r122898;
        return r122899;
}

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