Average Error: 0.0 → 0.0
Time: 7.8s
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 r5508898 = x;
        double r5508899 = y;
        double r5508900 = r5508898 * r5508899;
        double r5508901 = z;
        double r5508902 = t;
        double r5508903 = r5508901 * r5508902;
        double r5508904 = r5508900 - r5508903;
        return r5508904;
}
↓
double f(double x, double y, double z, double t) {
        double r5508905 = x;
        double r5508906 = y;
        double r5508907 = r5508905 * r5508906;
        double r5508908 = z;
        double r5508909 = t;
        double r5508910 = r5508908 * r5508909;
        double r5508911 = r5508907 - r5508910;
        return r5508911;
}

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