Average Error: 0.0 → 0.0
Time: 7.3s
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 r95591 = x;
        double r95592 = y;
        double r95593 = r95591 * r95592;
        double r95594 = z;
        double r95595 = t;
        double r95596 = r95594 * r95595;
        double r95597 = r95593 - r95596;
        return r95597;
}
↓
double f(double x, double y, double z, double t) {
        double r95598 = x;
        double r95599 = y;
        double r95600 = r95598 * r95599;
        double r95601 = z;
        double r95602 = t;
        double r95603 = r95601 * r95602;
        double r95604 = r95600 - r95603;
        return r95604;
}

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