Average Error: 0.0 → 0.0
Time: 6.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 r127310 = x;
        double r127311 = y;
        double r127312 = r127310 * r127311;
        double r127313 = z;
        double r127314 = t;
        double r127315 = r127313 * r127314;
        double r127316 = r127312 + r127315;
        return r127316;
}
↓
double f(double x, double y, double z, double t) {
        double r127317 = x;
        double r127318 = y;
        double r127319 = r127317 * r127318;
        double r127320 = z;
        double r127321 = t;
        double r127322 = r127320 * r127321;
        double r127323 = r127319 + r127322;
        return r127323;
}

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