Average Error: 0.0 → 0.0
Time: 1.3s
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 r128143 = x;
        double r128144 = y;
        double r128145 = r128143 * r128144;
        double r128146 = z;
        double r128147 = t;
        double r128148 = r128146 * r128147;
        double r128149 = r128145 - r128148;
        return r128149;
}
↓
double f(double x, double y, double z, double t) {
        double r128150 = x;
        double r128151 = y;
        double r128152 = r128150 * r128151;
        double r128153 = z;
        double r128154 = t;
        double r128155 = r128153 * r128154;
        double r128156 = r128152 - r128155;
        return r128156;
}

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