Average Error: 0.0 → 0.0
Time: 2.4s
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 r159212 = x;
        double r159213 = y;
        double r159214 = r159212 * r159213;
        double r159215 = z;
        double r159216 = t;
        double r159217 = r159215 * r159216;
        double r159218 = r159214 - r159217;
        return r159218;
}
↓
double f(double x, double y, double z, double t) {
        double r159219 = x;
        double r159220 = y;
        double r159221 = r159219 * r159220;
        double r159222 = z;
        double r159223 = t;
        double r159224 = r159222 * r159223;
        double r159225 = r159221 - r159224;
        return r159225;
}

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