Average Error: 0.0 → 0.0
Time: 1.1s
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 r92454 = x;
        double r92455 = y;
        double r92456 = r92454 * r92455;
        double r92457 = z;
        double r92458 = t;
        double r92459 = r92457 * r92458;
        double r92460 = r92456 - r92459;
        return r92460;
}
↓
double f(double x, double y, double z, double t) {
        double r92461 = x;
        double r92462 = y;
        double r92463 = r92461 * r92462;
        double r92464 = z;
        double r92465 = t;
        double r92466 = r92464 * r92465;
        double r92467 = r92463 - r92466;
        return r92467;
}

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