Average Error: 0.0 → 0.0
Time: 2.5s
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 r124699 = x;
        double r124700 = y;
        double r124701 = r124699 * r124700;
        double r124702 = z;
        double r124703 = t;
        double r124704 = r124702 * r124703;
        double r124705 = r124701 - r124704;
        return r124705;
}
↓
double f(double x, double y, double z, double t) {
        double r124706 = x;
        double r124707 = y;
        double r124708 = r124706 * r124707;
        double r124709 = z;
        double r124710 = t;
        double r124711 = r124709 * r124710;
        double r124712 = r124708 - r124711;
        return r124712;
}

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