Average Error: 0.0 → 0.0
Time: 3.2s
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 r105279 = x;
        double r105280 = y;
        double r105281 = r105279 * r105280;
        double r105282 = z;
        double r105283 = t;
        double r105284 = r105282 * r105283;
        double r105285 = r105281 - r105284;
        return r105285;
}
↓
double f(double x, double y, double z, double t) {
        double r105286 = x;
        double r105287 = y;
        double r105288 = r105286 * r105287;
        double r105289 = z;
        double r105290 = t;
        double r105291 = r105289 * r105290;
        double r105292 = r105288 - r105291;
        return r105292;
}

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