Average Error: 0.0 → 0.0
Time: 3.3s
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 r86872 = x;
        double r86873 = y;
        double r86874 = r86872 * r86873;
        double r86875 = z;
        double r86876 = t;
        double r86877 = r86875 * r86876;
        double r86878 = r86874 - r86877;
        return r86878;
}
↓
double f(double x, double y, double z, double t) {
        double r86879 = x;
        double r86880 = y;
        double r86881 = r86879 * r86880;
        double r86882 = z;
        double r86883 = t;
        double r86884 = r86882 * r86883;
        double r86885 = r86881 - r86884;
        return r86885;
}

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