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 r163675 = x;
        double r163676 = y;
        double r163677 = r163675 * r163676;
        double r163678 = z;
        double r163679 = t;
        double r163680 = r163678 * r163679;
        double r163681 = r163677 - r163680;
        return r163681;
}
↓
double f(double x, double y, double z, double t) {
        double r163682 = x;
        double r163683 = y;
        double r163684 = r163682 * r163683;
        double r163685 = z;
        double r163686 = t;
        double r163687 = r163685 * r163686;
        double r163688 = r163684 - r163687;
        return r163688;
}

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