YES

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S)))
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
 F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S)))
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))

Problem 1: 

SCC Processor:
-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S)))
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
 F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S)))
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S)))
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->->Cycle:
->->-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S)))
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S)))
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
-> Usable rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 45729 was started by sandbox2 on n189.star.cs.uiowa.edu,
Mon Jun 22 00:51:24 2020
The command was "./mace4 -c -f /tmp/mace49398195822001100545.in".
============================== end of head ===========================

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

% Reading from file /tmp/mace49398195822001100545.in

assign(max_seconds,20).

formulas(assumptions).
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,x2),f2(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x1)),f2(f3,f2(f3,f2(f3,x1)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x1)),f2(f4,f2(f4,f2(f4,x1)))) # label(replacement).
arrow_s0(f8(x2,x3),x2) # label(replacement).
arrow_s0(f8(x2,x3),x3) # label(replacement).
arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f4,f2(f3,x1)),f7(f4,f2(f4,f2(f4,x1)))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x1)),f7(f4,f2(f4,x1))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x1)),f7(f4,x1)) # 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 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause).  [assumption].
5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause).  [assumption].
6 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
7 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
8 arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence) # label(non_clause).  [assumption].
9 arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence) # label(non_clause).  [assumption].
10 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
11 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
12 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
13 (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).
-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,z),f2(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f2(z,x),f2(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(x,z),f7(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(z,x),f7(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(x,z),f8(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(z,x),f8(z,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x)),f2(f3,f2(f3,f2(f3,x)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x)),f2(f4,f2(f4,f2(f4,x)))) # label(replacement).
arrow_s0(f8(x,y),x) # label(replacement).
arrow_s0(f8(x,y),y) # label(replacement).
-arrow_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f4,f2(f3,x)),f7(f4,f2(f4,f2(f4,x)))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x)),f7(f4,f2(f4,x))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x)),f7(f4,x)) # 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(f3, [ 0 ]),

        function(f4, [ 1 ]),

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

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

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

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

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

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

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

        relation(succeq_s0(_,_), [
			   1, 1,
			   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=108, kept=108.
Selections=139, assignments=268, propagations=257, current_models=1.
Rewrite_terms=2709, rewrite_bools=1804, indexes=421.
Rules_from_neg_clauses=25, cross_offs=25.

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

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

Exiting with 1 model.

Process 45729 exit (max_models) Mon Jun 22 00:51:24 2020
The process finished Mon Jun 22 00:51:24 2020


Mace4 cooked interpretation:

% number = 1
% seconds = 0

% Interpretation of size 2

f3 = 0.

f4 = 1.

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

f7(0,0) = 0.
f7(0,1) = 0.
f7(1,0) = 0.
f7(1,1) = 1.

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

  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.1: 

SCC Processor:
-> Pairs:
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 F(b,f(a,x:S)) -> F(b,f(b,x:S))
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
-> Usable rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 45842 was started by sandbox2 on n189.star.cs.uiowa.edu,
Mon Jun 22 00:51:24 2020
The command was "./mace4 -c -f /tmp/mace41469834481822890675.in".
============================== end of head ===========================

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

% Reading from file /tmp/mace41469834481822890675.in

assign(max_seconds,20).

formulas(assumptions).
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,x2),f2(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x1)),f2(f3,f2(f3,f2(f3,x1)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x1)),f2(f4,f2(f4,f2(f4,x1)))) # label(replacement).
arrow_s0(f8(x2,x3),x2) # label(replacement).
arrow_s0(f8(x2,x3),x3) # label(replacement).
arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f4,f2(f3,x1)),f7(f4,f2(f4,x1))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x1)),f7(f4,x1)) # 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 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause).  [assumption].
5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause).  [assumption].
6 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
7 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
8 arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence) # label(non_clause).  [assumption].
9 arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence) # label(non_clause).  [assumption].
10 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
11 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
12 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
13 (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).
-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,z),f2(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f2(z,x),f2(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(x,z),f7(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(z,x),f7(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(x,z),f8(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(z,x),f8(z,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x)),f2(f3,f2(f3,f2(f3,x)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x)),f2(f4,f2(f4,f2(f4,x)))) # label(replacement).
arrow_s0(f8(x,y),x) # label(replacement).
arrow_s0(f8(x,y),y) # label(replacement).
-arrow_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f4,f2(f3,x)),f7(f4,f2(f4,x))) # label(replacement).
succeq_s0(f7(f4,f2(f3,x)),f7(f4,x)) # 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(f3, [ 0 ]),

        function(f4, [ 1 ]),

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

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

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

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

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

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

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

        relation(succeq_s0(_,_), [
			   1, 1,
			   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=106, kept=106.
Selections=133, assignments=256, propagations=164, current_models=1.
Rewrite_terms=2043, rewrite_bools=1673, indexes=256.
Rules_from_neg_clauses=16, cross_offs=16.

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

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

Exiting with 1 model.

Process 45842 exit (max_models) Mon Jun 22 00:51:24 2020
The process finished Mon Jun 22 00:51:24 2020


Mace4 cooked interpretation:

% number = 1
% seconds = 0

% Interpretation of size 2

f3 = 0.

f4 = 1.

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

f7(0,0) = 0.
f7(0,1) = 0.
f7(1,0) = 0.
f7(1,1) = 1.

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

  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.1: 

SCC Processor:
-> Pairs:
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(b,f(a,x:S)) -> F(b,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))

Problem 1.1: 

Subterm Processor:
-> Pairs:
 F(b,f(a,x:S)) -> F(b,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Projection:
 pi(F) = 2

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S)))
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
-> Usable rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 46009 was started by sandbox2 on n189.star.cs.uiowa.edu,
Mon Jun 22 00:51:25 2020
The command was "./mace4 -c -f /tmp/mace414321146131067854538.in".
============================== end of head ===========================

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

% Reading from file /tmp/mace414321146131067854538.in

assign(max_seconds,20).

formulas(assumptions).
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,x2),f2(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x1)),f2(f3,f2(f3,f2(f3,x1)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x1)),f2(f4,f2(f4,f2(f4,x1)))) # label(replacement).
arrow_s0(f8(x2,x3),x2) # label(replacement).
arrow_s0(f8(x2,x3),x3) # label(replacement).
arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f3,f2(f4,x1)),f7(f3,f2(f3,f2(f3,x1)))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x1)),f7(f3,f2(f3,x1))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x1)),f7(f3,x1)) # 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 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause).  [assumption].
5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause).  [assumption].
6 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
7 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
8 arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence) # label(non_clause).  [assumption].
9 arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence) # label(non_clause).  [assumption].
10 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
11 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
12 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
13 (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).
-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,z),f2(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f2(z,x),f2(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(x,z),f7(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(z,x),f7(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(x,z),f8(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(z,x),f8(z,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x)),f2(f3,f2(f3,f2(f3,x)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x)),f2(f4,f2(f4,f2(f4,x)))) # label(replacement).
arrow_s0(f8(x,y),x) # label(replacement).
arrow_s0(f8(x,y),y) # label(replacement).
-arrow_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f3,f2(f4,x)),f7(f3,f2(f3,f2(f3,x)))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x)),f7(f3,f2(f3,x))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x)),f7(f3,x)) # 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(f3, [ 0 ]),

        function(f4, [ 1 ]),

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

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

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

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

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

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

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

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

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

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

For domain size 2.

Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds).
Ground clauses: seen=108, kept=108.
Selections=97, assignments=187, propagations=176, current_models=1.
Rewrite_terms=1884, rewrite_bools=1166, indexes=282.
Rules_from_neg_clauses=20, cross_offs=20.

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

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

Exiting with 1 model.

Process 46009 exit (max_models) Mon Jun 22 00:51:25 2020
The process finished Mon Jun 22 00:51:25 2020


Mace4 cooked interpretation:

% number = 1
% seconds = 0

% Interpretation of size 2

f3 = 0.

f4 = 1.

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

f7(0,0) = 0.
f7(0,1) = 1.
f7(1,0) = 0.
f7(1,1) = 1.

f8(0,0) = 0.
f8(0,1) = 1.
f8(1,0) = 1.
f8(1,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:
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 F(a,f(b,x:S)) -> F(a,f(a,x:S))
 F(a,f(b,x:S)) -> F(a,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
-> Usable rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 46122 was started by sandbox2 on n189.star.cs.uiowa.edu,
Mon Jun 22 00:51:25 2020
The command was "./mace4 -c -f /tmp/mace41590079444434248626.in".
============================== end of head ===========================

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

% Reading from file /tmp/mace41590079444434248626.in

assign(max_seconds,20).

formulas(assumptions).
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,x2),f2(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence).
arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x1)),f2(f3,f2(f3,f2(f3,x1)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x1)),f2(f4,f2(f4,f2(f4,x1)))) # label(replacement).
arrow_s0(f8(x2,x3),x2) # label(replacement).
arrow_s0(f8(x2,x3),x3) # label(replacement).
arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f3,f2(f4,x1)),f7(f3,f2(f3,x1))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x1)),f7(f3,x1)) # 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 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause).  [assumption].
5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause).  [assumption].
6 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause).  [assumption].
7 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause).  [assumption].
8 arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence) # label(non_clause).  [assumption].
9 arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence) # label(non_clause).  [assumption].
10 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
11 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause).  [assumption].
12 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause).  [assumption].
13 (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).
-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,z),f2(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f2(z,x),f2(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(x,z),f7(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f7(z,x),f7(z,y)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(x,z),f8(y,z)) # label(congruence).
-arrow_s0(x,y) | arrow_s0(f8(z,x),f8(z,y)) # label(congruence).
arrow_s0(f2(f3,f2(f4,x)),f2(f3,f2(f3,f2(f3,x)))) # label(replacement).
arrow_s0(f2(f4,f2(f3,x)),f2(f4,f2(f4,f2(f4,x)))) # label(replacement).
arrow_s0(f8(x,y),x) # label(replacement).
arrow_s0(f8(x,y),y) # label(replacement).
-arrow_s0(x,y) | gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f7(f3,f2(f4,x)),f7(f3,f2(f3,x))) # label(replacement).
succeq_s0(f7(f3,f2(f4,x)),f7(f3,x)) # 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(f3, [ 0 ]),

        function(f4, [ 1 ]),

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

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

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

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

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

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

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

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

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

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

For domain size 2.

Current CPU time: 0.00 seconds (total CPU time: 0.00 seconds).
Ground clauses: seen=106, kept=106.
Selections=91, assignments=175, propagations=90, current_models=1.
Rewrite_terms=1388, rewrite_bools=1016, indexes=156.
Rules_from_neg_clauses=9, cross_offs=9.

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

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

Exiting with 1 model.

Process 46122 exit (max_models) Mon Jun 22 00:51:25 2020
The process finished Mon Jun 22 00:51:25 2020


Mace4 cooked interpretation:

% number = 1
% seconds = 0

% Interpretation of size 2

f3 = 0.

f4 = 1.

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

f7(0,0) = 0.
f7(0,1) = 1.
f7(1,0) = 0.
f7(1,1) = 1.

f8(0,0) = 0.
f8(0,1) = 1.
f8(1,0) = 1.
f8(1,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:
 F(a,f(b,x:S)) -> F(a,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(a,f(b,x:S)) -> F(a,x:S)
->->-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))

Problem 1.2: 

Subterm Processor:
-> Pairs:
 F(a,f(b,x:S)) -> F(a,x:S)
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Projection:
 pi(F) = 2

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S)))
 f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.