Average Error: 0.0 → 0.0
Time: 753.0ms
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 r115696 = x;
        double r115697 = y;
        double r115698 = r115696 * r115697;
        double r115699 = z;
        double r115700 = t;
        double r115701 = r115699 * r115700;
        double r115702 = r115698 - r115701;
        return r115702;
}
↓
double f(double x, double y, double z, double t) {
        double r115703 = x;
        double r115704 = y;
        double r115705 = r115703 * r115704;
        double r115706 = z;
        double r115707 = t;
        double r115708 = r115706 * r115707;
        double r115709 = r115705 - r115708;
        return r115709;
}

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