Average Error: 0.0 → 0.0
Time: 2.5s
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 r135960 = x;
        double r135961 = y;
        double r135962 = r135960 * r135961;
        double r135963 = z;
        double r135964 = t;
        double r135965 = r135963 * r135964;
        double r135966 = r135962 - r135965;
        return r135966;
}
↓
double f(double x, double y, double z, double t) {
        double r135967 = x;
        double r135968 = y;
        double r135969 = r135967 * r135968;
        double r135970 = z;
        double r135971 = t;
        double r135972 = r135970 * r135971;
        double r135973 = r135969 - r135972;
        return r135973;
}

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