The Command "TzGoGo" in GAP

Question

I am learning GAP and would like to ask one question about a command called "TzGoGo":

If $P$ is a finite presentation of a group $G$, then will the eventual result of the command "TzGoGo(P)" be a presentation $Q$ of $G$ such that $Q$ has the same set of generators as $P$ but there does not exist any other presentation of $G$ with the same set of generators but fewer relations?

One example:

gap> F3:=FreeGroup("a","b","c");
gap> B3:=[Comm(Comm(F3.1,F3.2),F3.1),Comm(Comm(F3.1,F3.2),F3.2),
         Comm(Comm(F3.1,F3.3),F3.1),Comm(Comm(F3.1,F3.3),F3.3),
         Comm(Comm(F3.2,F3.1),F3.2),Comm(Comm(F3.2,F3.1),F3.1),
         Comm(Comm(F3.2,F3.3),F3.2),Comm(Comm(F3.2,F3.3),F3.3),
         Comm(Comm(F3.3,F3.1),F3.3),Comm(Comm(F3.3,F3.1),F3.1),
         Comm(Comm(F3.3,F3.2),F3.3),Comm(Comm(F3.3,F3.2),F3.2),
         Comm(Comm(Comm(F3.1,F3.2),F3.3),F3.1),
         Comm(Comm(Comm(F3.1,F3.2),F3.3),F3.2),
         Comm(Comm(Comm(F3.1,F3.2),F3.3),F3.3),
         Comm(Comm(Comm(F3.1,F3.3),F3.2),F3.1),
         Comm(Comm(Comm(F3.1,F3.3),F3.2),F3.2),
         Comm(Comm(Comm(F3.1,F3.3),F3.2),F3.3),
         Comm(Comm(Comm(F3.2,F3.1),F3.3),F3.1),
         Comm(Comm(Comm(F3.2,F3.1),F3.3),F3.2),
         Comm(Comm(Comm(F3.2,F3.1),F3.3),F3.3),
         Comm(Comm(Comm(F3.2,F3.3),F3.1),F3.1),
         Comm(Comm(Comm(F3.2,F3.3),F3.1),F3.2),
         Comm(Comm(Comm(F3.2,F3.3),F3.1),F3.3),
         Comm(Comm(Comm(F3.3,F3.1),F3.2),F3.1),
         Comm(Comm(Comm(F3.3,F3.1),F3.2),F3.2),
         Comm(Comm(Comm(F3.3,F3.1),F3.2),F3.3),
         Comm(Comm(Comm(F3.3,F3.2),F3.1),F3.1),
         Comm(Comm(Comm(F3.3,F3.2),F3.1),F3.2),
         Comm(Comm(Comm(F3.3,F3.2),F3.1),F3.3)];

gap> K3:=F3/B3;
     pre:=PresentationFpGroup(K3);

gap> TzGoGo(pre);

#I  there are 3 generators and 18 relators of total length 204
#I  there are 3 generators and 15 relators of total length 180

Does it mean, in my example, a presentation of $K3$ with the same set of generators has at least 15 relators?