Average Error: 0.0 → 0.0
Time: 1.5s
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 r164589 = x;
        double r164590 = y;
        double r164591 = r164589 * r164590;
        double r164592 = z;
        double r164593 = t;
        double r164594 = r164592 * r164593;
        double r164595 = r164591 - r164594;
        return r164595;
}
↓
double f(double x, double y, double z, double t) {
        double r164596 = x;
        double r164597 = y;
        double r164598 = r164596 * r164597;
        double r164599 = z;
        double r164600 = t;
        double r164601 = r164599 * r164600;
        double r164602 = r164598 - r164601;
        return r164602;
}

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