Average Error: 0.0 → 0.0
Time: 2.3s
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 r163609 = x;
        double r163610 = y;
        double r163611 = r163609 * r163610;
        double r163612 = z;
        double r163613 = t;
        double r163614 = r163612 * r163613;
        double r163615 = r163611 + r163614;
        return r163615;
}
↓
double f(double x, double y, double z, double t) {
        double r163616 = x;
        double r163617 = y;
        double r163618 = r163616 * r163617;
        double r163619 = z;
        double r163620 = t;
        double r163621 = r163619 * r163620;
        double r163622 = r163618 + r163621;
        return r163622;
}

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