Average Error: 0.0 → 0.0
Time: 4.2s
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 r7665406 = x;
        double r7665407 = y;
        double r7665408 = r7665406 * r7665407;
        double r7665409 = z;
        double r7665410 = t;
        double r7665411 = r7665409 * r7665410;
        double r7665412 = r7665408 - r7665411;
        return r7665412;
}
↓
double f(double x, double y, double z, double t) {
        double r7665413 = x;
        double r7665414 = y;
        double r7665415 = r7665413 * r7665414;
        double r7665416 = z;
        double r7665417 = t;
        double r7665418 = r7665416 * r7665417;
        double r7665419 = r7665415 - r7665418;
        return r7665419;
}

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