Average Error: 0.0 → 0.0
Time: 11.1s
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 r98962 = x;
        double r98963 = y;
        double r98964 = r98962 * r98963;
        double r98965 = z;
        double r98966 = t;
        double r98967 = r98965 * r98966;
        double r98968 = r98964 - r98967;
        return r98968;
}
↓
double f(double x, double y, double z, double t) {
        double r98969 = x;
        double r98970 = y;
        double r98971 = r98969 * r98970;
        double r98972 = z;
        double r98973 = t;
        double r98974 = r98972 * r98973;
        double r98975 = r98971 - r98974;
        return r98975;
}

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