Average Error: 0.0 → 0.0
Time: 1.3s
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 r96695 = x;
        double r96696 = y;
        double r96697 = r96695 * r96696;
        double r96698 = z;
        double r96699 = t;
        double r96700 = r96698 * r96699;
        double r96701 = r96697 - r96700;
        return r96701;
}
↓
double f(double x, double y, double z, double t) {
        double r96702 = x;
        double r96703 = y;
        double r96704 = r96702 * r96703;
        double r96705 = z;
        double r96706 = t;
        double r96707 = r96705 * r96706;
        double r96708 = r96704 - r96707;
        return r96708;
}

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