Average Error: 0.0 → 0.0
Time: 1.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 r126800 = x;
        double r126801 = y;
        double r126802 = r126800 * r126801;
        double r126803 = z;
        double r126804 = t;
        double r126805 = r126803 * r126804;
        double r126806 = r126802 - r126805;
        return r126806;
}
↓
double f(double x, double y, double z, double t) {
        double r126807 = x;
        double r126808 = y;
        double r126809 = r126807 * r126808;
        double r126810 = z;
        double r126811 = t;
        double r126812 = r126810 * r126811;
        double r126813 = r126809 - r126812;
        return r126813;
}

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