Average Error: 0.0 → 0.0
Time: 11.6s
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 r96089 = x;
        double r96090 = y;
        double r96091 = r96089 * r96090;
        double r96092 = z;
        double r96093 = t;
        double r96094 = r96092 * r96093;
        double r96095 = r96091 - r96094;
        return r96095;
}
↓
double f(double x, double y, double z, double t) {
        double r96096 = x;
        double r96097 = y;
        double r96098 = r96096 * r96097;
        double r96099 = z;
        double r96100 = t;
        double r96101 = r96099 * r96100;
        double r96102 = r96098 - r96101;
        return r96102;
}

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