Average Error: 0.0 → 0.0
Time: 1.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 r129092 = x;
        double r129093 = y;
        double r129094 = r129092 * r129093;
        double r129095 = z;
        double r129096 = t;
        double r129097 = r129095 * r129096;
        double r129098 = r129094 - r129097;
        return r129098;
}
↓
double f(double x, double y, double z, double t) {
        double r129099 = x;
        double r129100 = y;
        double r129101 = r129099 * r129100;
        double r129102 = z;
        double r129103 = t;
        double r129104 = r129102 * r129103;
        double r129105 = r129101 - r129104;
        return r129105;
}

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