Average Error: 0.0 → 0.0
Time: 3.7s
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 r81646 = x;
        double r81647 = y;
        double r81648 = r81646 * r81647;
        double r81649 = z;
        double r81650 = t;
        double r81651 = r81649 * r81650;
        double r81652 = r81648 - r81651;
        return r81652;
}
↓
double f(double x, double y, double z, double t) {
        double r81653 = x;
        double r81654 = y;
        double r81655 = r81653 * r81654;
        double r81656 = z;
        double r81657 = t;
        double r81658 = r81656 * r81657;
        double r81659 = r81655 - r81658;
        return r81659;
}

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