Average Error: 0.0 → 0.0
Time: 2.6s
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 r192032 = x;
        double r192033 = y;
        double r192034 = r192032 * r192033;
        double r192035 = z;
        double r192036 = t;
        double r192037 = r192035 * r192036;
        double r192038 = r192034 - r192037;
        return r192038;
}
↓
double f(double x, double y, double z, double t) {
        double r192039 = x;
        double r192040 = y;
        double r192041 = r192039 * r192040;
        double r192042 = z;
        double r192043 = t;
        double r192044 = r192042 * r192043;
        double r192045 = r192041 - r192044;
        return r192045;
}

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