Average Error: 0.0 → 0.0
Time: 784.0ms
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 r139865 = x;
        double r139866 = y;
        double r139867 = r139865 * r139866;
        double r139868 = z;
        double r139869 = t;
        double r139870 = r139868 * r139869;
        double r139871 = r139867 - r139870;
        return r139871;
}
↓
double f(double x, double y, double z, double t) {
        double r139872 = x;
        double r139873 = y;
        double r139874 = r139872 * r139873;
        double r139875 = z;
        double r139876 = t;
        double r139877 = r139875 * r139876;
        double r139878 = r139874 - r139877;
        return r139878;
}

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