Average Error: 0.0 → 0.0
Time: 4.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 r68596 = x;
        double r68597 = y;
        double r68598 = r68596 * r68597;
        double r68599 = z;
        double r68600 = t;
        double r68601 = r68599 * r68600;
        double r68602 = r68598 - r68601;
        return r68602;
}
↓
double f(double x, double y, double z, double t) {
        double r68603 = x;
        double r68604 = y;
        double r68605 = r68603 * r68604;
        double r68606 = z;
        double r68607 = t;
        double r68608 = r68606 * r68607;
        double r68609 = r68605 - r68608;
        return r68609;
}

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