Average Error: 0.0 → 0.0
Time: 574.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 r118960 = x;
        double r118961 = y;
        double r118962 = r118960 * r118961;
        double r118963 = z;
        double r118964 = t;
        double r118965 = r118963 * r118964;
        double r118966 = r118962 - r118965;
        return r118966;
}
↓
double f(double x, double y, double z, double t) {
        double r118967 = x;
        double r118968 = y;
        double r118969 = r118967 * r118968;
        double r118970 = z;
        double r118971 = t;
        double r118972 = r118970 * r118971;
        double r118973 = r118969 - r118972;
        return r118973;
}

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