Average Error: 0.0 → 0.0
Time: 30.0s
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 r127615 = x;
        double r127616 = y;
        double r127617 = r127615 * r127616;
        double r127618 = z;
        double r127619 = t;
        double r127620 = r127618 * r127619;
        double r127621 = r127617 - r127620;
        return r127621;
}
↓
double f(double x, double y, double z, double t) {
        double r127622 = x;
        double r127623 = y;
        double r127624 = r127622 * r127623;
        double r127625 = z;
        double r127626 = t;
        double r127627 = r127625 * r127626;
        double r127628 = r127624 - r127627;
        return r127628;
}

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