0.00/0.21	YES
0.00/0.21	
0.00/0.21	Problem 1: 
0.00/0.21	
0.00/0.21	(VAR v_NonEmpty:S x:S)
0.00/0.21	(RULES
0.00/0.21	A -> h(f(a),f(b))
0.00/0.21	a -> d
0.00/0.21	a -> e
0.00/0.21	b -> d
0.00/0.21	b -> e
0.00/0.21	f(x:S) -> x:S | x:S ->* d
0.00/0.21	g(d,e) -> A
0.00/0.21	h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	)
0.00/0.21	
0.00/0.21	Problem 1: 
0.00/0.21	Valid CTRS Processor:
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	-> The system is a deterministic 3-CTRS.
0.00/0.21	
0.00/0.21	Problem 1: 
0.00/0.21	
0.00/0.21	Dependency Pairs Processor:
0.00/0.21	
0.00/0.21	Conditional Termination Problem 1:
0.00/0.21	-> Pairs:
0.00/0.21	 A# -> a#
0.00/0.21	 A# -> B
0.00/0.21	 A# -> F(a)
0.00/0.21	 A# -> F(b)
0.00/0.21	 A# -> H(f(a),f(b))
0.00/0.21	 G(d,e) -> A#
0.00/0.21	 H(x:S,x:S) -> G(x:S,x:S)
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	
0.00/0.21	Conditional Termination Problem 2:
0.00/0.21	-> Pairs:
0.00/0.21	 Empty
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	
0.00/0.21	
0.00/0.21	The problem is decomposed in 2 subproblems.
0.00/0.21	
0.00/0.21	Problem 1.1: 
0.00/0.21	
0.00/0.21	SCC Processor:
0.00/0.21	-> Pairs:
0.00/0.21	 A# -> a#
0.00/0.21	 A# -> B
0.00/0.21	 A# -> F(a)
0.00/0.21	 A# -> F(b)
0.00/0.21	 A# -> H(f(a),f(b))
0.00/0.21	 G(d,e) -> A#
0.00/0.21	 H(x:S,x:S) -> G(x:S,x:S)
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	->Strongly Connected Components:
0.00/0.21	->->Cycle:
0.00/0.21	->->-> Pairs:
0.00/0.21	 A# -> H(f(a),f(b))
0.00/0.21	 G(d,e) -> A#
0.00/0.21	 H(x:S,x:S) -> G(x:S,x:S)
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	->->-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	
0.00/0.21	Problem 1.1: 
0.00/0.21	
0.00/0.21	Reduction Pair Processor:
0.00/0.21	-> Pairs:
0.00/0.21	 A# -> H(f(a),f(b))
0.00/0.21	 G(d,e) -> A#
0.00/0.21	 H(x:S,x:S) -> G(x:S,x:S)
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	-> Needed rules:
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	-> Usable rules:
0.00/0.21	 Empty
0.00/0.21	->Mace4 Output:
0.00/0.21	 ============================== Mace4 =================================
0.00/0.21	Mace4 (64) version 2009-11A, November 2009.
0.00/0.21	Process 35607 was started by sandbox on n101.star.cs.uiowa.edu,
0.00/0.21	Fri Mar 29 01:41:27 2019
0.00/0.21	The command was "./mace4 -c -f /tmp/mace47833686901102520059.in".
0.00/0.21	============================== end of head ===========================
0.00/0.21	
0.00/0.21	============================== INPUT =================================
0.00/0.21	
0.00/0.21	% Reading from file /tmp/mace47833686901102520059.in
0.00/0.21	
0.00/0.21	assign(max_seconds,20).
0.00/0.21	
0.00/0.21	formulas(assumptions).
0.00/0.21	arrowStar_s0(x,x) # label(reflexivity).
0.00/0.21	arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility).
0.00/0.21	gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
0.00/0.21	succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
0.00/0.21	gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility).
0.00/0.21	arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(y)) # label(congruence).
0.00/0.21	arrow_s0(x1,y) -> arrow_s0(f6(x1,x2),f6(y,x2)) # label(congruence).
0.00/0.21	arrow_s0(x2,y) -> arrow_s0(f6(x1,x2),f6(x1,y)) # label(congruence).
0.00/0.21	arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
0.00/0.21	arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
0.00/0.21	arrow_s0(x1,y) -> arrow_s0(f19(x1,x2),f19(y,x2)) # label(congruence).
0.00/0.21	arrow_s0(x2,y) -> arrow_s0(f19(x1,x2),f19(x1,y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f5(x1),f5(y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f6(x1,x2),f6(y,x2)) # label(congruence).
0.00/0.21	arrowN_s0(x2,y) -> arrowN_s0(f6(x1,x2),f6(x1,y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
0.00/0.21	arrowN_s0(x2,y) -> arrowN_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f16(x1),f16(y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f17(x1,x2),f17(y,x2)) # label(congruence).
0.00/0.21	arrowN_s0(x2,y) -> arrowN_s0(f17(x1,x2),f17(x1,y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f18(x1,x2),f18(y,x2)) # label(congruence).
0.00/0.21	arrowN_s0(x2,y) -> arrowN_s0(f18(x1,x2),f18(x1,y)) # label(congruence).
0.00/0.21	arrowN_s0(x1,y) -> arrowN_s0(f19(x1,x2),f19(y,x2)) # label(congruence).
0.00/0.21	arrowN_s0(x2,y) -> arrowN_s0(f19(x1,x2),f19(x1,y)) # label(congruence).
0.00/0.21	arrow_s0(f19(x2,x3),x2) # label(replacement).
0.00/0.21	arrow_s0(f19(x2,x3),x3) # label(replacement).
0.00/0.21	arrowN_s0(f3,f8) # label(replacement).
0.00/0.21	arrowN_s0(f3,f9) # label(replacement).
0.00/0.21	arrowN_s0(f4,f8) # label(replacement).
0.00/0.21	arrowN_s0(f4,f9) # label(replacement).
0.00/0.21	arrowStar_s0(x1,f8) -> arrowN_s0(f5(x1),x1) # label(replacement).
0.00/0.21	arrowN_s0(f19(x2,x3),x2) # label(replacement).
0.00/0.21	arrowN_s0(f19(x2,x3),x3) # label(replacement).
0.00/0.21	arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
0.00/0.21	sqsupset_s0(f13,f18(f5(f3),f5(f4))) # label(replacement).
0.00/0.21	succeq_s0(f17(f8,f9),f13) # label(replacement).
0.00/0.21	succeq_s0(f18(x1,x1),f17(x1,x1)) # label(replacement).
0.00/0.21	sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion).
0.00/0.21	sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility).
0.00/0.21	end_of_list.
0.00/0.21	
0.00/0.21	formulas(goals).
0.00/0.21	(exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness).
0.00/0.21	end_of_list.
0.00/0.21	
0.00/0.21	============================== end of input ==========================
0.00/0.21	
0.00/0.21	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.00/0.21	
0.00/0.21	% Formulas that are not ordinary clauses:
0.00/0.21	1 arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.21	2 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.21	3 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.21	4 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.21	5 arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	6 arrow_s0(x1,y) -> arrow_s0(f6(x1,x2),f6(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	7 arrow_s0(x2,y) -> arrow_s0(f6(x1,x2),f6(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	8 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	9 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	10 arrow_s0(x1,y) -> arrow_s0(f19(x1,x2),f19(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	11 arrow_s0(x2,y) -> arrow_s0(f19(x1,x2),f19(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	12 arrowN_s0(x1,y) -> arrowN_s0(f5(x1),f5(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	13 arrowN_s0(x1,y) -> arrowN_s0(f6(x1,x2),f6(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	14 arrowN_s0(x2,y) -> arrowN_s0(f6(x1,x2),f6(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	15 arrowN_s0(x1,y) -> arrowN_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	16 arrowN_s0(x2,y) -> arrowN_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	17 arrowN_s0(x1,y) -> arrowN_s0(f16(x1),f16(y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	18 arrowN_s0(x1,y) -> arrowN_s0(f17(x1,x2),f17(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	19 arrowN_s0(x2,y) -> arrowN_s0(f17(x1,x2),f17(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	20 arrowN_s0(x1,y) -> arrowN_s0(f18(x1,x2),f18(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	21 arrowN_s0(x2,y) -> arrowN_s0(f18(x1,x2),f18(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	22 arrowN_s0(x1,y) -> arrowN_s0(f19(x1,x2),f19(y,x2)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	23 arrowN_s0(x2,y) -> arrowN_s0(f19(x1,x2),f19(x1,y)) # label(congruence) # label(non_clause).  [assumption].
0.00/0.21	24 arrowStar_s0(x1,f8) -> arrowN_s0(f5(x1),x1) # label(replacement) # label(non_clause).  [assumption].
0.00/0.21	25 arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
0.00/0.21	26 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
0.00/0.21	27 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
0.00/0.21	28 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness) # label(non_clause) # label(goal).  [goal].
0.00/0.21	
0.00/0.21	============================== end of process non-clausal formulas ===
0.00/0.21	
0.00/0.21	============================== CLAUSES FOR SEARCH ====================
0.00/0.21	
0.00/0.21	formulas(mace4_clauses).
0.00/0.21	arrowStar_s0(x,x) # label(reflexivity).
0.00/0.21	-arrow_s0(x,y) | -arrowStar_s0(y,z) | arrowStar_s0(x,z) # label(compatibility).
0.00/0.21	-gtrsim_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
0.00/0.21	-succeq_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
0.00/0.21	-gtrsim_s0(x,y) | -succeq_s0(y,z) | gtrsim_s0(x,z) # label(compatibility).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f5(x),f5(y)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f6(x,z),f6(y,z)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f6(z,x),f6(z,y)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f7(x,z),f7(y,z)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f7(z,x),f7(z,y)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f19(x,z),f19(y,z)) # label(congruence).
0.00/0.21	-arrow_s0(x,y) | arrow_s0(f19(z,x),f19(z,y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f5(x),f5(y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f6(x,z),f6(y,z)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f6(z,x),f6(z,y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f7(x,z),f7(y,z)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f7(z,x),f7(z,y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f16(x),f16(y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f17(x,z),f17(y,z)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f17(z,x),f17(z,y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f18(x,z),f18(y,z)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f18(z,x),f18(z,y)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f19(x,z),f19(y,z)) # label(congruence).
0.00/0.21	-arrowN_s0(x,y) | arrowN_s0(f19(z,x),f19(z,y)) # label(congruence).
0.00/0.21	arrow_s0(f19(x,y),x) # label(replacement).
0.00/0.21	arrow_s0(f19(x,y),y) # label(replacement).
0.00/0.21	arrowN_s0(f3,f8) # label(replacement).
0.00/0.21	arrowN_s0(f3,f9) # label(replacement).
0.00/0.21	arrowN_s0(f4,f8) # label(replacement).
0.00/0.21	arrowN_s0(f4,f9) # label(replacement).
0.00/0.21	-arrowStar_s0(x,f8) | arrowN_s0(f5(x),x) # label(replacement).
0.00/0.21	arrowN_s0(f19(x,y),x) # label(replacement).
0.00/0.21	arrowN_s0(f19(x,y),y) # label(replacement).
0.00/0.21	-arrowN_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
0.00/0.21	sqsupset_s0(f13,f18(f5(f3),f5(f4))) # label(replacement).
0.00/0.21	succeq_s0(f17(f8,f9),f13) # label(replacement).
0.00/0.21	succeq_s0(f18(x,x),f17(x,x)) # label(replacement).
0.00/0.21	-sqsupset_s0(x,y) | sqsupsetStar_s0(x,y) # label(inclusion).
0.00/0.21	-sqsupset_s0(x,y) | -sqsupsetStar_s0(y,z) | sqsupsetStar_s0(x,z) # label(compatibility).
0.00/0.21	-sqsupsetStar_s0(x,x) # label(wellfoundedness).
0.00/0.21	end_of_list.
0.00/0.21	
0.00/0.21	============================== end of clauses for search =============
0.00/0.21	
0.00/0.21	% There are no natural numbers in the input.
0.00/0.21	
0.00/0.21	============================== DOMAIN SIZE 2 =========================
0.00/0.21	
0.00/0.21	============================== STATISTICS ============================
0.00/0.21	
0.00/0.21	For domain size 2.
0.00/0.21	
0.00/0.21	Current CPU time: 0.00 seconds (total CPU time: 0.08 seconds).
0.00/0.21	Ground clauses: seen=218, kept=214.
0.00/0.21	Selections=15816, assignments=31631, propagations=31961, current_models=0.
0.00/0.21	Rewrite_terms=269036, rewrite_bools=290739, indexes=31506.
0.00/0.21	Rules_from_neg_clauses=18996, cross_offs=18996.
0.00/0.21	
0.00/0.21	============================== end of statistics =====================
0.00/0.21	
0.00/0.21	============================== DOMAIN SIZE 3 =========================
0.00/0.21	
0.00/0.21	============================== MODEL =================================
0.00/0.21	
0.00/0.21	interpretation( 3, [number=1, seconds=0], [
0.00/0.21	
0.00/0.21	        function(f13, [ 0 ]),
0.00/0.21	
0.00/0.21	        function(f3, [ 0 ]),
0.00/0.21	
0.00/0.21	        function(f4, [ 0 ]),
0.00/0.21	
0.00/0.21	        function(f8, [ 1 ]),
0.00/0.21	
0.00/0.21	        function(f9, [ 0 ]),
0.00/0.21	
0.00/0.21	        function(f16(_), [ 0, 0, 0 ]),
0.00/0.21	
0.00/0.21	        function(f5(_), [ 1, 1, 2 ]),
0.00/0.21	
0.00/0.21	        function(f17(_,_), [
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   0, 0, 0 ]),
0.00/0.21	
0.00/0.21	        function(f18(_,_), [
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   0, 0, 0 ]),
0.00/0.21	
0.00/0.21	        function(f19(_,_), [
0.00/0.21				   2, 2, 2,
0.00/0.21				   2, 1, 2,
0.00/0.21				   2, 2, 2 ]),
0.00/0.21	
0.00/0.21	        function(f6(_,_), [
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 0, 0 ]),
0.00/0.21	
0.00/0.21	        function(f7(_,_), [
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 0, 0 ]),
0.00/0.21	
0.00/0.21	        relation(arrowN_s0(_,_), [
0.00/0.21				   1, 1, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   1, 1, 1 ]),
0.00/0.21	
0.00/0.21	        relation(arrowStar_s0(_,_), [
0.00/0.21				   1, 0, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   1, 1, 1 ]),
0.00/0.21	
0.00/0.21	        relation(arrow_s0(_,_), [
0.00/0.21				   1, 0, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   1, 1, 1 ]),
0.00/0.21	
0.00/0.21	        relation(gtrsim_s0(_,_), [
0.00/0.21				   1, 1, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   1, 1, 1 ]),
0.00/0.21	
0.00/0.21	        relation(sqsupsetStar_s0(_,_), [
0.00/0.21				   0, 1, 0,
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 1, 0 ]),
0.00/0.21	
0.00/0.21	        relation(sqsupset_s0(_,_), [
0.00/0.21				   0, 1, 0,
0.00/0.21				   0, 0, 0,
0.00/0.21				   0, 1, 0 ]),
0.00/0.21	
0.00/0.21	        relation(succeq_s0(_,_), [
0.00/0.21				   1, 0, 0,
0.00/0.21				   0, 1, 0,
0.00/0.21				   0, 0, 0 ])
0.00/0.21	]).
0.00/0.21	
0.00/0.21	============================== end of model ==========================
0.00/0.21	
0.00/0.21	============================== STATISTICS ============================
0.00/0.21	
0.00/0.21	For domain size 3.
0.00/0.21	
0.00/0.21	Current CPU time: 0.00 seconds (total CPU time: 0.08 seconds).
0.00/0.21	Ground clauses: seen=666, kept=657.
0.00/0.21	Selections=69, assignments=113, propagations=599, current_models=1.
0.00/0.21	Rewrite_terms=2496, rewrite_bools=5851, indexes=191.
0.00/0.21	Rules_from_neg_clauses=152, cross_offs=404.
0.00/0.21	
0.00/0.21	============================== end of statistics =====================
0.00/0.21	
0.00/0.21	User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
0.00/0.21	
0.00/0.21	Exiting with 1 model.
0.00/0.21	
0.00/0.21	Process 35607 exit (max_models) Fri Mar 29 01:41:27 2019
0.00/0.21	The process finished Fri Mar 29 01:41:27 2019
0.00/0.21	
0.00/0.21	
0.00/0.21	Mace4 cooked interpretation:
0.00/0.21	
0.00/0.21	% number = 1
0.00/0.21	% seconds = 0
0.00/0.21	
0.00/0.21	% Interpretation of size 3
0.00/0.21	
0.00/0.21	f13 = 0.
0.00/0.21	
0.00/0.21	f3 = 0.
0.00/0.21	
0.00/0.21	f4 = 0.
0.00/0.21	
0.00/0.21	f8 = 1.
0.00/0.21	
0.00/0.21	f9 = 0.
0.00/0.21	
0.00/0.21	f16(0) = 0.
0.00/0.21	f16(1) = 0.
0.00/0.21	f16(2) = 0.
0.00/0.21	
0.00/0.21	f5(0) = 1.
0.00/0.21	f5(1) = 1.
0.00/0.21	f5(2) = 2.
0.00/0.21	
0.00/0.21	f17(0,0) = 0.
0.00/0.21	f17(0,1) = 0.
0.00/0.21	f17(0,2) = 0.
0.00/0.21	f17(1,0) = 0.
0.00/0.21	f17(1,1) = 1.
0.00/0.21	f17(1,2) = 0.
0.00/0.21	f17(2,0) = 0.
0.00/0.21	f17(2,1) = 0.
0.00/0.21	f17(2,2) = 0.
0.00/0.21	
0.00/0.21	f18(0,0) = 0.
0.00/0.21	f18(0,1) = 0.
0.00/0.21	f18(0,2) = 0.
0.00/0.21	f18(1,0) = 0.
0.00/0.21	f18(1,1) = 1.
0.00/0.21	f18(1,2) = 0.
0.00/0.21	f18(2,0) = 0.
0.00/0.21	f18(2,1) = 0.
0.00/0.21	f18(2,2) = 0.
0.00/0.21	
0.00/0.21	f19(0,0) = 2.
0.00/0.21	f19(0,1) = 2.
0.00/0.21	f19(0,2) = 2.
0.00/0.21	f19(1,0) = 2.
0.00/0.21	f19(1,1) = 1.
0.00/0.21	f19(1,2) = 2.
0.00/0.21	f19(2,0) = 2.
0.00/0.21	f19(2,1) = 2.
0.00/0.21	f19(2,2) = 2.
0.00/0.21	
0.00/0.21	f6(0,0) = 0.
0.00/0.21	f6(0,1) = 0.
0.00/0.21	f6(0,2) = 0.
0.00/0.21	f6(1,0) = 0.
0.00/0.21	f6(1,1) = 0.
0.00/0.21	f6(1,2) = 0.
0.00/0.21	f6(2,0) = 0.
0.00/0.21	f6(2,1) = 0.
0.00/0.21	f6(2,2) = 0.
0.00/0.21	
0.00/0.21	f7(0,0) = 0.
0.00/0.21	f7(0,1) = 0.
0.00/0.21	f7(0,2) = 0.
0.00/0.21	f7(1,0) = 0.
0.00/0.21	f7(1,1) = 0.
0.00/0.21	f7(1,2) = 0.
0.00/0.21	f7(2,0) = 0.
0.00/0.21	f7(2,1) = 0.
0.00/0.21	f7(2,2) = 0.
0.00/0.21	
0.00/0.21	  arrowN_s0(0,0).
0.00/0.21	  arrowN_s0(0,1).
0.00/0.21	- arrowN_s0(0,2).
0.00/0.21	- arrowN_s0(1,0).
0.00/0.21	  arrowN_s0(1,1).
0.00/0.21	- arrowN_s0(1,2).
0.00/0.21	  arrowN_s0(2,0).
0.00/0.21	  arrowN_s0(2,1).
0.00/0.21	  arrowN_s0(2,2).
0.00/0.21	
0.00/0.21	  arrowStar_s0(0,0).
0.00/0.21	- arrowStar_s0(0,1).
0.00/0.21	- arrowStar_s0(0,2).
0.00/0.21	- arrowStar_s0(1,0).
0.00/0.21	  arrowStar_s0(1,1).
0.00/0.21	- arrowStar_s0(1,2).
0.00/0.21	  arrowStar_s0(2,0).
0.00/0.21	  arrowStar_s0(2,1).
0.00/0.21	  arrowStar_s0(2,2).
0.00/0.21	
0.00/0.21	  arrow_s0(0,0).
0.00/0.21	- arrow_s0(0,1).
0.00/0.21	- arrow_s0(0,2).
0.00/0.21	- arrow_s0(1,0).
0.00/0.21	  arrow_s0(1,1).
0.00/0.21	- arrow_s0(1,2).
0.00/0.21	  arrow_s0(2,0).
0.00/0.21	  arrow_s0(2,1).
0.00/0.21	  arrow_s0(2,2).
0.00/0.21	
0.00/0.21	  gtrsim_s0(0,0).
0.00/0.21	  gtrsim_s0(0,1).
0.00/0.21	- gtrsim_s0(0,2).
0.00/0.21	- gtrsim_s0(1,0).
0.00/0.21	  gtrsim_s0(1,1).
0.00/0.21	- gtrsim_s0(1,2).
0.00/0.21	  gtrsim_s0(2,0).
0.00/0.21	  gtrsim_s0(2,1).
0.00/0.21	  gtrsim_s0(2,2).
0.00/0.21	
0.00/0.21	- sqsupsetStar_s0(0,0).
0.00/0.21	  sqsupsetStar_s0(0,1).
0.00/0.21	- sqsupsetStar_s0(0,2).
0.00/0.21	- sqsupsetStar_s0(1,0).
0.00/0.21	- sqsupsetStar_s0(1,1).
0.00/0.21	- sqsupsetStar_s0(1,2).
0.00/0.21	- sqsupsetStar_s0(2,0).
0.00/0.21	  sqsupsetStar_s0(2,1).
0.00/0.21	- sqsupsetStar_s0(2,2).
0.00/0.21	
0.00/0.21	- sqsupset_s0(0,0).
0.00/0.21	  sqsupset_s0(0,1).
0.00/0.21	- sqsupset_s0(0,2).
0.00/0.21	- sqsupset_s0(1,0).
0.00/0.21	- sqsupset_s0(1,1).
0.00/0.21	- sqsupset_s0(1,2).
0.00/0.21	- sqsupset_s0(2,0).
0.00/0.21	  sqsupset_s0(2,1).
0.00/0.21	- sqsupset_s0(2,2).
0.00/0.21	
0.00/0.21	  succeq_s0(0,0).
0.00/0.21	- succeq_s0(0,1).
0.00/0.21	- succeq_s0(0,2).
0.00/0.21	- succeq_s0(1,0).
0.00/0.21	  succeq_s0(1,1).
0.00/0.21	- succeq_s0(1,2).
0.00/0.21	- succeq_s0(2,0).
0.00/0.21	- succeq_s0(2,1).
0.00/0.21	- succeq_s0(2,2).
0.00/0.21	
0.00/0.21	
0.00/0.21	Problem 1.1: 
0.00/0.21	
0.00/0.21	SCC Processor:
0.00/0.21	-> Pairs:
0.00/0.21	 G(d,e) -> A#
0.00/0.21	 H(x:S,x:S) -> G(x:S,x:S)
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	->Strongly Connected Components:
0.00/0.21	 There is no strongly connected component
0.00/0.21	
0.00/0.21	The problem is finite.
0.00/0.21	
0.00/0.21	Problem 1.2: 
0.00/0.21	
0.00/0.21	SCC Processor:
0.00/0.21	-> Pairs:
0.00/0.21	 Empty
0.00/0.21	-> QPairs:
0.00/0.21	 Empty
0.00/0.21	-> Rules:
0.00/0.21	 A -> h(f(a),f(b))
0.00/0.21	 a -> d
0.00/0.21	 a -> e
0.00/0.21	 b -> d
0.00/0.21	 b -> e
0.00/0.21	 f(x:S) -> x:S | x:S ->* d
0.00/0.21	 g(d,e) -> A
0.00/0.21	 h(x:S,x:S) -> g(x:S,x:S)
0.00/0.21	->Strongly Connected Components:
0.00/0.21	 There is no strongly connected component
0.00/0.21	
0.00/0.21	The problem is finite.
0.00/0.22	EOF