Average Error: 0.0 → 0.0
Time: 2.8s
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 r499 = x;
        double r500 = y;
        double r501 = r499 * r500;
        double r502 = z;
        double r503 = t;
        double r504 = r502 * r503;
        double r505 = r501 - r504;
        return r505;
}
↓
double f(double x, double y, double z, double t) {
        double r506 = x;
        double r507 = y;
        double r508 = r506 * r507;
        double r509 = z;
        double r510 = t;
        double r511 = r509 * r510;
        double r512 = r508 - r511;
        return r512;
}

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