Average Error: 0.0 → 0.0
Time: 7.1s
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 r97502 = x;
        double r97503 = y;
        double r97504 = r97502 * r97503;
        double r97505 = z;
        double r97506 = t;
        double r97507 = r97505 * r97506;
        double r97508 = r97504 - r97507;
        return r97508;
}
↓
double f(double x, double y, double z, double t) {
        double r97509 = x;
        double r97510 = y;
        double r97511 = r97509 * r97510;
        double r97512 = z;
        double r97513 = t;
        double r97514 = r97512 * r97513;
        double r97515 = r97511 - r97514;
        return r97515;
}

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