Average Error: 0.0 → 0.0
Time: 7.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 r7415789 = x;
        double r7415790 = y;
        double r7415791 = r7415789 * r7415790;
        double r7415792 = z;
        double r7415793 = t;
        double r7415794 = r7415792 * r7415793;
        double r7415795 = r7415791 - r7415794;
        return r7415795;
}
↓
double f(double x, double y, double z, double t) {
        double r7415796 = x;
        double r7415797 = y;
        double r7415798 = r7415796 * r7415797;
        double r7415799 = z;
        double r7415800 = t;
        double r7415801 = r7415799 * r7415800;
        double r7415802 = r7415798 - r7415801;
        return r7415802;
}

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