/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
pin(a) -> pout(b)
pin(b) -> pout(c)
tc(x:S) -> x:S
tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S

Conditional Termination Problem 2:
-> Pairs:
 TC(x:S) -> PIN(x:S)
 TC(x:S) -> TC(z) | pin(x:S) ->* pout(z)
-> QPairs:
 Empty
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S


The problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 TC(x:S) -> PIN(x:S)
 TC(x:S) -> TC(z) | pin(x:S) ->* pout(z)
-> QPairs:
 Empty
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 TC(x:S) -> TC(z) | pin(x:S) ->* pout(z)
-> QPairs:
 Empty
->->-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 TC(x:S) -> TC(z) | pin(x:S) ->* pout(z)
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
-> Needed rules:
 Empty
-> Usable rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 22102 was started by sandbox2 on n054.star.cs.uiowa.edu,
Tue Jun 30 21:56:34 2020
The command was "./mace4 -c -f /tmp/mace41957747793424238335.in".
============================== end of head ===========================

============================== INPUT =================================

% Reading from file /tmp/mace41957747793424238335.in

assign(max_seconds,20).

formulas(assumptions).
arrowStar_s0(x,x) # label(reflexivity).
arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility).
gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility).
gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility).
arrow_s0(x1,y) -> arrow_s0(f2(x1),f2(y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f8(x1),f8(y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f14(x1,x2),f14(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f14(x1,x2),f14(x1,y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f2(x1),f2(y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f3(x1),f3(y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f8(x1),f8(y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f12(x1),f12(y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f13(x1),f13(y)) # label(congruence).
arrowN_s0(x1,y) -> arrowN_s0(f14(x1,x2),f14(y,x2)) # label(congruence).
arrowN_s0(x2,y) -> arrowN_s0(f14(x1,x2),f14(x1,y)) # label(congruence).
arrow_s0(f2(f4),f8(f5)) # label(replacement).
arrow_s0(f2(f5),f8(f6)) # label(replacement).
arrow_s0(f14(x3,x4),x3) # label(replacement).
arrow_s0(f14(x3,x4),x4) # label(replacement).
arrowN_s0(f14(x3,x4),x3) # label(replacement).
arrowN_s0(f14(x3,x4),x4) # label(replacement).
arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
arrowStar_s0(f2(x1),f8(f9)) -> sqsupset_s0(f13(x1),f13(f9)) # label(replacement).
sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion).
sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility).
end_of_list.

formulas(goals).
(exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness).
end_of_list.

============================== end of input ==========================

============================== PROCESS NON-CLAUSAL FORMULAS ==========

% Formulas that are not ordinary clauses:
1 arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
2 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
3 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
4 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
5 arrow_s0(x1,y) -> arrow_s0(f2(x1),f2(y)) # label(congruence) # label(non_clause).  [assumption].
6 arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence) # label(non_clause).  [assumption].
7 arrow_s0(x1,y) -> arrow_s0(f8(x1),f8(y)) # label(congruence) # label(non_clause).  [assumption].
8 arrow_s0(x1,y) -> arrow_s0(f14(x1,x2),f14(y,x2)) # label(congruence) # label(non_clause).  [assumption].
9 arrow_s0(x2,y) -> arrow_s0(f14(x1,x2),f14(x1,y)) # label(congruence) # label(non_clause).  [assumption].
10 arrowN_s0(x1,y) -> arrowN_s0(f2(x1),f2(y)) # label(congruence) # label(non_clause).  [assumption].
11 arrowN_s0(x1,y) -> arrowN_s0(f3(x1),f3(y)) # label(congruence) # label(non_clause).  [assumption].
12 arrowN_s0(x1,y) -> arrowN_s0(f8(x1),f8(y)) # label(congruence) # label(non_clause).  [assumption].
13 arrowN_s0(x1,y) -> arrowN_s0(f12(x1),f12(y)) # label(congruence) # label(non_clause).  [assumption].
14 arrowN_s0(x1,y) -> arrowN_s0(f13(x1),f13(y)) # label(congruence) # label(non_clause).  [assumption].
15 arrowN_s0(x1,y) -> arrowN_s0(f14(x1,x2),f14(y,x2)) # label(congruence) # label(non_clause).  [assumption].
16 arrowN_s0(x2,y) -> arrowN_s0(f14(x1,x2),f14(x1,y)) # label(congruence) # label(non_clause).  [assumption].
17 arrowN_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
18 arrowStar_s0(f2(x1),f8(f9)) -> sqsupset_s0(f13(x1),f13(f9)) # label(replacement) # label(non_clause).  [assumption].
19 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
20 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
21 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness) # label(non_clause) # label(goal).  [goal].

============================== end of process non-clausal formulas ===

============================== CLAUSES FOR SEARCH ====================

formulas(mace4_clauses).
arrowStar_s0(x,x) # label(reflexivity).
-arrow_s0(x,y) | -arrowStar_s0(y,z) | arrowStar_s0(x,z) # label(compatibility).
-gtrsim_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
-succeq_s0(x,y) | -sqsupset_s0(y,z) | sqsupset_s0(x,z) # label(compatibility).
-gtrsim_s0(x,y) | -succeq_s0(y,z) | gtrsim_s0(x,z) # label(compatibility).
-arrow_s0(x,y) | arrow_s0(f2(x),f2(y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f3(x),f3(y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(x),f8(y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f14(x,z),f14(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f14(z,x),f14(z,y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f2(x),f2(y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f3(x),f3(y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f8(x),f8(y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f12(x),f12(y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f13(x),f13(y)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f14(x,z),f14(y,z)) # label(congruence).
-arrowN_s0(x,y) | arrowN_s0(f14(z,x),f14(z,y)) # label(congruence).
arrow_s0(f2(f4),f8(f5)) # label(replacement).
arrow_s0(f2(f5),f8(f6)) # label(replacement).
arrow_s0(f14(x,y),x) # label(replacement).
arrow_s0(f14(x,y),y) # label(replacement).
arrowN_s0(f14(x,y),x) # label(replacement).
arrowN_s0(f14(x,y),y) # label(replacement).
-arrowN_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
-arrowStar_s0(f2(x),f8(f9)) | sqsupset_s0(f13(x),f13(f9)) # label(replacement).
-sqsupset_s0(x,y) | sqsupsetStar_s0(x,y) # label(inclusion).
-sqsupset_s0(x,y) | -sqsupsetStar_s0(y,z) | sqsupsetStar_s0(x,z) # label(compatibility).
-sqsupsetStar_s0(x,x) # label(wellfoundedness).
end_of_list.

============================== end of clauses for search =============

% There are no natural numbers in the input.

============================== DOMAIN SIZE 2 =========================

============================== MODEL =================================

interpretation( 2, [number=1, seconds=0], [

        function(f4, [ 0 ]),

        function(f5, [ 0 ]),

        function(f6, [ 0 ]),

        function(f9, [ 1 ]),

        function(f12(_), [ 0, 0 ]),

        function(f13(_), [ 0, 0 ]),

        function(f2(_), [ 0, 0 ]),

        function(f3(_), [ 0, 0 ]),

        function(f8(_), [ 0, 1 ]),

        function(f14(_,_), [
			   0, 1,
			   1, 1 ]),

        relation(arrowN_s0(_,_), [
			   1, 0,
			   1, 1 ]),

        relation(arrowStar_s0(_,_), [
			   1, 0,
			   1, 1 ]),

        relation(arrow_s0(_,_), [
			   1, 0,
			   1, 1 ]),

        relation(gtrsim_s0(_,_), [
			   1, 0,
			   1, 1 ]),

        relation(sqsupsetStar_s0(_,_), [
			   0, 0,
			   0, 0 ]),

        relation(sqsupset_s0(_,_), [
			   0, 0,
			   0, 0 ]),

        relation(succeq_s0(_,_), [
			   0, 0,
			   0, 0 ])
]).

============================== end of model ==========================

============================== STATISTICS ============================

For domain size 2.

Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds).
Ground clauses: seen=136, kept=132.
Selections=27, assignments=35, propagations=50, current_models=1.
Rewrite_terms=388, rewrite_bools=277, indexes=88.
Rules_from_neg_clauses=13, cross_offs=13.

============================== end of statistics =====================

User_CPU=0.00, System_CPU=0.00, Wall_clock=0.

Exiting with 1 model.

Process 22102 exit (max_models) Tue Jun 30 21:56:34 2020
The process finished Tue Jun 30 21:56:34 2020


Mace4 cooked interpretation:

% number = 1
% seconds = 0

% Interpretation of size 2

f4 = 0.

f5 = 0.

f6 = 0.

f9 = 1.

f12(0) = 0.
f12(1) = 0.

f13(0) = 0.
f13(1) = 0.

f2(0) = 0.
f2(1) = 0.

f3(0) = 0.
f3(1) = 0.

f8(0) = 0.
f8(1) = 1.

f14(0,0) = 0.
f14(0,1) = 1.
f14(1,0) = 1.
f14(1,1) = 1.

  arrowN_s0(0,0).
- arrowN_s0(0,1).
  arrowN_s0(1,0).
  arrowN_s0(1,1).

  arrowStar_s0(0,0).
- arrowStar_s0(0,1).
  arrowStar_s0(1,0).
  arrowStar_s0(1,1).

  arrow_s0(0,0).
- arrow_s0(0,1).
  arrow_s0(1,0).
  arrow_s0(1,1).

  gtrsim_s0(0,0).
- gtrsim_s0(0,1).
  gtrsim_s0(1,0).
  gtrsim_s0(1,1).

- sqsupsetStar_s0(0,0).
- sqsupsetStar_s0(0,1).
- sqsupsetStar_s0(1,0).
- sqsupsetStar_s0(1,1).

- sqsupset_s0(0,0).
- sqsupset_s0(0,1).
- sqsupset_s0(1,0).
- sqsupset_s0(1,1).

- succeq_s0(0,0).
- succeq_s0(0,1).
- succeq_s0(1,0).
- succeq_s0(1,1).


Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 pin(a) -> pout(b)
 pin(b) -> pout(c)
 tc(x:S) -> x:S
 tc(x:S) -> y:S | pin(x:S) ->* pout(z), tc(z) ->* y:S
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.