Average Error: 0.0 → 0.0
Time: 2.9s
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 r150598 = x;
        double r150599 = y;
        double r150600 = r150598 * r150599;
        double r150601 = z;
        double r150602 = t;
        double r150603 = r150601 * r150602;
        double r150604 = r150600 - r150603;
        return r150604;
}
↓
double f(double x, double y, double z, double t) {
        double r150605 = x;
        double r150606 = y;
        double r150607 = r150605 * r150606;
        double r150608 = z;
        double r150609 = t;
        double r150610 = r150608 * r150609;
        double r150611 = r150607 - r150610;
        return r150611;
}

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