Average Error: 0.0 → 0.0
Time: 808.0ms
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 r120587 = x;
        double r120588 = y;
        double r120589 = r120587 * r120588;
        double r120590 = z;
        double r120591 = t;
        double r120592 = r120590 * r120591;
        double r120593 = r120589 - r120592;
        return r120593;
}
↓
double f(double x, double y, double z, double t) {
        double r120594 = x;
        double r120595 = y;
        double r120596 = r120594 * r120595;
        double r120597 = z;
        double r120598 = t;
        double r120599 = r120597 * r120598;
        double r120600 = r120596 - r120599;
        return r120600;
}

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