Average Error: 0.0 → 0.0
Time: 587.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 r97534 = x;
        double r97535 = y;
        double r97536 = r97534 * r97535;
        double r97537 = z;
        double r97538 = t;
        double r97539 = r97537 * r97538;
        double r97540 = r97536 - r97539;
        return r97540;
}
↓
double f(double x, double y, double z, double t) {
        double r97541 = x;
        double r97542 = y;
        double r97543 = r97541 * r97542;
        double r97544 = z;
        double r97545 = t;
        double r97546 = r97544 * r97545;
        double r97547 = r97543 - r97546;
        return r97547;
}

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