Average Error: 0.0 → 0.0
Time: 1.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 r118235 = x;
        double r118236 = y;
        double r118237 = r118235 * r118236;
        double r118238 = z;
        double r118239 = t;
        double r118240 = r118238 * r118239;
        double r118241 = r118237 - r118240;
        return r118241;
}
↓
double f(double x, double y, double z, double t) {
        double r118242 = x;
        double r118243 = y;
        double r118244 = r118242 * r118243;
        double r118245 = z;
        double r118246 = t;
        double r118247 = r118245 * r118246;
        double r118248 = r118244 - r118247;
        return r118248;
}

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