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 r130918 = x;
        double r130919 = y;
        double r130920 = r130918 * r130919;
        double r130921 = z;
        double r130922 = t;
        double r130923 = r130921 * r130922;
        double r130924 = r130920 - r130923;
        return r130924;
}
↓
double f(double x, double y, double z, double t) {
        double r130925 = x;
        double r130926 = y;
        double r130927 = r130925 * r130926;
        double r130928 = z;
        double r130929 = t;
        double r130930 = r130928 * r130929;
        double r130931 = r130927 - r130930;
        return r130931;
}

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