Average Error: 0.0 → 0.0
Time: 1.6s
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 r107364 = x;
        double r107365 = y;
        double r107366 = r107364 * r107365;
        double r107367 = z;
        double r107368 = t;
        double r107369 = r107367 * r107368;
        double r107370 = r107366 - r107369;
        return r107370;
}
↓
double f(double x, double y, double z, double t) {
        double r107371 = x;
        double r107372 = y;
        double r107373 = r107371 * r107372;
        double r107374 = z;
        double r107375 = t;
        double r107376 = r107374 * r107375;
        double r107377 = r107373 - r107376;
        return r107377;
}

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