Average Error: 0.0 → 0.0
Time: 11.7s
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 r133436 = x;
        double r133437 = y;
        double r133438 = r133436 * r133437;
        double r133439 = z;
        double r133440 = t;
        double r133441 = r133439 * r133440;
        double r133442 = r133438 - r133441;
        return r133442;
}
↓
double f(double x, double y, double z, double t) {
        double r133443 = x;
        double r133444 = y;
        double r133445 = r133443 * r133444;
        double r133446 = z;
        double r133447 = t;
        double r133448 = r133446 * r133447;
        double r133449 = r133445 - r133448;
        return r133449;
}

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