0.00/0.09	YES
0.00/0.09	
0.00/0.09	Problem 1: 
0.00/0.09	
0.00/0.09	(VAR v_NonEmpty:S x:S)
0.00/0.09	(RULES
0.00/0.09	f(g(a)) -> g(b)
0.00/0.09	g(a) -> b
0.00/0.09	h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	)
0.00/0.09	
0.00/0.09	Problem 1: 
0.00/0.09	Valid CTRS Processor:
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> The system is a deterministic 3-CTRS.
0.00/0.09	
0.00/0.09	Problem 1: 
0.00/0.09	
0.00/0.09	Dependency Pairs Processor:
0.00/0.09	
0.00/0.09	Conditional Termination Problem 1:
0.00/0.09	-> Pairs:
0.00/0.09	 F(g(a)) -> G(b)
0.00/0.09	 H(x:S) -> G(x:S) | f(x:S) ->* g(x:S)
0.00/0.09	 H(x:S) -> H(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> QPairs:
0.00/0.09	 Empty
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	
0.00/0.09	Conditional Termination Problem 2:
0.00/0.09	-> Pairs:
0.00/0.09	 H(x:S) -> F(x:S)
0.00/0.09	-> QPairs:
0.00/0.09	 F(g(a)) -> G(b)
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	
0.00/0.09	
0.00/0.09	The problem is decomposed in 2 subproblems.
0.00/0.09	
0.00/0.09	Problem 1.1: 
0.00/0.09	
0.00/0.09	SCC Processor:
0.00/0.09	-> Pairs:
0.00/0.09	 F(g(a)) -> G(b)
0.00/0.09	 H(x:S) -> G(x:S) | f(x:S) ->* g(x:S)
0.00/0.09	 H(x:S) -> H(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> QPairs:
0.00/0.09	 Empty
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	->Strongly Connected Components:
0.00/0.09	->->Cycle:
0.00/0.09	->->-> Pairs:
0.00/0.09	 H(x:S) -> H(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> QPairs:
0.00/0.09	 Empty
0.00/0.09	->->-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	
0.00/0.09	Problem 1.1: 
0.00/0.09	
0.00/0.09	Reduction Pair Processor:
0.00/0.09	-> Pairs:
0.00/0.09	 H(x:S) -> H(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	-> Needed rules:
0.00/0.09	 g(a) -> b
0.00/0.09	-> Usable rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	->Mace4 Output:
0.00/0.09	 ============================== Mace4 =================================
0.00/0.09	Mace4 (64) version 2009-11A, November 2009.
0.00/0.09	Process 3344 was started by sandbox on n014.star.cs.uiowa.edu,
0.00/0.09	Fri Mar 29 01:51:57 2019
0.00/0.09	The command was "./mace4 -c -f /tmp/mace41957747793424238335.in".
0.00/0.09	============================== end of head ===========================
0.00/0.09	
0.00/0.09	============================== INPUT =================================
0.00/0.09	
0.00/0.09	% Reading from file /tmp/mace41957747793424238335.in
0.00/0.09	
0.00/0.09	assign(max_seconds,20).
0.00/0.09	
0.00/0.09	formulas(assumptions).
0.00/0.09	arrowStar_s0(x,x) # label(reflexivity).
0.00/0.09	arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility).
0.00/0.09	gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
0.00/0.09	succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
0.00/0.09	gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility).
0.00/0.09	arrow_s0(x1,y) -> arrow_s0(f2(x1),f2(y)) # label(congruence).
0.00/0.09	arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence).
0.00/0.09	arrow_s0(x1,y) -> arrow_s0(f4(x1),f4(y)) # label(congruence).
0.00/0.09	arrow_s0(x1,y) -> arrow_s0(f13(x1,x2),f13(y,x2)) # label(congruence).
0.00/0.09	arrow_s0(x2,y) -> arrow_s0(f13(x1,x2),f13(x1,y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f2(x1),f2(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f3(x1),f3(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f4(x1),f4(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f10(x1),f10(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f11(x1),f11(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f12(x1),f12(y)) # label(congruence).
0.00/0.09	arrowN_s0(x1,y) -> arrowN_s0(f13(x1,x2),f13(y,x2)) # label(congruence).
0.00/0.09	arrowN_s0(x2,y) -> arrowN_s0(f13(x1,x2),f13(x1,y)) # label(congruence).
0.00/0.09	arrow_s0(f2(f3(f5)),f3(f6)) # label(replacement).
0.00/0.09	arrow_s0(f3(f5),f6) # label(replacement).
0.00/0.09	arrow_s0(f13(x2,x3),x2) # label(replacement).
0.00/0.09	arrow_s0(f13(x2,x3),x3) # label(replacement).
0.00/0.09	arrowN_s0(f3(f5),f6) # label(replacement).
0.00/0.09	arrowN_s0(f13(x2,x3),x2) # label(replacement).
0.00/0.09	arrowN_s0(f13(x2,x3),x3) # label(replacement).
0.00/0.09	arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
0.00/0.09	arrowStar_s0(f2(x1),f3(x1)) -> sqsupset_s0(f12(x1),f12(f3(x1))) # label(replacement).
0.00/0.09	sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion).
0.00/0.09	sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility).
0.00/0.09	end_of_list.
0.00/0.09	
0.00/0.09	formulas(goals).
0.00/0.09	(exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness).
0.00/0.09	end_of_list.
0.00/0.09	
0.00/0.09	============================== end of input ==========================
0.00/0.09	
0.00/0.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.00/0.09	
0.00/0.09	% Formulas that are not ordinary clauses:
0.00/0.09	1 arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.09	2 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.09	3 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.09	4 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.09	5 arrow_s0(x1,y) -> arrow_s0(f2(x1),f2(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	6 arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	7 arrow_s0(x1,y) -> arrow_s0(f4(x1),f4(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	8 arrow_s0(x1,y) -> arrow_s0(f13(x1,x2),f13(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	9 arrow_s0(x2,y) -> arrow_s0(f13(x1,x2),f13(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	10 arrowN_s0(x1,y) -> arrowN_s0(f2(x1),f2(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	11 arrowN_s0(x1,y) -> arrowN_s0(f3(x1),f3(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	12 arrowN_s0(x1,y) -> arrowN_s0(f4(x1),f4(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	13 arrowN_s0(x1,y) -> arrowN_s0(f10(x1),f10(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	14 arrowN_s0(x1,y) -> arrowN_s0(f11(x1),f11(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	15 arrowN_s0(x1,y) -> arrowN_s0(f12(x1),f12(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	16 arrowN_s0(x1,y) -> arrowN_s0(f13(x1,x2),f13(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	17 arrowN_s0(x2,y) -> arrowN_s0(f13(x1,x2),f13(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.09	18 arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
0.00/0.09	19 arrowStar_s0(f2(x1),f3(x1)) -> sqsupset_s0(f12(x1),f12(f3(x1))) # label(replacement) # label(non_clause).  [assumption].
0.00/0.09	20 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
0.00/0.09	21 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.09	22 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness) # label(non_clause) # label(goal).  [goal].
0.00/0.09	
0.00/0.09	============================== end of process non-clausal formulas ===
0.00/0.09	
0.00/0.09	============================== CLAUSES FOR SEARCH ====================
0.00/0.09	
0.00/0.09	formulas(mace4_clauses).
0.00/0.09	arrowStar_s0(x,x) # label(reflexivity).
0.00/0.09	-arrow_s0(x,y) | -arrowStar_s0(y,z) | arrowStar_s0(x,z) # label(compatibility).
0.00/0.09	-gtrsim_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
0.00/0.09	-succeq_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
0.00/0.09	-gtrsim_s0(x,y) | -succeq_s0(y,z) | gtrsim_s0(x,z) # label(compatibility).
0.00/0.09	-arrow_s0(x,y) | arrow_s0(f2(x),f2(y)) # label(congruence).
0.00/0.09	-arrow_s0(x,y) | arrow_s0(f3(x),f3(y)) # label(congruence).
0.00/0.09	-arrow_s0(x,y) | arrow_s0(f4(x),f4(y)) # label(congruence).
0.00/0.09	-arrow_s0(x,y) | arrow_s0(f13(x,z),f13(y,z)) # label(congruence).
0.00/0.09	-arrow_s0(x,y) | arrow_s0(f13(z,x),f13(z,y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f2(x),f2(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f3(x),f3(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f4(x),f4(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f10(x),f10(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f11(x),f11(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f12(x),f12(y)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f13(x,z),f13(y,z)) # label(congruence).
0.00/0.09	-arrowN_s0(x,y) | arrowN_s0(f13(z,x),f13(z,y)) # label(congruence).
0.00/0.09	arrow_s0(f2(f3(f5)),f3(f6)) # label(replacement).
0.00/0.09	arrow_s0(f3(f5),f6) # label(replacement).
0.00/0.09	arrow_s0(f13(x,y),x) # label(replacement).
0.00/0.09	arrow_s0(f13(x,y),y) # label(replacement).
0.00/0.09	arrowN_s0(f3(f5),f6) # label(replacement).
0.00/0.09	arrowN_s0(f13(x,y),x) # label(replacement).
0.00/0.09	arrowN_s0(f13(x,y),y) # label(replacement).
0.00/0.09	-arrowN_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
0.00/0.09	-arrowStar_s0(f2(x),f3(x)) | sqsupset_s0(f12(x),f12(f3(x))) # label(replacement).
0.00/0.09	-sqsupset_s0(x,y) | sqsupsetStar_s0(x,y) # label(inclusion).
0.00/0.09	-sqsupset_s0(x,y) | -sqsupsetStar_s0(y,z) | sqsupsetStar_s0(x,z) # label(compatibility).
0.00/0.09	-sqsupsetStar_s0(x,x) # label(wellfoundedness).
0.00/0.09	end_of_list.
0.00/0.09	
0.00/0.09	============================== end of clauses for search =============
0.00/0.09	
0.00/0.09	% There are no natural numbers in the input.
0.00/0.09	
0.00/0.09	============================== DOMAIN SIZE 2 =========================
0.00/0.09	
0.00/0.09	============================== STATISTICS ============================
0.00/0.09	
0.00/0.09	For domain size 2.
0.00/0.09	
0.00/0.09	Current CPU time: 0.00 seconds (total CPU time: 0.02 seconds).
0.00/0.09	Ground clauses: seen=141, kept=137.
0.00/0.09	Selections=2872, assignments=5743, propagations=15462, current_models=0.
0.00/0.09	Rewrite_terms=93645, rewrite_bools=95046, indexes=6413.
0.00/0.09	Rules_from_neg_clauses=7272, cross_offs=7272.
0.00/0.09	
0.00/0.09	============================== end of statistics =====================
0.00/0.09	
0.00/0.09	============================== DOMAIN SIZE 3 =========================
0.00/0.09	
0.00/0.09	============================== MODEL =================================
0.00/0.09	
0.00/0.09	interpretation( 3, [number=1, seconds=0], [
0.00/0.09	
0.00/0.09	        function(f5, [ 0 ]),
0.00/0.09	
0.00/0.09	        function(f6, [ 0 ]),
0.00/0.09	
0.00/0.09	        function(f10(_), [ 0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        function(f11(_), [ 0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        function(f12(_), [ 0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        function(f2(_), [ 0, 1, 1 ]),
0.00/0.09	
0.00/0.09	        function(f3(_), [ 1, 2, 2 ]),
0.00/0.09	
0.00/0.09	        function(f4(_), [ 0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        function(f13(_,_), [
0.00/0.09				   0, 1, 2,
0.00/0.09				   1, 1, 2,
0.00/0.09				   2, 2, 2 ]),
0.00/0.09	
0.00/0.09	        relation(arrowN_s0(_,_), [
0.00/0.09				   1, 0, 0,
0.00/0.09				   1, 1, 0,
0.00/0.09				   1, 1, 1 ]),
0.00/0.09	
0.00/0.09	        relation(arrowStar_s0(_,_), [
0.00/0.09				   1, 0, 0,
0.00/0.09				   1, 1, 0,
0.00/0.09				   1, 1, 1 ]),
0.00/0.09	
0.00/0.09	        relation(arrow_s0(_,_), [
0.00/0.09				   1, 0, 0,
0.00/0.09				   1, 1, 0,
0.00/0.09				   1, 1, 1 ]),
0.00/0.09	
0.00/0.09	        relation(gtrsim_s0(_,_), [
0.00/0.09				   1, 0, 0,
0.00/0.09				   1, 1, 0,
0.00/0.09				   1, 1, 1 ]),
0.00/0.09	
0.00/0.09	        relation(sqsupsetStar_s0(_,_), [
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        relation(sqsupset_s0(_,_), [
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0 ]),
0.00/0.09	
0.00/0.09	        relation(succeq_s0(_,_), [
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0,
0.00/0.09				   0, 0, 0 ])
0.00/0.09	]).
0.00/0.09	
0.00/0.09	============================== end of model ==========================
0.00/0.09	
0.00/0.09	============================== STATISTICS ============================
0.00/0.09	
0.00/0.09	For domain size 3.
0.00/0.09	
0.00/0.09	Current CPU time: 0.00 seconds (total CPU time: 0.02 seconds).
0.00/0.09	Ground clauses: seen=390, kept=381.
0.00/0.09	Selections=46, assignments=66, propagations=84, current_models=1.
0.00/0.09	Rewrite_terms=658, rewrite_bools=799, indexes=82.
0.00/0.09	Rules_from_neg_clauses=6, cross_offs=24.
0.00/0.09	
0.00/0.09	============================== end of statistics =====================
0.00/0.09	
0.00/0.09	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.00/0.09	
0.00/0.09	Exiting with 1 model.
0.00/0.09	
0.00/0.09	Process 3344 exit (max_models) Fri Mar 29 01:51:57 2019
0.00/0.09	The process finished Fri Mar 29 01:51:57 2019
0.00/0.09	
0.00/0.09	
0.00/0.09	Mace4 cooked interpretation:
0.00/0.09	
0.00/0.09	% number = 1
0.00/0.09	% seconds = 0
0.00/0.09	
0.00/0.09	% Interpretation of size 3
0.00/0.09	
0.00/0.09	f5 = 0.
0.00/0.09	
0.00/0.09	f6 = 0.
0.00/0.09	
0.00/0.09	f10(0) = 0.
0.00/0.09	f10(1) = 0.
0.00/0.09	f10(2) = 0.
0.00/0.09	
0.00/0.09	f11(0) = 0.
0.00/0.09	f11(1) = 0.
0.00/0.09	f11(2) = 0.
0.00/0.09	
0.00/0.09	f12(0) = 0.
0.00/0.09	f12(1) = 0.
0.00/0.09	f12(2) = 0.
0.00/0.09	
0.00/0.09	f2(0) = 0.
0.00/0.09	f2(1) = 1.
0.00/0.09	f2(2) = 1.
0.00/0.09	
0.00/0.09	f3(0) = 1.
0.00/0.09	f3(1) = 2.
0.00/0.09	f3(2) = 2.
0.00/0.09	
0.00/0.09	f4(0) = 0.
0.00/0.09	f4(1) = 0.
0.00/0.09	f4(2) = 0.
0.00/0.09	
0.00/0.09	f13(0,0) = 0.
0.00/0.09	f13(0,1) = 1.
0.00/0.09	f13(0,2) = 2.
0.00/0.09	f13(1,0) = 1.
0.00/0.09	f13(1,1) = 1.
0.00/0.09	f13(1,2) = 2.
0.00/0.09	f13(2,0) = 2.
0.00/0.09	f13(2,1) = 2.
0.00/0.09	f13(2,2) = 2.
0.00/0.09	
0.00/0.09	  arrowN_s0(0,0).
0.00/0.09	- arrowN_s0(0,1).
0.00/0.09	- arrowN_s0(0,2).
0.00/0.09	  arrowN_s0(1,0).
0.00/0.09	  arrowN_s0(1,1).
0.00/0.09	- arrowN_s0(1,2).
0.00/0.09	  arrowN_s0(2,0).
0.00/0.09	  arrowN_s0(2,1).
0.00/0.09	  arrowN_s0(2,2).
0.00/0.09	
0.00/0.09	  arrowStar_s0(0,0).
0.00/0.09	- arrowStar_s0(0,1).
0.00/0.09	- arrowStar_s0(0,2).
0.00/0.09	  arrowStar_s0(1,0).
0.00/0.09	  arrowStar_s0(1,1).
0.00/0.09	- arrowStar_s0(1,2).
0.00/0.09	  arrowStar_s0(2,0).
0.00/0.09	  arrowStar_s0(2,1).
0.00/0.09	  arrowStar_s0(2,2).
0.00/0.09	
0.00/0.09	  arrow_s0(0,0).
0.00/0.09	- arrow_s0(0,1).
0.00/0.09	- arrow_s0(0,2).
0.00/0.09	  arrow_s0(1,0).
0.00/0.09	  arrow_s0(1,1).
0.00/0.09	- arrow_s0(1,2).
0.00/0.09	  arrow_s0(2,0).
0.00/0.09	  arrow_s0(2,1).
0.00/0.09	  arrow_s0(2,2).
0.00/0.09	
0.00/0.09	  gtrsim_s0(0,0).
0.00/0.09	- gtrsim_s0(0,1).
0.00/0.09	- gtrsim_s0(0,2).
0.00/0.09	  gtrsim_s0(1,0).
0.00/0.09	  gtrsim_s0(1,1).
0.00/0.09	- gtrsim_s0(1,2).
0.00/0.09	  gtrsim_s0(2,0).
0.00/0.09	  gtrsim_s0(2,1).
0.00/0.09	  gtrsim_s0(2,2).
0.00/0.09	
0.00/0.09	- sqsupsetStar_s0(0,0).
0.00/0.09	- sqsupsetStar_s0(0,1).
0.00/0.09	- sqsupsetStar_s0(0,2).
0.00/0.09	- sqsupsetStar_s0(1,0).
0.00/0.09	- sqsupsetStar_s0(1,1).
0.00/0.09	- sqsupsetStar_s0(1,2).
0.00/0.09	- sqsupsetStar_s0(2,0).
0.00/0.09	- sqsupsetStar_s0(2,1).
0.00/0.09	- sqsupsetStar_s0(2,2).
0.00/0.09	
0.00/0.09	- sqsupset_s0(0,0).
0.00/0.09	- sqsupset_s0(0,1).
0.00/0.09	- sqsupset_s0(0,2).
0.00/0.09	- sqsupset_s0(1,0).
0.00/0.09	- sqsupset_s0(1,1).
0.00/0.09	- sqsupset_s0(1,2).
0.00/0.09	- sqsupset_s0(2,0).
0.00/0.09	- sqsupset_s0(2,1).
0.00/0.09	- sqsupset_s0(2,2).
0.00/0.09	
0.00/0.09	- succeq_s0(0,0).
0.00/0.09	- succeq_s0(0,1).
0.00/0.09	- succeq_s0(0,2).
0.00/0.09	- succeq_s0(1,0).
0.00/0.09	- succeq_s0(1,1).
0.00/0.09	- succeq_s0(1,2).
0.00/0.09	- succeq_s0(2,0).
0.00/0.09	- succeq_s0(2,1).
0.00/0.09	- succeq_s0(2,2).
0.00/0.09	
0.00/0.09	
0.00/0.09	Problem 1.1: 
0.00/0.09	
0.00/0.09	SCC Processor:
0.00/0.09	-> Pairs:
0.00/0.09	 Empty
0.00/0.09	-> QPairs:
0.00/0.09	 Empty
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	->Strongly Connected Components:
0.00/0.09	 There is no strongly connected component
0.00/0.09	
0.00/0.09	The problem is finite.
0.00/0.09	
0.00/0.09	Problem 1.2: 
0.00/0.09	
0.00/0.09	SCC Processor:
0.00/0.09	-> Pairs:
0.00/0.09	 H(x:S) -> F(x:S)
0.00/0.09	-> QPairs:
0.00/0.09	 F(g(a)) -> G(b)
0.00/0.09	-> Rules:
0.00/0.09	 f(g(a)) -> g(b)
0.00/0.09	 g(a) -> b
0.00/0.09	 h(x:S) -> h(g(x:S)) | f(x:S) ->* g(x:S)
0.00/0.09	->Strongly Connected Components:
0.00/0.09	 There is no strongly connected component
0.00/0.09	
0.00/0.09	The problem is finite.
0.00/0.09	EOF