Average Error: 0.0 → 0.0
Time: 823.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 r192713 = x;
        double r192714 = y;
        double r192715 = r192713 * r192714;
        double r192716 = z;
        double r192717 = t;
        double r192718 = r192716 * r192717;
        double r192719 = r192715 - r192718;
        return r192719;
}
↓
double f(double x, double y, double z, double t) {
        double r192720 = x;
        double r192721 = y;
        double r192722 = r192720 * r192721;
        double r192723 = z;
        double r192724 = t;
        double r192725 = r192723 * r192724;
        double r192726 = r192722 - r192725;
        return r192726;
}

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