Average Error: 0.0 → 0.0
Time: 3.6s
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 r67813 = x;
        double r67814 = y;
        double r67815 = r67813 * r67814;
        double r67816 = z;
        double r67817 = t;
        double r67818 = r67816 * r67817;
        double r67819 = r67815 - r67818;
        return r67819;
}
↓
double f(double x, double y, double z, double t) {
        double r67820 = x;
        double r67821 = y;
        double r67822 = r67820 * r67821;
        double r67823 = z;
        double r67824 = t;
        double r67825 = r67823 * r67824;
        double r67826 = r67822 - r67825;
        return r67826;
}

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