Average Error: 0.0 → 0.0
Time: 3.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 r88199 = x;
        double r88200 = y;
        double r88201 = r88199 * r88200;
        double r88202 = z;
        double r88203 = t;
        double r88204 = r88202 * r88203;
        double r88205 = r88201 + r88204;
        return r88205;
}
↓
double f(double x, double y, double z, double t) {
        double r88206 = x;
        double r88207 = y;
        double r88208 = r88206 * r88207;
        double r88209 = z;
        double r88210 = t;
        double r88211 = r88209 * r88210;
        double r88212 = r88208 + r88211;
        return r88212;
}

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