Average Error: 0.0 → 0.0
Time: 2.7s
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 r142963 = x;
        double r142964 = y;
        double r142965 = r142963 * r142964;
        double r142966 = z;
        double r142967 = t;
        double r142968 = r142966 * r142967;
        double r142969 = r142965 - r142968;
        return r142969;
}
↓
double f(double x, double y, double z, double t) {
        double r142970 = x;
        double r142971 = y;
        double r142972 = r142970 * r142971;
        double r142973 = z;
        double r142974 = t;
        double r142975 = r142973 * r142974;
        double r142976 = r142972 - r142975;
        return r142976;
}

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