Average Error: 0.0 → 0.0
Time: 3.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 r103178 = x;
        double r103179 = y;
        double r103180 = r103178 * r103179;
        double r103181 = z;
        double r103182 = t;
        double r103183 = r103181 * r103182;
        double r103184 = r103180 - r103183;
        return r103184;
}
↓
double f(double x, double y, double z, double t) {
        double r103185 = x;
        double r103186 = y;
        double r103187 = r103185 * r103186;
        double r103188 = z;
        double r103189 = t;
        double r103190 = r103188 * r103189;
        double r103191 = r103187 - r103190;
        return r103191;
}

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