Average Error: 0.0 → 0.0
Time: 565.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 r116710 = x;
        double r116711 = y;
        double r116712 = r116710 * r116711;
        double r116713 = z;
        double r116714 = t;
        double r116715 = r116713 * r116714;
        double r116716 = r116712 + r116715;
        return r116716;
}
↓
double f(double x, double y, double z, double t) {
        double r116717 = x;
        double r116718 = y;
        double r116719 = r116717 * r116718;
        double r116720 = z;
        double r116721 = t;
        double r116722 = r116720 * r116721;
        double r116723 = r116719 + r116722;
        return r116723;
}

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