Average Error: 0.0 → 0.0
Time: 31.2s
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 r8115170 = x;
        double r8115171 = y;
        double r8115172 = r8115170 * r8115171;
        double r8115173 = z;
        double r8115174 = t;
        double r8115175 = r8115173 * r8115174;
        double r8115176 = r8115172 - r8115175;
        return r8115176;
}
↓
double f(double x, double y, double z, double t) {
        double r8115177 = x;
        double r8115178 = y;
        double r8115179 = r8115177 * r8115178;
        double r8115180 = z;
        double r8115181 = t;
        double r8115182 = r8115180 * r8115181;
        double r8115183 = r8115179 - r8115182;
        return r8115183;
}

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