Average Error: 0.0 → 0.0
Time: 12.3s
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 r6615251 = x;
        double r6615252 = y;
        double r6615253 = r6615251 * r6615252;
        double r6615254 = z;
        double r6615255 = t;
        double r6615256 = r6615254 * r6615255;
        double r6615257 = r6615253 - r6615256;
        return r6615257;
}
↓
double f(double x, double y, double z, double t) {
        double r6615258 = x;
        double r6615259 = y;
        double r6615260 = r6615258 * r6615259;
        double r6615261 = z;
        double r6615262 = t;
        double r6615263 = r6615261 * r6615262;
        double r6615264 = r6615260 - r6615263;
        return r6615264;
}

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