Average Error: 0.0 → 0.0
Time: 616.0ms
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 r120955 = x;
        double r120956 = y;
        double r120957 = r120955 * r120956;
        double r120958 = z;
        double r120959 = t;
        double r120960 = r120958 * r120959;
        double r120961 = r120957 - r120960;
        return r120961;
}
↓
double f(double x, double y, double z, double t) {
        double r120962 = x;
        double r120963 = y;
        double r120964 = r120962 * r120963;
        double r120965 = z;
        double r120966 = t;
        double r120967 = r120965 * r120966;
        double r120968 = r120964 - r120967;
        return r120968;
}

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