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 r139566 = x;
        double r139567 = y;
        double r139568 = r139566 * r139567;
        double r139569 = z;
        double r139570 = t;
        double r139571 = r139569 * r139570;
        double r139572 = r139568 - r139571;
        return r139572;
}
↓
double f(double x, double y, double z, double t) {
        double r139573 = x;
        double r139574 = y;
        double r139575 = r139573 * r139574;
        double r139576 = z;
        double r139577 = t;
        double r139578 = r139576 * r139577;
        double r139579 = r139575 - r139578;
        return r139579;
}

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