Average Error: 0.0 → 0.0
Time: 2.5s
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 r135314 = x;
        double r135315 = y;
        double r135316 = r135314 * r135315;
        double r135317 = z;
        double r135318 = t;
        double r135319 = r135317 * r135318;
        double r135320 = r135316 - r135319;
        return r135320;
}
↓
double f(double x, double y, double z, double t) {
        double r135321 = x;
        double r135322 = y;
        double r135323 = r135321 * r135322;
        double r135324 = z;
        double r135325 = t;
        double r135326 = r135324 * r135325;
        double r135327 = r135323 - r135326;
        return r135327;
}

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