Left Termination proof of /tmp/tmpdgzBmx/append-ooi.pl

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

0 Prolog

↳1 PrologToPiTRSViaGraphTransformerProof (⇒, 110 ms)

↳2 PiTRS

↳3 DependencyPairsProof (⇔, 0 ms)

↳4 PiDP

↳5 DependencyGraphProof (⇔, 0 ms)

↳6 PiDP

↳7 UsableRulesProof (⇔, 0 ms)

↳8 PiDP

↳9 PiDPToQDPProof (⇒, 9 ms)

↳10 QDP

↳11 QDPSizeChangeProof (⇔, 0 ms)

↳12 YES

(0) Obligation:

Clauses:

app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).

Query: app(a,a,g)

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

Transformed Prolog program to (Pi-)TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="A: app(T1, T2, T3)\n\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
5 [label="5: app(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | app(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: true | app(T1, T2, T5), SCOPE: 1, CLAUSE: 1\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: app(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT3 is ground\nX2 is free\napp(T1, T2, T3) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: app(T1, T2, T5), SCOPE: 1, CLAUSE: 1\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: app(T14, T15, T13)\n\nT13 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: app(T14, T15, T13), SCOPE: 2, CLAUSE: 0 | app(T14, T15, T13), SCOPE: 2, CLAUSE: 1\n\nT13 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: app(T14, T15, T13), SCOPE: 2, CLAUSE: 0\n\nT13 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: app(T14, T15, T13), SCOPE: 2, CLAUSE: 1\n\nT13 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: app(T33, T34, T32)\n\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: app(T45, T46, T44)\n\nT41 is ground\nT44 is ground\nX2 is free\napp(T1, T2, .(T41, T44)) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: app(T45, T46, T44), SCOPE: 3, CLAUSE: 0 | app(T45, T46, T44), SCOPE: 3, CLAUSE: 1\n\nT41 is ground\nT44 is ground\nX2 is free\napp(T1, T2, .(T41, T44)) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: app(T45, T46, T44), SCOPE: 3, CLAUSE: 0\n\nT41 is ground\nT44 is ground\nX2 is free\napp(T1, T2, .(T41, T44)) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: app(T45, T46, T44), SCOPE: 3, CLAUSE: 1\n\nT41 is ground\nT44 is ground\nX2 is free\napp(T1, T2, .(T41, T44)) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: app(T64, T65, T63)\n\nT41 is ground\nT60 is ground\nT63 is ground\nX2 is free\napp(T1, T2, .(T41, .(T60, T63))) !=? app([], X2, X2)", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 59 [arrowhead = none ];
59 -> 5;

60 [label="EVAL with clause\napp([], X2, X2).\nand substitutionT1 -> [],\nT2 -> T5,\nX2 -> T5,\nT3 -> T5", fontsize=14, style = filled, fillcolor = lightblue];
5 -> 60 [arrowhead = none ];
60 -> 9;

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

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

63 [label="EVAL with clause\napp(.(X34, X35), X36, .(X34, X37)) :- app(X35, X36, X37).\nand substitutionX34 -> T41,\nX35 -> T45,\nT1 -> .(T41, T45),\nT2 -> T46,\nX36 -> T46,\nX37 -> T44,\nT3 -> .(T41, T44),\nT42 -> T45,\nT43 -> T46", fontsize=14, style = filled, fillcolor = lightblue];
12 -> 63 [arrowhead = none ];
63 -> 42;

64 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
12 -> 64 [arrowhead = none ];
64 -> 44;

65 [label="EVAL with clause\napp(.(X7, X8), X9, .(X7, X10)) :- app(X8, X9, X10).\nand substitutionX7 -> T10,\nX8 -> T14,\nT1 -> .(T10, T14),\nT2 -> T15,\nX9 -> T15,\nX10 -> T13,\nT5 -> .(T10, T13),\nT11 -> T14,\nT12 -> T15", fontsize=14, style = filled, fillcolor = lightblue];
15 -> 65 [arrowhead = none ];
65 -> 28;

66 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
15 -> 66 [arrowhead = none ];
66 -> 29;

67 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
28 -> 67 [arrowhead = none ];
67 -> 30;

68 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
30 -> 68 [arrowhead = none ];
68 -> 31;

69 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
30 -> 69 [arrowhead = none ];
69 -> 32;

70 [label="EVAL with clause\napp([], X15, X15).\nand substitutionT14 -> [],\nT15 -> T20,\nX15 -> T20,\nT13 -> T20", fontsize=14, style = filled, fillcolor = lightblue];
31 -> 70 [arrowhead = none ];
70 -> 33;

71 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
31 -> 71 [arrowhead = none ];
71 -> 34;

72 [label="EVAL with clause\napp(.(X24, X25), X26, .(X24, X27)) :- app(X25, X26, X27).\nand substitutionX24 -> T29,\nX25 -> T33,\nT14 -> .(T29, T33),\nT15 -> T34,\nX26 -> T34,\nX27 -> T32,\nT13 -> .(T29, T32),\nT30 -> T33,\nT31 -> T34", fontsize=14, style = filled, fillcolor = lightblue];
32 -> 72 [arrowhead = none ];
72 -> 38;

73 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
32 -> 73 [arrowhead = none ];
73 -> 39;

74 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
33 -> 74 [arrowhead = none ];
74 -> 35;

75 [label="INSTANCE with matching:\nT1 -> T33\nT2 -> T34\nT3 -> T32", fontsize=14, style = filled, fillcolor = lightgrey];
38 -> 75 [arrowhead = none , style=dashed];
75 -> 1[style=dashed];

76 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
42 -> 76 [arrowhead = none ];
76 -> 45;

77 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
45 -> 77 [arrowhead = none ];
77 -> 48;

78 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
45 -> 78 [arrowhead = none ];
78 -> 49;

79 [label="EVAL with clause\napp([], X42, X42).\nand substitutionT45 -> [],\nT46 -> T51,\nX42 -> T51,\nT44 -> T51", fontsize=14, style = filled, fillcolor = lightblue];
48 -> 79 [arrowhead = none ];
79 -> 51;

80 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
48 -> 80 [arrowhead = none ];
80 -> 54;

81 [label="EVAL with clause\napp(.(X51, X52), X53, .(X51, X54)) :- app(X52, X53, X54).\nand substitutionX51 -> T60,\nX52 -> T64,\nT45 -> .(T60, T64),\nT46 -> T65,\nX53 -> T65,\nX54 -> T63,\nT44 -> .(T60, T63),\nT61 -> T64,\nT62 -> T65", fontsize=14, style = filled, fillcolor = lightblue];
49 -> 81 [arrowhead = none ];
81 -> 56;

82 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
49 -> 82 [arrowhead = none ];
82 -> 58;

83 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
51 -> 83 [arrowhead = none ];
83 -> 55;

84 [label="INSTANCE with matching:\nT1 -> T64\nT2 -> T65\nT3 -> T63", fontsize=14, style = filled, fillcolor = lightgrey];
56 -> 84 [arrowhead = none , style=dashed];
84 -> 1[style=dashed];

}

(2) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

appA_in_aag([], T5, T5) → appA_out_aag([], T5, T5)
appA_in_aag(.(T10, []), T20, .(T10, T20)) → appA_out_aag(.(T10, []), T20, .(T10, T20))
appA_in_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_aag(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
appA_in_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_aag(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))
U2_aag(T41, T60, T64, T65, T63, appA_out_aag(T64, T65, T63)) → appA_out_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63)))
U1_aag(T10, T29, T33, T34, T32, appA_out_aag(T33, T34, T32)) → appA_out_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32)))

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_AAG(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → APPA_IN_AAG(T33, T34, T32)
APPA_IN_AAG(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_AAG(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))

The TRS R consists of the following rules:

appA_in_aag([], T5, T5) → appA_out_aag([], T5, T5)
appA_in_aag(.(T10, []), T20, .(T10, T20)) → appA_out_aag(.(T10, []), T20, .(T10, T20))
appA_in_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_aag(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
appA_in_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_aag(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))
U2_aag(T41, T60, T64, T65, T63, appA_out_aag(T64, T65, T63)) → appA_out_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63)))
U1_aag(T10, T29, T33, T34, T32, appA_out_aag(T33, T34, T32)) → appA_out_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32)))

The argument filtering Pi contains the following mapping:
appA_in_aag(x1, x2, x3) = appA_in_aag(x3)
appA_out_aag(x1, x2, x3) = appA_out_aag(x1, x2, x3)
.(x1, x2) = .(x1, x2)
U1_aag(x1, x2, x3, x4, x5, x6) = U1_aag(x1, x2, x5, x6)
U2_aag(x1, x2, x3, x4, x5, x6) = U2_aag(x1, x2, x5, x6)
APPA_IN_AAG(x1, x2, x3) = APPA_IN_AAG(x3)
U1_AAG(x1, x2, x3, x4, x5, x6) = U1_AAG(x1, x2, x5, x6)
U2_AAG(x1, x2, x3, x4, x5, x6) = U2_AAG(x1, x2, x5, x6)

We have to consider all (P,R,Pi)-chains

(4) Obligation:

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

APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_AAG(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → APPA_IN_AAG(T33, T34, T32)
APPA_IN_AAG(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_AAG(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))

The TRS R consists of the following rules:

appA_in_aag([], T5, T5) → appA_out_aag([], T5, T5)
appA_in_aag(.(T10, []), T20, .(T10, T20)) → appA_out_aag(.(T10, []), T20, .(T10, T20))
appA_in_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_aag(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
appA_in_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_aag(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))
U2_aag(T41, T60, T64, T65, T63, appA_out_aag(T64, T65, T63)) → appA_out_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63)))
U1_aag(T10, T29, T33, T34, T32, appA_out_aag(T33, T34, T32)) → appA_out_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32)))

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 2 less nodes.

(6) Obligation:

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

APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → APPA_IN_AAG(T33, T34, T32)

The TRS R consists of the following rules:

appA_in_aag([], T5, T5) → appA_out_aag([], T5, T5)
appA_in_aag(.(T10, []), T20, .(T10, T20)) → appA_out_aag(.(T10, []), T20, .(T10, T20))
appA_in_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → U1_aag(T10, T29, T33, T34, T32, appA_in_aag(T33, T34, T32))
appA_in_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63))) → U2_aag(T41, T60, T64, T65, T63, appA_in_aag(T64, T65, T63))
U2_aag(T41, T60, T64, T65, T63, appA_out_aag(T64, T65, T63)) → appA_out_aag(.(T41, .(T60, T64)), T65, .(T41, .(T60, T63)))
U1_aag(T10, T29, T33, T34, T32, appA_out_aag(T33, T34, T32)) → appA_out_aag(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32)))

(7) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(8) Obligation:

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

APPA_IN_AAG(.(T10, .(T29, T33)), T34, .(T10, .(T29, T32))) → APPA_IN_AAG(T33, T34, T32)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
APPA_IN_AAG(x1, x2, x3) = APPA_IN_AAG(x3)

We have to consider all (P,R,Pi)-chains

(9) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(10) Obligation:

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

APPA_IN_AAG(.(T10, .(T29, T32))) → APPA_IN_AAG(T32)

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

(11) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

APPA_IN_AAG(.(T10, .(T29, T32))) → APPA_IN_AAG(T32)
The graph contains the following edges 1 > 1

(0) Obligation:

(1) PrologToPiTRSViaGraphTransformerProof (SOUND transformation)

(2) Obligation:

(3) DependencyPairsProof (EQUIVALENT transformation)

(4) Obligation:

(5) DependencyGraphProof (EQUIVALENT transformation)

(6) Obligation:

(7) UsableRulesProof (EQUIVALENT transformation)

(8) Obligation:

(9) PiDPToQDPProof (SOUND transformation)

(10) Obligation:

(11) QDPSizeChangeProof (EQUIVALENT transformation)

(12) YES