Average Error: 0.0 → 0.0
Time: 8.9s
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 r7980940 = x;
        double r7980941 = y;
        double r7980942 = r7980940 * r7980941;
        double r7980943 = z;
        double r7980944 = t;
        double r7980945 = r7980943 * r7980944;
        double r7980946 = r7980942 - r7980945;
        return r7980946;
}
↓
double f(double x, double y, double z, double t) {
        double r7980947 = x;
        double r7980948 = y;
        double r7980949 = r7980947 * r7980948;
        double r7980950 = z;
        double r7980951 = t;
        double r7980952 = r7980950 * r7980951;
        double r7980953 = r7980949 - r7980952;
        return r7980953;
}

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