Average Error: 0.0 → 0.0
Time: 8.7s
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 r6474596 = x;
        double r6474597 = y;
        double r6474598 = r6474596 * r6474597;
        double r6474599 = z;
        double r6474600 = t;
        double r6474601 = r6474599 * r6474600;
        double r6474602 = r6474598 - r6474601;
        return r6474602;
}
↓
double f(double x, double y, double z, double t) {
        double r6474603 = x;
        double r6474604 = y;
        double r6474605 = r6474603 * r6474604;
        double r6474606 = z;
        double r6474607 = t;
        double r6474608 = r6474606 * r6474607;
        double r6474609 = r6474605 - r6474608;
        return r6474609;
}

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