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 r6523558 = x;
        double r6523559 = y;
        double r6523560 = r6523558 * r6523559;
        double r6523561 = z;
        double r6523562 = t;
        double r6523563 = r6523561 * r6523562;
        double r6523564 = r6523560 - r6523563;
        return r6523564;
}
↓
double f(double x, double y, double z, double t) {
        double r6523565 = x;
        double r6523566 = y;
        double r6523567 = r6523565 * r6523566;
        double r6523568 = z;
        double r6523569 = t;
        double r6523570 = r6523568 * r6523569;
        double r6523571 = r6523567 - r6523570;
        return r6523571;
}

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