Average Error: 0.0 → 0.0
Time: 3.0s
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 r167694 = x;
        double r167695 = y;
        double r167696 = r167694 * r167695;
        double r167697 = z;
        double r167698 = t;
        double r167699 = r167697 * r167698;
        double r167700 = r167696 - r167699;
        return r167700;
}
↓
double f(double x, double y, double z, double t) {
        double r167701 = x;
        double r167702 = y;
        double r167703 = r167701 * r167702;
        double r167704 = z;
        double r167705 = t;
        double r167706 = r167704 * r167705;
        double r167707 = r167703 - r167706;
        return r167707;
}

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