Average Error: 0.0 → 0.0
Time: 790.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 r132170 = x;
        double r132171 = y;
        double r132172 = r132170 * r132171;
        double r132173 = z;
        double r132174 = t;
        double r132175 = r132173 * r132174;
        double r132176 = r132172 - r132175;
        return r132176;
}
↓
double f(double x, double y, double z, double t) {
        double r132177 = x;
        double r132178 = y;
        double r132179 = r132177 * r132178;
        double r132180 = z;
        double r132181 = t;
        double r132182 = r132180 * r132181;
        double r132183 = r132179 - r132182;
        return r132183;
}

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