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 r7049712 = x;
        double r7049713 = y;
        double r7049714 = r7049712 * r7049713;
        double r7049715 = z;
        double r7049716 = t;
        double r7049717 = r7049715 * r7049716;
        double r7049718 = r7049714 - r7049717;
        return r7049718;
}
↓
double f(double x, double y, double z, double t) {
        double r7049719 = x;
        double r7049720 = y;
        double r7049721 = r7049719 * r7049720;
        double r7049722 = z;
        double r7049723 = t;
        double r7049724 = r7049722 * r7049723;
        double r7049725 = r7049721 - r7049724;
        return r7049725;
}

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