Average Error: 0.0 → 0.0
Time: 767.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 r186720 = x;
        double r186721 = y;
        double r186722 = r186720 * r186721;
        double r186723 = z;
        double r186724 = t;
        double r186725 = r186723 * r186724;
        double r186726 = r186722 + r186725;
        return r186726;
}
↓
double f(double x, double y, double z, double t) {
        double r186727 = x;
        double r186728 = y;
        double r186729 = r186727 * r186728;
        double r186730 = z;
        double r186731 = t;
        double r186732 = r186730 * r186731;
        double r186733 = r186729 + r186732;
        return r186733;
}

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