Average Error: 0.0 → 0.0
Time: 1.5s
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 r115997 = x;
        double r115998 = y;
        double r115999 = r115997 * r115998;
        double r116000 = z;
        double r116001 = t;
        double r116002 = r116000 * r116001;
        double r116003 = r115999 - r116002;
        return r116003;
}
↓
double f(double x, double y, double z, double t) {
        double r116004 = x;
        double r116005 = y;
        double r116006 = r116004 * r116005;
        double r116007 = z;
        double r116008 = t;
        double r116009 = r116007 * r116008;
        double r116010 = r116006 - r116009;
        return r116010;
}

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