Average Error: 0.0 → 0.0
Time: 3.8s
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 r95970 = x;
        double r95971 = y;
        double r95972 = r95970 * r95971;
        double r95973 = z;
        double r95974 = t;
        double r95975 = r95973 * r95974;
        double r95976 = r95972 - r95975;
        return r95976;
}
↓
double f(double x, double y, double z, double t) {
        double r95977 = x;
        double r95978 = y;
        double r95979 = r95977 * r95978;
        double r95980 = z;
        double r95981 = t;
        double r95982 = r95980 * r95981;
        double r95983 = r95979 - r95982;
        return r95983;
}

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