Average Error: 0.0 → 0.0
Time: 809.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 r120102 = x;
        double r120103 = y;
        double r120104 = r120102 * r120103;
        double r120105 = z;
        double r120106 = t;
        double r120107 = r120105 * r120106;
        double r120108 = r120104 - r120107;
        return r120108;
}
↓
double f(double x, double y, double z, double t) {
        double r120109 = x;
        double r120110 = y;
        double r120111 = r120109 * r120110;
        double r120112 = z;
        double r120113 = t;
        double r120114 = r120112 * r120113;
        double r120115 = r120111 - r120114;
        return r120115;
}

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