Average Error: 0.0 → 0.0
Time: 2.5s
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 r161101 = x;
        double r161102 = y;
        double r161103 = r161101 * r161102;
        double r161104 = z;
        double r161105 = t;
        double r161106 = r161104 * r161105;
        double r161107 = r161103 + r161106;
        return r161107;
}
↓
double f(double x, double y, double z, double t) {
        double r161108 = x;
        double r161109 = y;
        double r161110 = r161108 * r161109;
        double r161111 = z;
        double r161112 = t;
        double r161113 = r161111 * r161112;
        double r161114 = r161110 + r161113;
        return r161114;
}

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