Average Error: 0.0 → 0.0
Time: 595.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 r145689 = x;
        double r145690 = y;
        double r145691 = r145689 * r145690;
        double r145692 = z;
        double r145693 = t;
        double r145694 = r145692 * r145693;
        double r145695 = r145691 - r145694;
        return r145695;
}
↓
double f(double x, double y, double z, double t) {
        double r145696 = x;
        double r145697 = y;
        double r145698 = r145696 * r145697;
        double r145699 = z;
        double r145700 = t;
        double r145701 = r145699 * r145700;
        double r145702 = r145698 - r145701;
        return r145702;
}

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