Average Error: 0.0 → 0.0
Time: 11.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 r95451 = x;
        double r95452 = y;
        double r95453 = r95451 * r95452;
        double r95454 = z;
        double r95455 = t;
        double r95456 = r95454 * r95455;
        double r95457 = r95453 + r95456;
        return r95457;
}
↓
double f(double x, double y, double z, double t) {
        double r95458 = x;
        double r95459 = y;
        double r95460 = r95458 * r95459;
        double r95461 = z;
        double r95462 = t;
        double r95463 = r95461 * r95462;
        double r95464 = r95460 + r95463;
        return r95464;
}

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