Average Error: 0.0 → 0.0
Time: 11.5s
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 r93642 = x;
        double r93643 = y;
        double r93644 = r93642 * r93643;
        double r93645 = z;
        double r93646 = t;
        double r93647 = r93645 * r93646;
        double r93648 = r93644 - r93647;
        return r93648;
}
↓
double f(double x, double y, double z, double t) {
        double r93649 = x;
        double r93650 = y;
        double r93651 = r93649 * r93650;
        double r93652 = z;
        double r93653 = t;
        double r93654 = r93652 * r93653;
        double r93655 = r93651 - r93654;
        return r93655;
}

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