Average Error: 0.0 → 0.0
Time: 14.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 r7108856 = x;
        double r7108857 = y;
        double r7108858 = r7108856 * r7108857;
        double r7108859 = z;
        double r7108860 = t;
        double r7108861 = r7108859 * r7108860;
        double r7108862 = r7108858 - r7108861;
        return r7108862;
}
↓
double f(double x, double y, double z, double t) {
        double r7108863 = x;
        double r7108864 = y;
        double r7108865 = r7108863 * r7108864;
        double r7108866 = z;
        double r7108867 = t;
        double r7108868 = r7108866 * r7108867;
        double r7108869 = r7108865 - r7108868;
        return r7108869;
}

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