Average Error: 0.0 → 0.0
Time: 5.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 r135128 = x;
        double r135129 = y;
        double r135130 = r135128 * r135129;
        double r135131 = z;
        double r135132 = t;
        double r135133 = r135131 * r135132;
        double r135134 = r135130 - r135133;
        return r135134;
}
↓
double f(double x, double y, double z, double t) {
        double r135135 = x;
        double r135136 = y;
        double r135137 = r135135 * r135136;
        double r135138 = z;
        double r135139 = t;
        double r135140 = r135138 * r135139;
        double r135141 = r135137 - r135140;
        return r135141;
}

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)))