Average Error: 0.0 → 0.0
Time: 14.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 r8500761 = x;
        double r8500762 = y;
        double r8500763 = r8500761 * r8500762;
        double r8500764 = z;
        double r8500765 = t;
        double r8500766 = r8500764 * r8500765;
        double r8500767 = r8500763 - r8500766;
        return r8500767;
}
↓
double f(double x, double y, double z, double t) {
        double r8500768 = x;
        double r8500769 = y;
        double r8500770 = r8500768 * r8500769;
        double r8500771 = z;
        double r8500772 = t;
        double r8500773 = r8500771 * r8500772;
        double r8500774 = r8500770 - r8500773;
        return r8500774;
}

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