Average Error: 0.0 → 0.0
Time: 810.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 r136185 = x;
        double r136186 = y;
        double r136187 = r136185 * r136186;
        double r136188 = z;
        double r136189 = t;
        double r136190 = r136188 * r136189;
        double r136191 = r136187 - r136190;
        return r136191;
}
↓
double f(double x, double y, double z, double t) {
        double r136192 = x;
        double r136193 = y;
        double r136194 = r136192 * r136193;
        double r136195 = z;
        double r136196 = t;
        double r136197 = r136195 * r136196;
        double r136198 = r136194 - r136197;
        return r136198;
}

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