Average Error: 0.0 → 0.0
Time: 919.0ms
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 r84353 = x;
        double r84354 = y;
        double r84355 = r84353 * r84354;
        double r84356 = z;
        double r84357 = t;
        double r84358 = r84356 * r84357;
        double r84359 = r84355 - r84358;
        return r84359;
}
↓
double f(double x, double y, double z, double t) {
        double r84360 = x;
        double r84361 = y;
        double r84362 = r84360 * r84361;
        double r84363 = z;
        double r84364 = t;
        double r84365 = r84363 * r84364;
        double r84366 = r84362 - r84365;
        return r84366;
}

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