Average Error: 0.0 → 0.0
Time: 13.8s
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 r149203 = x;
        double r149204 = y;
        double r149205 = r149203 * r149204;
        double r149206 = z;
        double r149207 = t;
        double r149208 = r149206 * r149207;
        double r149209 = r149205 + r149208;
        return r149209;
}
↓
double f(double x, double y, double z, double t) {
        double r149210 = x;
        double r149211 = y;
        double r149212 = r149210 * r149211;
        double r149213 = z;
        double r149214 = t;
        double r149215 = r149213 * r149214;
        double r149216 = r149212 + r149215;
        return r149216;
}

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)))