Average Error: 0.0 → 0.0
Time: 1.4s
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 r88178 = x;
        double r88179 = y;
        double r88180 = r88178 * r88179;
        double r88181 = z;
        double r88182 = t;
        double r88183 = r88181 * r88182;
        double r88184 = r88180 - r88183;
        return r88184;
}
↓
double f(double x, double y, double z, double t) {
        double r88185 = x;
        double r88186 = y;
        double r88187 = r88185 * r88186;
        double r88188 = z;
        double r88189 = t;
        double r88190 = r88188 * r88189;
        double r88191 = r88187 - r88190;
        return r88191;
}

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)))