Average Error: 0.0 → 0.0
Time: 1.7s
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 r124114 = x;
        double r124115 = y;
        double r124116 = r124114 * r124115;
        double r124117 = z;
        double r124118 = t;
        double r124119 = r124117 * r124118;
        double r124120 = r124116 - r124119;
        return r124120;
}
↓
double f(double x, double y, double z, double t) {
        double r124121 = x;
        double r124122 = y;
        double r124123 = r124121 * r124122;
        double r124124 = z;
        double r124125 = t;
        double r124126 = r124124 * r124125;
        double r124127 = r124123 - r124126;
        return r124127;
}

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