Average Error: 0.0 → 0.0
Time: 561.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 r108123 = x;
        double r108124 = y;
        double r108125 = r108123 * r108124;
        double r108126 = z;
        double r108127 = t;
        double r108128 = r108126 * r108127;
        double r108129 = r108125 - r108128;
        return r108129;
}
↓
double f(double x, double y, double z, double t) {
        double r108130 = x;
        double r108131 = y;
        double r108132 = r108130 * r108131;
        double r108133 = z;
        double r108134 = t;
        double r108135 = r108133 * r108134;
        double r108136 = r108132 - r108135;
        return r108136;
}

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