Average Error: 0.0 → 0.0
Time: 4.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 r142325 = x;
        double r142326 = y;
        double r142327 = r142325 * r142326;
        double r142328 = z;
        double r142329 = t;
        double r142330 = r142328 * r142329;
        double r142331 = r142327 - r142330;
        return r142331;
}
↓
double f(double x, double y, double z, double t) {
        double r142332 = x;
        double r142333 = y;
        double r142334 = r142332 * r142333;
        double r142335 = z;
        double r142336 = t;
        double r142337 = r142335 * r142336;
        double r142338 = r142334 - r142337;
        return r142338;
}

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