Average Error: 0.0 → 0.0
Time: 11.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 r67646 = x;
        double r67647 = y;
        double r67648 = r67646 * r67647;
        double r67649 = z;
        double r67650 = t;
        double r67651 = r67649 * r67650;
        double r67652 = r67648 - r67651;
        return r67652;
}
↓
double f(double x, double y, double z, double t) {
        double r67653 = x;
        double r67654 = y;
        double r67655 = r67653 * r67654;
        double r67656 = z;
        double r67657 = t;
        double r67658 = r67656 * r67657;
        double r67659 = r67655 - r67658;
        return r67659;
}

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