Average Error: 0.0 → 0.0
Time: 4.2s
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 r131598 = x;
        double r131599 = y;
        double r131600 = r131598 * r131599;
        double r131601 = z;
        double r131602 = t;
        double r131603 = r131601 * r131602;
        double r131604 = r131600 - r131603;
        return r131604;
}
↓
double f(double x, double y, double z, double t) {
        double r131605 = x;
        double r131606 = y;
        double r131607 = r131605 * r131606;
        double r131608 = z;
        double r131609 = t;
        double r131610 = r131608 * r131609;
        double r131611 = r131607 - r131610;
        return r131611;
}

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