Average Error: 0.0 → 0.0
Time: 667.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 r116729 = x;
        double r116730 = y;
        double r116731 = r116729 * r116730;
        double r116732 = z;
        double r116733 = t;
        double r116734 = r116732 * r116733;
        double r116735 = r116731 - r116734;
        return r116735;
}
↓
double f(double x, double y, double z, double t) {
        double r116736 = x;
        double r116737 = y;
        double r116738 = r116736 * r116737;
        double r116739 = z;
        double r116740 = t;
        double r116741 = r116739 * r116740;
        double r116742 = r116738 - r116741;
        return r116742;
}

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