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