Average Error: 0.0 → 0.0
Time: 7.0s
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 r9720439 = x;
        double r9720440 = y;
        double r9720441 = r9720439 * r9720440;
        double r9720442 = z;
        double r9720443 = t;
        double r9720444 = r9720442 * r9720443;
        double r9720445 = r9720441 - r9720444;
        return r9720445;
}
↓
double f(double x, double y, double z, double t) {
        double r9720446 = x;
        double r9720447 = y;
        double r9720448 = r9720446 * r9720447;
        double r9720449 = z;
        double r9720450 = t;
        double r9720451 = r9720449 * r9720450;
        double r9720452 = r9720448 - r9720451;
        return r9720452;
}

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