Average Error: 0.0 → 0.0
Time: 1.3s
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 r115117 = x;
        double r115118 = y;
        double r115119 = r115117 * r115118;
        double r115120 = z;
        double r115121 = t;
        double r115122 = r115120 * r115121;
        double r115123 = r115119 + r115122;
        return r115123;
}
↓
double f(double x, double y, double z, double t) {
        double r115124 = x;
        double r115125 = y;
        double r115126 = r115124 * r115125;
        double r115127 = z;
        double r115128 = t;
        double r115129 = r115127 * r115128;
        double r115130 = r115126 + r115129;
        return r115130;
}

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