Average Error: 0.0 → 0.0
Time: 847.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 r108036 = x;
        double r108037 = y;
        double r108038 = r108036 * r108037;
        double r108039 = z;
        double r108040 = t;
        double r108041 = r108039 * r108040;
        double r108042 = r108038 - r108041;
        return r108042;
}
↓
double f(double x, double y, double z, double t) {
        double r108043 = x;
        double r108044 = y;
        double r108045 = r108043 * r108044;
        double r108046 = z;
        double r108047 = t;
        double r108048 = r108046 * r108047;
        double r108049 = r108045 - r108048;
        return r108049;
}

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