Average Error: 0.0 → 0.0
Time: 583.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 r98809 = x;
        double r98810 = y;
        double r98811 = r98809 * r98810;
        double r98812 = z;
        double r98813 = t;
        double r98814 = r98812 * r98813;
        double r98815 = r98811 - r98814;
        return r98815;
}
↓
double f(double x, double y, double z, double t) {
        double r98816 = x;
        double r98817 = y;
        double r98818 = r98816 * r98817;
        double r98819 = z;
        double r98820 = t;
        double r98821 = r98819 * r98820;
        double r98822 = r98818 - r98821;
        return r98822;
}

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