Average Error: 0.0 → 0.0
Time: 5.6s
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 r118071 = x;
        double r118072 = y;
        double r118073 = r118071 * r118072;
        double r118074 = z;
        double r118075 = t;
        double r118076 = r118074 * r118075;
        double r118077 = r118073 - r118076;
        return r118077;
}
↓
double f(double x, double y, double z, double t) {
        double r118078 = x;
        double r118079 = y;
        double r118080 = r118078 * r118079;
        double r118081 = z;
        double r118082 = t;
        double r118083 = r118081 * r118082;
        double r118084 = r118080 - r118083;
        return r118084;
}

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