Average Error: 0.0 → 0.0
Time: 2.9s
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 r122361 = x;
        double r122362 = y;
        double r122363 = r122361 * r122362;
        double r122364 = z;
        double r122365 = t;
        double r122366 = r122364 * r122365;
        double r122367 = r122363 - r122366;
        return r122367;
}
↓
double f(double x, double y, double z, double t) {
        double r122368 = x;
        double r122369 = y;
        double r122370 = r122368 * r122369;
        double r122371 = z;
        double r122372 = t;
        double r122373 = r122371 * r122372;
        double r122374 = r122370 - r122373;
        return r122374;
}

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