Average Error: 0.0 → 0.0
Time: 3.9s
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 r134197 = x;
        double r134198 = y;
        double r134199 = r134197 * r134198;
        double r134200 = z;
        double r134201 = t;
        double r134202 = r134200 * r134201;
        double r134203 = r134199 - r134202;
        return r134203;
}
↓
double f(double x, double y, double z, double t) {
        double r134204 = x;
        double r134205 = y;
        double r134206 = r134204 * r134205;
        double r134207 = z;
        double r134208 = t;
        double r134209 = r134207 * r134208;
        double r134210 = r134206 - r134209;
        return r134210;
}

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