Average Error: 0.0 → 0.0
Time: 6.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 r80409 = x;
        double r80410 = y;
        double r80411 = r80409 * r80410;
        double r80412 = z;
        double r80413 = t;
        double r80414 = r80412 * r80413;
        double r80415 = r80411 + r80414;
        return r80415;
}
↓
double f(double x, double y, double z, double t) {
        double r80416 = x;
        double r80417 = y;
        double r80418 = r80416 * r80417;
        double r80419 = z;
        double r80420 = t;
        double r80421 = r80419 * r80420;
        double r80422 = r80418 + r80421;
        return r80422;
}

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