Average Error: 0.0 → 0.0
Time: 1.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 r103593 = x;
        double r103594 = y;
        double r103595 = r103593 * r103594;
        double r103596 = z;
        double r103597 = t;
        double r103598 = r103596 * r103597;
        double r103599 = r103595 - r103598;
        return r103599;
}
↓
double f(double x, double y, double z, double t) {
        double r103600 = x;
        double r103601 = y;
        double r103602 = r103600 * r103601;
        double r103603 = z;
        double r103604 = t;
        double r103605 = r103603 * r103604;
        double r103606 = r103602 - r103605;
        return r103606;
}

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