Average Error: 0.0 → 0.0
Time: 757.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 r101418 = x;
        double r101419 = y;
        double r101420 = r101418 * r101419;
        double r101421 = z;
        double r101422 = t;
        double r101423 = r101421 * r101422;
        double r101424 = r101420 + r101423;
        return r101424;
}
↓
double f(double x, double y, double z, double t) {
        double r101425 = x;
        double r101426 = y;
        double r101427 = r101425 * r101426;
        double r101428 = z;
        double r101429 = t;
        double r101430 = r101428 * r101429;
        double r101431 = r101427 + r101430;
        return r101431;
}

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