Average Error: 0.0 → 0.0
Time: 807.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 r101554 = x;
        double r101555 = y;
        double r101556 = r101554 * r101555;
        double r101557 = z;
        double r101558 = t;
        double r101559 = r101557 * r101558;
        double r101560 = r101556 - r101559;
        return r101560;
}
↓
double f(double x, double y, double z, double t) {
        double r101561 = x;
        double r101562 = y;
        double r101563 = r101561 * r101562;
        double r101564 = z;
        double r101565 = t;
        double r101566 = r101564 * r101565;
        double r101567 = r101563 - r101566;
        return r101567;
}

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