Average Error: 0.0 → 0.0
Time: 771.0ms
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 r94798 = x;
        double r94799 = y;
        double r94800 = r94798 * r94799;
        double r94801 = z;
        double r94802 = t;
        double r94803 = r94801 * r94802;
        double r94804 = r94800 - r94803;
        return r94804;
}
↓
double f(double x, double y, double z, double t) {
        double r94805 = x;
        double r94806 = y;
        double r94807 = r94805 * r94806;
        double r94808 = z;
        double r94809 = t;
        double r94810 = r94808 * r94809;
        double r94811 = r94807 - r94810;
        return r94811;
}

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