Average Error: 0.0 → 0.0
Time: 4.1s
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 r7436653 = x;
        double r7436654 = y;
        double r7436655 = r7436653 * r7436654;
        double r7436656 = z;
        double r7436657 = t;
        double r7436658 = r7436656 * r7436657;
        double r7436659 = r7436655 - r7436658;
        return r7436659;
}
↓
double f(double x, double y, double z, double t) {
        double r7436660 = x;
        double r7436661 = y;
        double r7436662 = r7436660 * r7436661;
        double r7436663 = z;
        double r7436664 = t;
        double r7436665 = r7436663 * r7436664;
        double r7436666 = r7436662 - r7436665;
        return r7436666;
}

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