Average Error: 0.0 → 0.0
Time: 4.1s
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 r6840404 = x;
        double r6840405 = y;
        double r6840406 = r6840404 * r6840405;
        double r6840407 = z;
        double r6840408 = t;
        double r6840409 = r6840407 * r6840408;
        double r6840410 = r6840406 - r6840409;
        return r6840410;
}
↓
double f(double x, double y, double z, double t) {
        double r6840411 = x;
        double r6840412 = y;
        double r6840413 = r6840411 * r6840412;
        double r6840414 = z;
        double r6840415 = t;
        double r6840416 = r6840414 * r6840415;
        double r6840417 = r6840413 - r6840416;
        return r6840417;
}

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