Average Error: 0.0 → 0.0
Time: 2.6s
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 r568 = x;
        double r569 = y;
        double r570 = r568 * r569;
        double r571 = z;
        double r572 = t;
        double r573 = r571 * r572;
        double r574 = r570 - r573;
        return r574;
}
↓
double f(double x, double y, double z, double t) {
        double r575 = x;
        double r576 = y;
        double r577 = r575 * r576;
        double r578 = z;
        double r579 = t;
        double r580 = r578 * r579;
        double r581 = r577 - r580;
        return r581;
}

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