Average Error: 0.0 → 0.0
Time: 5.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 r134272 = x;
        double r134273 = y;
        double r134274 = r134272 * r134273;
        double r134275 = z;
        double r134276 = t;
        double r134277 = r134275 * r134276;
        double r134278 = r134274 - r134277;
        return r134278;
}
↓
double f(double x, double y, double z, double t) {
        double r134279 = x;
        double r134280 = y;
        double r134281 = r134279 * r134280;
        double r134282 = z;
        double r134283 = t;
        double r134284 = r134282 * r134283;
        double r134285 = r134281 - r134284;
        return r134285;
}

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