Left Termination of the query pattern
p(g)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

p(.(X, [])).
p(.(s(s(X)), .(Y, Xs))) :- ','(p(.(X, .(Y, Xs))), p(.(s(s(s(s(Y)))), Xs))).
p(.(0, Xs)) :- p(Xs).

Query: p(g)

(1) PrologToTRSTransformerProof (SOUND transformation)

Transformed Prolog program to TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
2 [label="2: p(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
6 [label="6: p(T1), SCOPE: 1, CLAUSE: 0 | p(T1), SCOPE: 1, CLAUSE: 1 | p(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: p(T1), SCOPE: 1, CLAUSE: 0\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: p(T1), SCOPE: 1, CLAUSE: 1 | p(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: p(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: p(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: ','(p(.(T19, .(T20, T21))), p(.(s(s(s(s(T20)))), T21)))\n\nT19 is ground\nT20 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: p(.(T19, .(T20, T21)))\n\nT19 is ground\nT20 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: p(.(s(s(s(s(T20)))), T21))\n\nT20 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: p(T30)\n\nT30 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 52 [arrowhead = none ];
52 -> 6;

53 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
6 -> 53 [arrowhead = none ];
53 -> 7;

54 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
6 -> 54 [arrowhead = none ];
54 -> 8;

55 [label="EVAL with clause\np(.(X5, [])).\nand substitutionX5 -> T6,\nT1 -> .(T6, [])", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 55 [arrowhead = none ];
55 -> 13;

56 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
7 -> 56 [arrowhead = none ];
56 -> 14;

57 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
8 -> 57 [arrowhead = none ];
57 -> 20;

58 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
8 -> 58 [arrowhead = none ];
58 -> 21;

59 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
13 -> 59 [arrowhead = none ];
59 -> 15;

60 [label="EVAL with clause\np(.(s(s(X18)), .(X19, X20))) :- ','(p(.(X18, .(X19, X20))), p(.(s(s(s(s(X19)))), X20))).\nand substitutionX18 -> T19,\nX19 -> T20,\nX20 -> T21,\nT1 -> .(s(s(T19)), .(T20, T21))", fontsize=14, style = filled, fillcolor = lightblue];
20 -> 60 [arrowhead = none ];
60 -> 22;

61 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
20 -> 61 [arrowhead = none ];
61 -> 23;

62 [label="EVAL with clause\np(.(0, X29)) :- p(X29).\nand substitutionX29 -> T30,\nT1 -> .(0, T30)", fontsize=14, style = filled, fillcolor = lightblue];
21 -> 62 [arrowhead = none ];
62 -> 50;

63 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
21 -> 63 [arrowhead = none ];
63 -> 51;

64 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
22 -> 64 [arrowhead = none ];
64 -> 41;

65 [label="SPLIT 2\nnew knowledge:\nT19 is ground\nT20 is ground\nT21 is ground", fontsize=14, style = filled, fillcolor = violet];
22 -> 65 [arrowhead = none ];
65 -> 43;

66 [label="INSTANCE with matching:\nT1 -> .(T19, .(T20, T21))", fontsize=14, style = filled, fillcolor = lightgrey];
41 -> 66 [arrowhead = none , style=dashed];
66 -> 2[style=dashed];

67 [label="INSTANCE with matching:\nT1 -> .(s(s(s(s(T20)))), T21)", fontsize=14, style = filled, fillcolor = lightgrey];
43 -> 67 [arrowhead = none , style=dashed];
67 -> 2[style=dashed];

68 [label="INSTANCE with matching:\nT1 -> T30", fontsize=14, style = filled, fillcolor = lightgrey];
50 -> 68 [arrowhead = none , style=dashed];
68 -> 2[style=dashed];

}

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F2_IN(.(s(s(T19)), .(T20, T21))) → U1¹(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)
F2_IN(.(0, T30)) → U2¹(f2_in(T30), .(0, T30))
F2_IN(.(0, T30)) → F2_IN(T30)
F22_IN(T19, T20, T21) → U3¹(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))
U3¹(f2_out1, T19, T20, T21) → U4¹(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U3¹(f2_out1, T19, T20, T21) → F2_IN(.(s(s(s(s(T20)))), T21))

The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes.

(6) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)
F22_IN(T19, T20, T21) → U3¹(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3¹(f2_out1, T19, T20, T21) → F2_IN(.(s(s(s(s(T20)))), T21))
F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))
F2_IN(.(0, T30)) → F2_IN(T30)

The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(7) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

F2_IN(.(0, T30)) → F2_IN(T30)

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = x₁ + x₂   
POL(0) = 1   
POL(F22_IN(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(F2_IN(x₁)) = x₁   
POL(U1(x₁, x₂)) = 0   
POL(U2(x₁, x₂)) = 0   
POL(U3(x₁, x₂, x₃, x₄)) = 0   
POL(U3¹(x₁, x₂, x₃, x₄)) = x₂ + x₃ + x₄   
POL(U4(x₁, x₂, x₃, x₄)) = 0   
POL([]) = 1   
POL(f22_in(x₁, x₂, x₃)) = 0   
POL(f22_out1) = 0   
POL(f2_in(x₁)) = 1 + x₁   
POL(f2_out1) = 1   
POL(s(x₁)) = x₁   

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
none

(8) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)
F22_IN(T19, T20, T21) → U3¹(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3¹(f2_out1, T19, T20, T21) → F2_IN(.(s(s(s(s(T20)))), T21))
F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))

The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(9) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

U3¹(f2_out1, T19, T20, T21) → F2_IN(.(s(s(s(s(T20)))), T21))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( U3¹(x₁, ..., x₄) ) = 2x₄ + 2

POL( f2_in(x₁) ) = max{0, -2}

POL( .(x₁, x₂) ) = x₂ + 1

POL( s(x₁) ) = 0

POL( U1(x₁, x₂) ) = max{0, 2x₁ - 1}

POL( f22_in(x₁, ..., x₃) ) = x₃

POL( 0 ) = 2

POL( U2(x₁, x₂) ) = 1

POL( f22_out1 ) = 2

POL( f2_out1 ) = 0

POL( U3(x₁, ..., x₄) ) = max{0, x₂ + x₄ - 2}

POL( U4(x₁, ..., x₄) ) = max{0, x₁ - 1}

POL( [] ) = 0

POL( F2_IN(x₁) ) = max{0, 2x₁ - 2}

POL( F22_IN(x₁, ..., x₃) ) = 2x₃ + 2

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
none

(10) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)
F22_IN(T19, T20, T21) → U3¹(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))

The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(11) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(12) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))
F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)

The TRS R consists of the following rules:

f2_in(.(T6, [])) → f2_out1
f2_in(.(s(s(T19)), .(T20, T21))) → U1(f22_in(T19, T20, T21), .(s(s(T19)), .(T20, T21)))
U1(f22_out1, .(s(s(T19)), .(T20, T21))) → f2_out1
f2_in(.(0, T30)) → U2(f2_in(T30), .(0, T30))
U2(f2_out1, .(0, T30)) → f2_out1
f22_in(T19, T20, T21) → U3(f2_in(.(T19, .(T20, T21))), T19, T20, T21)
U3(f2_out1, T19, T20, T21) → U4(f2_in(.(s(s(s(s(T20)))), T21)), T19, T20, T21)
U4(f2_out1, T19, T20, T21) → f22_out1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) UsableRulesProof (EQUIVALENT transformation)

We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))
F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(15) UsableRulesReductionPairsProof (EQUIVALENT transformation)

By using the usable rules with reduction pair processor [LPAR04] with a polynomial ordering [POLO], all dependency pairs and the corresponding usable rules [FROCOS05] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

The following dependency pairs can be deleted:

F2_IN(.(s(s(T19)), .(T20, T21))) → F22_IN(T19, T20, T21)

No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = x₁ + x₂   
POL(F22_IN(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(F2_IN(x₁)) = x₁   
POL(s(x₁)) = 2·x₁   

(16) Obligation:

Q DP problem:
The TRS P consists of the following rules:

F22_IN(T19, T20, T21) → F2_IN(.(T19, .(T20, T21)))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(17) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(18) TRUE