Average Error: 0.0 → 0.0
Time: 741.0ms
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 r108510 = x;
        double r108511 = y;
        double r108512 = r108510 * r108511;
        double r108513 = z;
        double r108514 = t;
        double r108515 = r108513 * r108514;
        double r108516 = r108512 - r108515;
        return r108516;
}
↓
double f(double x, double y, double z, double t) {
        double r108517 = x;
        double r108518 = y;
        double r108519 = r108517 * r108518;
        double r108520 = z;
        double r108521 = t;
        double r108522 = r108520 * r108521;
        double r108523 = r108519 - r108522;
        return r108523;
}

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