Average Error: 0.0 → 0.0
Time: 1.1s
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 r82190 = x;
        double r82191 = y;
        double r82192 = r82190 * r82191;
        double r82193 = z;
        double r82194 = t;
        double r82195 = r82193 * r82194;
        double r82196 = r82192 - r82195;
        return r82196;
}
↓
double f(double x, double y, double z, double t) {
        double r82197 = x;
        double r82198 = y;
        double r82199 = r82197 * r82198;
        double r82200 = z;
        double r82201 = t;
        double r82202 = r82200 * r82201;
        double r82203 = r82199 - r82202;
        return r82203;
}

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