Average Error: 0.0 → 0.0
Time: 2.3s
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 r135239 = x;
        double r135240 = y;
        double r135241 = r135239 * r135240;
        double r135242 = z;
        double r135243 = t;
        double r135244 = r135242 * r135243;
        double r135245 = r135241 - r135244;
        return r135245;
}
↓
double f(double x, double y, double z, double t) {
        double r135246 = x;
        double r135247 = y;
        double r135248 = r135246 * r135247;
        double r135249 = z;
        double r135250 = t;
        double r135251 = r135249 * r135250;
        double r135252 = r135248 - r135251;
        return r135252;
}

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