Average Error: 0.0 → 0.0
Time: 4.6s
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 r125326 = x;
        double r125327 = y;
        double r125328 = r125326 * r125327;
        double r125329 = z;
        double r125330 = t;
        double r125331 = r125329 * r125330;
        double r125332 = r125328 - r125331;
        return r125332;
}
↓
double f(double x, double y, double z, double t) {
        double r125333 = x;
        double r125334 = y;
        double r125335 = r125333 * r125334;
        double r125336 = z;
        double r125337 = t;
        double r125338 = r125336 * r125337;
        double r125339 = r125335 - r125338;
        return r125339;
}

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)))