Average Error: 0.0 → 0.0
Time: 2.6s
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 r132022 = x;
        double r132023 = y;
        double r132024 = r132022 * r132023;
        double r132025 = z;
        double r132026 = t;
        double r132027 = r132025 * r132026;
        double r132028 = r132024 + r132027;
        return r132028;
}
↓
double f(double x, double y, double z, double t) {
        double r132029 = x;
        double r132030 = y;
        double r132031 = r132029 * r132030;
        double r132032 = z;
        double r132033 = t;
        double r132034 = r132032 * r132033;
        double r132035 = r132031 + r132034;
        return r132035;
}

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