Average Error: 0.0 → 0.0
Time: 10.4s
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 r105299 = x;
        double r105300 = y;
        double r105301 = r105299 * r105300;
        double r105302 = z;
        double r105303 = t;
        double r105304 = r105302 * r105303;
        double r105305 = r105301 - r105304;
        return r105305;
}
↓
double f(double x, double y, double z, double t) {
        double r105306 = x;
        double r105307 = y;
        double r105308 = r105306 * r105307;
        double r105309 = z;
        double r105310 = t;
        double r105311 = r105309 * r105310;
        double r105312 = r105308 - r105311;
        return r105312;
}

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