Average Error: 0.0 → 0.0
Time: 1.6s
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 r133754 = x;
        double r133755 = y;
        double r133756 = r133754 * r133755;
        double r133757 = z;
        double r133758 = t;
        double r133759 = r133757 * r133758;
        double r133760 = r133756 - r133759;
        return r133760;
}
↓
double f(double x, double y, double z, double t) {
        double r133761 = x;
        double r133762 = y;
        double r133763 = r133761 * r133762;
        double r133764 = z;
        double r133765 = t;
        double r133766 = r133764 * r133765;
        double r133767 = r133763 - r133766;
        return r133767;
}

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