Average Error: 0.0 → 0.0
Time: 806.0ms
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 r126253 = x;
        double r126254 = y;
        double r126255 = r126253 * r126254;
        double r126256 = z;
        double r126257 = t;
        double r126258 = r126256 * r126257;
        double r126259 = r126255 + r126258;
        return r126259;
}
↓
double f(double x, double y, double z, double t) {
        double r126260 = x;
        double r126261 = y;
        double r126262 = r126260 * r126261;
        double r126263 = z;
        double r126264 = t;
        double r126265 = r126263 * r126264;
        double r126266 = r126262 + r126265;
        return r126266;
}

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