Average Error: 0.0 → 0.0
Time: 3.9s
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 r6948356 = x;
        double r6948357 = y;
        double r6948358 = r6948356 * r6948357;
        double r6948359 = z;
        double r6948360 = t;
        double r6948361 = r6948359 * r6948360;
        double r6948362 = r6948358 - r6948361;
        return r6948362;
}
↓
double f(double x, double y, double z, double t) {
        double r6948363 = x;
        double r6948364 = y;
        double r6948365 = r6948363 * r6948364;
        double r6948366 = z;
        double r6948367 = t;
        double r6948368 = r6948366 * r6948367;
        double r6948369 = r6948365 - r6948368;
        return r6948369;
}

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