Average Error: 0.0 → 0.0
Time: 994.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 r133767 = x;
        double r133768 = y;
        double r133769 = r133767 * r133768;
        double r133770 = z;
        double r133771 = t;
        double r133772 = r133770 * r133771;
        double r133773 = r133769 + r133772;
        return r133773;
}
↓
double f(double x, double y, double z, double t) {
        double r133774 = x;
        double r133775 = y;
        double r133776 = r133774 * r133775;
        double r133777 = z;
        double r133778 = t;
        double r133779 = r133777 * r133778;
        double r133780 = r133776 + r133779;
        return r133780;
}

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 2020083 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))