Average Error: 0.0 → 0.0
Time: 776.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 r145395 = x;
        double r145396 = y;
        double r145397 = r145395 * r145396;
        double r145398 = z;
        double r145399 = t;
        double r145400 = r145398 * r145399;
        double r145401 = r145397 + r145400;
        return r145401;
}
↓
double f(double x, double y, double z, double t) {
        double r145402 = x;
        double r145403 = y;
        double r145404 = r145402 * r145403;
        double r145405 = z;
        double r145406 = t;
        double r145407 = r145405 * r145406;
        double r145408 = r145404 + r145407;
        return r145408;
}

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