Average Error: 0.0 → 0.0
Time: 819.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 r132495 = x;
        double r132496 = y;
        double r132497 = r132495 * r132496;
        double r132498 = z;
        double r132499 = t;
        double r132500 = r132498 * r132499;
        double r132501 = r132497 - r132500;
        return r132501;
}
↓
double f(double x, double y, double z, double t) {
        double r132502 = x;
        double r132503 = y;
        double r132504 = r132502 * r132503;
        double r132505 = z;
        double r132506 = t;
        double r132507 = r132505 * r132506;
        double r132508 = r132504 - r132507;
        return r132508;
}

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