Average Error: 0.0 → 0.0
Time: 2.1s
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 r141384 = x;
        double r141385 = y;
        double r141386 = r141384 * r141385;
        double r141387 = z;
        double r141388 = t;
        double r141389 = r141387 * r141388;
        double r141390 = r141386 - r141389;
        return r141390;
}
↓
double f(double x, double y, double z, double t) {
        double r141391 = x;
        double r141392 = y;
        double r141393 = r141391 * r141392;
        double r141394 = z;
        double r141395 = t;
        double r141396 = r141394 * r141395;
        double r141397 = r141393 - r141396;
        return r141397;
}

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