Average Error: 0.0 → 0.0
Time: 29.2s
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 r2983621 = x;
        double r2983622 = y;
        double r2983623 = r2983621 * r2983622;
        double r2983624 = z;
        double r2983625 = t;
        double r2983626 = r2983624 * r2983625;
        double r2983627 = r2983623 - r2983626;
        return r2983627;
}
↓
double f(double x, double y, double z, double t) {
        double r2983628 = x;
        double r2983629 = y;
        double r2983630 = r2983628 * r2983629;
        double r2983631 = z;
        double r2983632 = t;
        double r2983633 = r2983631 * r2983632;
        double r2983634 = r2983630 - r2983633;
        return r2983634;
}

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