Average Error: 0.0 → 0.0
Time: 3.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 r125321 = x;
        double r125322 = y;
        double r125323 = r125321 * r125322;
        double r125324 = z;
        double r125325 = t;
        double r125326 = r125324 * r125325;
        double r125327 = r125323 - r125326;
        return r125327;
}
↓
double f(double x, double y, double z, double t) {
        double r125328 = x;
        double r125329 = y;
        double r125330 = r125328 * r125329;
        double r125331 = z;
        double r125332 = t;
        double r125333 = r125331 * r125332;
        double r125334 = r125330 - r125333;
        return r125334;
}

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