Average Error: 0.0 → 0.0
Time: 851.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 r93032 = x;
        double r93033 = y;
        double r93034 = r93032 * r93033;
        double r93035 = z;
        double r93036 = t;
        double r93037 = r93035 * r93036;
        double r93038 = r93034 - r93037;
        return r93038;
}
↓
double f(double x, double y, double z, double t) {
        double r93039 = x;
        double r93040 = y;
        double r93041 = r93039 * r93040;
        double r93042 = z;
        double r93043 = t;
        double r93044 = r93042 * r93043;
        double r93045 = r93041 - r93044;
        return r93045;
}

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