Average Error: 0.0 → 0.0
Time: 850.0ms
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 r128941 = x;
        double r128942 = y;
        double r128943 = r128941 * r128942;
        double r128944 = z;
        double r128945 = t;
        double r128946 = r128944 * r128945;
        double r128947 = r128943 - r128946;
        return r128947;
}
↓
double f(double x, double y, double z, double t) {
        double r128948 = x;
        double r128949 = y;
        double r128950 = r128948 * r128949;
        double r128951 = z;
        double r128952 = t;
        double r128953 = r128951 * r128952;
        double r128954 = r128950 - r128953;
        return r128954;
}

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