Average Error: 0.0 → 0.0
Time: 9.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 r5951648 = x;
        double r5951649 = y;
        double r5951650 = r5951648 * r5951649;
        double r5951651 = z;
        double r5951652 = t;
        double r5951653 = r5951651 * r5951652;
        double r5951654 = r5951650 - r5951653;
        return r5951654;
}
↓
double f(double x, double y, double z, double t) {
        double r5951655 = x;
        double r5951656 = y;
        double r5951657 = r5951655 * r5951656;
        double r5951658 = z;
        double r5951659 = t;
        double r5951660 = r5951658 * r5951659;
        double r5951661 = r5951657 - r5951660;
        return r5951661;
}

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