Average Error: 0.0 → 0.0
Time: 1.5s
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 r41135 = x;
        double r41136 = y;
        double r41137 = r41135 * r41136;
        double r41138 = z;
        double r41139 = t;
        double r41140 = r41138 * r41139;
        double r41141 = r41137 - r41140;
        return r41141;
}
↓
double f(double x, double y, double z, double t) {
        double r41142 = x;
        double r41143 = y;
        double r41144 = r41142 * r41143;
        double r41145 = z;
        double r41146 = t;
        double r41147 = r41145 * r41146;
        double r41148 = r41144 - r41147;
        return r41148;
}

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