Average Error: 0.0 → 0.0
Time: 41.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 r8022312 = x;
        double r8022313 = y;
        double r8022314 = r8022312 * r8022313;
        double r8022315 = z;
        double r8022316 = t;
        double r8022317 = r8022315 * r8022316;
        double r8022318 = r8022314 - r8022317;
        return r8022318;
}
↓
double f(double x, double y, double z, double t) {
        double r8022319 = x;
        double r8022320 = y;
        double r8022321 = r8022319 * r8022320;
        double r8022322 = z;
        double r8022323 = t;
        double r8022324 = r8022322 * r8022323;
        double r8022325 = r8022321 - r8022324;
        return r8022325;
}

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