Average Error: 0.0 → 0.0
Time: 3.4s
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 r127572 = x;
        double r127573 = y;
        double r127574 = r127572 * r127573;
        double r127575 = z;
        double r127576 = t;
        double r127577 = r127575 * r127576;
        double r127578 = r127574 - r127577;
        return r127578;
}
↓
double f(double x, double y, double z, double t) {
        double r127579 = x;
        double r127580 = y;
        double r127581 = r127579 * r127580;
        double r127582 = z;
        double r127583 = t;
        double r127584 = r127582 * r127583;
        double r127585 = r127581 - r127584;
        return r127585;
}

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