Average Error: 0.0 → 0.0
Time: 4.0s
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 r7180749 = x;
        double r7180750 = y;
        double r7180751 = r7180749 * r7180750;
        double r7180752 = z;
        double r7180753 = t;
        double r7180754 = r7180752 * r7180753;
        double r7180755 = r7180751 - r7180754;
        return r7180755;
}
↓
double f(double x, double y, double z, double t) {
        double r7180756 = x;
        double r7180757 = y;
        double r7180758 = r7180756 * r7180757;
        double r7180759 = z;
        double r7180760 = t;
        double r7180761 = r7180759 * r7180760;
        double r7180762 = r7180758 - r7180761;
        return r7180762;
}

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