Average Error: 0.0 → 0.0
Time: 13.0s
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 r149092 = x;
        double r149093 = y;
        double r149094 = r149092 * r149093;
        double r149095 = z;
        double r149096 = t;
        double r149097 = r149095 * r149096;
        double r149098 = r149094 + r149097;
        return r149098;
}
↓
double f(double x, double y, double z, double t) {
        double r149099 = x;
        double r149100 = y;
        double r149101 = r149099 * r149100;
        double r149102 = z;
        double r149103 = t;
        double r149104 = r149102 * r149103;
        double r149105 = r149101 + r149104;
        return r149105;
}

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