Average Error: 0.0 → 0.0
Time: 750.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 r106521 = x;
        double r106522 = y;
        double r106523 = r106521 * r106522;
        double r106524 = z;
        double r106525 = t;
        double r106526 = r106524 * r106525;
        double r106527 = r106523 - r106526;
        return r106527;
}
↓
double f(double x, double y, double z, double t) {
        double r106528 = x;
        double r106529 = y;
        double r106530 = r106528 * r106529;
        double r106531 = z;
        double r106532 = t;
        double r106533 = r106531 * r106532;
        double r106534 = r106530 - r106533;
        return r106534;
}

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