Average Error: 0.0 → 0.0
Time: 30.4s
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 r9291319 = x;
        double r9291320 = y;
        double r9291321 = r9291319 * r9291320;
        double r9291322 = z;
        double r9291323 = t;
        double r9291324 = r9291322 * r9291323;
        double r9291325 = r9291321 - r9291324;
        return r9291325;
}
↓
double f(double x, double y, double z, double t) {
        double r9291326 = x;
        double r9291327 = y;
        double r9291328 = r9291326 * r9291327;
        double r9291329 = z;
        double r9291330 = t;
        double r9291331 = r9291329 * r9291330;
        double r9291332 = r9291328 - r9291331;
        return r9291332;
}

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