Average Error: 0.0 → 0.0
Time: 2.0s
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 r151049 = x;
        double r151050 = y;
        double r151051 = r151049 * r151050;
        double r151052 = z;
        double r151053 = t;
        double r151054 = r151052 * r151053;
        double r151055 = r151051 + r151054;
        return r151055;
}
↓
double f(double x, double y, double z, double t) {
        double r151056 = x;
        double r151057 = y;
        double r151058 = r151056 * r151057;
        double r151059 = z;
        double r151060 = t;
        double r151061 = r151059 * r151060;
        double r151062 = r151058 + r151061;
        return r151062;
}

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