Average Error: 0.0 → 0.0
Time: 2.2s
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 r131134 = x;
        double r131135 = y;
        double r131136 = r131134 * r131135;
        double r131137 = z;
        double r131138 = t;
        double r131139 = r131137 * r131138;
        double r131140 = r131136 + r131139;
        return r131140;
}
↓
double f(double x, double y, double z, double t) {
        double r131141 = x;
        double r131142 = y;
        double r131143 = r131141 * r131142;
        double r131144 = z;
        double r131145 = t;
        double r131146 = r131144 * r131145;
        double r131147 = r131143 + r131146;
        return r131147;
}

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