Average Error: 0.0 → 0.0
Time: 8.2s
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 r96875 = x;
        double r96876 = y;
        double r96877 = r96875 * r96876;
        double r96878 = z;
        double r96879 = t;
        double r96880 = r96878 * r96879;
        double r96881 = r96877 - r96880;
        return r96881;
}
↓
double f(double x, double y, double z, double t) {
        double r96882 = x;
        double r96883 = y;
        double r96884 = r96882 * r96883;
        double r96885 = z;
        double r96886 = t;
        double r96887 = r96885 * r96886;
        double r96888 = r96884 - r96887;
        return r96888;
}

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