Average Error: 0.0 → 0.0
Time: 15.7s
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 r6090838 = x;
        double r6090839 = y;
        double r6090840 = r6090838 * r6090839;
        double r6090841 = z;
        double r6090842 = t;
        double r6090843 = r6090841 * r6090842;
        double r6090844 = r6090840 - r6090843;
        return r6090844;
}
↓
double f(double x, double y, double z, double t) {
        double r6090845 = x;
        double r6090846 = y;
        double r6090847 = r6090845 * r6090846;
        double r6090848 = z;
        double r6090849 = t;
        double r6090850 = r6090848 * r6090849;
        double r6090851 = r6090847 - r6090850;
        return r6090851;
}

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