Average Error: 0.0 → 0.0
Time: 4.4s
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 r115913 = x;
        double r115914 = y;
        double r115915 = r115913 * r115914;
        double r115916 = z;
        double r115917 = t;
        double r115918 = r115916 * r115917;
        double r115919 = r115915 - r115918;
        return r115919;
}
↓
double f(double x, double y, double z, double t) {
        double r115920 = x;
        double r115921 = y;
        double r115922 = r115920 * r115921;
        double r115923 = z;
        double r115924 = t;
        double r115925 = r115923 * r115924;
        double r115926 = r115922 - r115925;
        return r115926;
}

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