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 r22236 = x;
        double r22237 = y;
        double r22238 = r22236 * r22237;
        double r22239 = z;
        double r22240 = t;
        double r22241 = r22239 * r22240;
        double r22242 = r22238 - r22241;
        return r22242;
}
↓
double f(double x, double y, double z, double t) {
        double r22243 = x;
        double r22244 = y;
        double r22245 = r22243 * r22244;
        double r22246 = z;
        double r22247 = t;
        double r22248 = r22246 * r22247;
        double r22249 = r22245 - r22248;
        return r22249;
}

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