Average Error: 0.0 → 0.0
Time: 15.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 r8630498 = x;
        double r8630499 = y;
        double r8630500 = r8630498 * r8630499;
        double r8630501 = z;
        double r8630502 = t;
        double r8630503 = r8630501 * r8630502;
        double r8630504 = r8630500 - r8630503;
        return r8630504;
}
↓
double f(double x, double y, double z, double t) {
        double r8630505 = x;
        double r8630506 = y;
        double r8630507 = r8630505 * r8630506;
        double r8630508 = z;
        double r8630509 = t;
        double r8630510 = r8630508 * r8630509;
        double r8630511 = r8630507 - r8630510;
        return r8630511;
}

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