Average Error: 0.0 → 0.0
Time: 7.7s
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 r167725 = x;
        double r167726 = y;
        double r167727 = r167725 * r167726;
        double r167728 = z;
        double r167729 = t;
        double r167730 = r167728 * r167729;
        double r167731 = r167727 + r167730;
        return r167731;
}
↓
double f(double x, double y, double z, double t) {
        double r167732 = x;
        double r167733 = y;
        double r167734 = r167732 * r167733;
        double r167735 = z;
        double r167736 = t;
        double r167737 = r167735 * r167736;
        double r167738 = r167734 + r167737;
        return r167738;
}

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