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 r92707 = x;
        double r92708 = y;
        double r92709 = r92707 * r92708;
        double r92710 = z;
        double r92711 = t;
        double r92712 = r92710 * r92711;
        double r92713 = r92709 + r92712;
        return r92713;
}
↓
double f(double x, double y, double z, double t) {
        double r92714 = x;
        double r92715 = y;
        double r92716 = r92714 * r92715;
        double r92717 = z;
        double r92718 = t;
        double r92719 = r92717 * r92718;
        double r92720 = r92716 + r92719;
        return r92720;
}

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