Average Error: 0.0 → 0.0
Time: 715.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 r102904 = x;
        double r102905 = y;
        double r102906 = r102904 * r102905;
        double r102907 = z;
        double r102908 = t;
        double r102909 = r102907 * r102908;
        double r102910 = r102906 - r102909;
        return r102910;
}
↓
double f(double x, double y, double z, double t) {
        double r102911 = x;
        double r102912 = y;
        double r102913 = r102911 * r102912;
        double r102914 = z;
        double r102915 = t;
        double r102916 = r102914 * r102915;
        double r102917 = r102913 - r102916;
        return r102917;
}

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