Average Error: 0.0 → 0.0
Time: 3.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 r90212 = x;
        double r90213 = y;
        double r90214 = r90212 * r90213;
        double r90215 = z;
        double r90216 = t;
        double r90217 = r90215 * r90216;
        double r90218 = r90214 - r90217;
        return r90218;
}
↓
double f(double x, double y, double z, double t) {
        double r90219 = x;
        double r90220 = y;
        double r90221 = r90219 * r90220;
        double r90222 = z;
        double r90223 = t;
        double r90224 = r90222 * r90223;
        double r90225 = r90221 - r90224;
        return r90225;
}

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