Average Error: 0.0 → 0.0
Time: 3.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 r99241 = x;
        double r99242 = y;
        double r99243 = r99241 * r99242;
        double r99244 = z;
        double r99245 = t;
        double r99246 = r99244 * r99245;
        double r99247 = r99243 - r99246;
        return r99247;
}
↓
double f(double x, double y, double z, double t) {
        double r99248 = x;
        double r99249 = y;
        double r99250 = r99248 * r99249;
        double r99251 = z;
        double r99252 = t;
        double r99253 = r99251 * r99252;
        double r99254 = r99250 - r99253;
        return r99254;
}

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