Average Error: 0.0 → 0.0
Time: 12.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 r105878 = x;
        double r105879 = y;
        double r105880 = r105878 * r105879;
        double r105881 = z;
        double r105882 = t;
        double r105883 = r105881 * r105882;
        double r105884 = r105880 - r105883;
        return r105884;
}
↓
double f(double x, double y, double z, double t) {
        double r105885 = x;
        double r105886 = y;
        double r105887 = r105885 * r105886;
        double r105888 = z;
        double r105889 = t;
        double r105890 = r105888 * r105889;
        double r105891 = r105887 - r105890;
        return r105891;
}

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