Average Error: 0.0 → 0.0
Time: 7.9s
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 r4869773 = x;
        double r4869774 = y;
        double r4869775 = r4869773 * r4869774;
        double r4869776 = z;
        double r4869777 = t;
        double r4869778 = r4869776 * r4869777;
        double r4869779 = r4869775 - r4869778;
        return r4869779;
}
↓
double f(double x, double y, double z, double t) {
        double r4869780 = x;
        double r4869781 = y;
        double r4869782 = r4869780 * r4869781;
        double r4869783 = z;
        double r4869784 = t;
        double r4869785 = r4869783 * r4869784;
        double r4869786 = r4869782 - r4869785;
        return r4869786;
}

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