YES
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Frameset//EN"
"http:/www.w3.org/TR/html4/frameset.dtd">
<html>
<head>
<title>Left Termination proof of ../tpdb/LP/talp/apt/sum.pl</title>
</head>
<body>
<BR><B>Left Termination</B> of the query pattern
sum_in_3(a, a, g)
w.r.t. the given <I>Prolog program</I> could successfully be <font color=#00ff00>proven</font>:<BR><BR><BR><BR><pre>&#8627 <B>Prolog</B></pre><pre>  &#8627 PrologToPiTRSProof</pre><BR>Clauses:<BR><BR>sum(X, s(Y), s(Z))&#160;:-&#160;sum(X, Y, Z).<BR>sum(X, 0, X).<BR><BR>Queries:<BR><BR>sum(a,a,g).<BR><BR>We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
<BR><FONT COLOR=#0000cc>sum_in</font>: (f,f,b)
<BR>Transforming <I>Prolog</I> into the following <B>Term Rewriting System</B>:
<BR>Pi-finite rewrite system:<BR>The TRS R consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>)
<BR><FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>))</BLOCKQUOTE><BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>)<BR>
<BR>
<P><B>Infinitary Constructor Rewriting Termination</B> of PiTRS implies <B>Termination</B> of Prolog<P>
<BR><BR><pre>&#8627 Prolog</pre><pre>  &#8627 PrologToPiTRSProof</pre><pre>    &#8627 <B>PiTRS</B></pre><pre>      &#8627 DependencyPairsProof</pre><BR>Pi-finite rewrite system:<BR>The TRS R consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>)
<BR><FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>))</BLOCKQUOTE><BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>)<BR>
<BR><BR>Using Dependency Pairs [1,30] we result in the following initial DP problem:<BR>Pi DP problem:<BR>The TRS P consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)</BLOCKQUOTE><BR>The TRS R consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>)
<BR><FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>))</BLOCKQUOTE><BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>)<BR>
<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<BR>We have to consider all (P,R,Pi)-chains<BR><BR><pre>&#8627 Prolog</pre><pre>  &#8627 PrologToPiTRSProof</pre><pre>    &#8627 PiTRS</pre><pre>      &#8627 DependencyPairsProof</pre><pre>        &#8627 <B>PiDP</B></pre><pre>          &#8627 DependencyGraphProof</pre><BR>Pi DP problem:<BR>The TRS P consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)</BLOCKQUOTE><BR>The TRS R consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>)
<BR><FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>))</BLOCKQUOTE><BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>)<BR>
<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_AAG</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<BR>We have to consider all (P,R,Pi)-chains<BR>The approximation of the Dependency Graph [30] contains 1 SCC with 1 less node.<BR><BR><pre>&#8627 Prolog</pre><pre>  &#8627 PrologToPiTRSProof</pre><pre>    &#8627 PiTRS</pre><pre>      &#8627 DependencyPairsProof</pre><pre>        &#8627 PiDP</pre><pre>          &#8627 DependencyGraphProof</pre><pre>            &#8627 <B>PiDP</B></pre><pre>              &#8627 UsableRulesProof</pre><BR>Pi DP problem:<BR>The TRS P consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)</BLOCKQUOTE><BR>The TRS R consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>))
<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>0</font>, <FONT COLOR=#cc0000>X</font>)
<BR><FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>, <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>))</BLOCKQUOTE><BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_in_aag</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>, <FONT COLOR=#cc0000>x4</font>)&#160; = &#160;<FONT COLOR=#0000cc>U1_aag</font>(<FONT COLOR=#cc0000>x4</font>)<BR>
<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>sum_out_aag</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>)<BR>
<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<BR>We have to consider all (P,R,Pi)-chains<BR>For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.<BR><BR><pre>&#8627 Prolog</pre><pre>  &#8627 PrologToPiTRSProof</pre><pre>    &#8627 PiTRS</pre><pre>      &#8627 DependencyPairsProof</pre><pre>        &#8627 PiDP</pre><pre>          &#8627 DependencyGraphProof</pre><pre>            &#8627 PiDP</pre><pre>              &#8627 UsableRulesProof</pre><pre>                &#8627 <B>PiDP</B></pre><pre>                  &#8627 PiDPToQDPProof</pre><BR>Pi DP problem:<BR>The TRS P consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Y</font>), <FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>X</font>, <FONT COLOR=#cc0000>Y</font>, <FONT COLOR=#cc0000>Z</font>)</BLOCKQUOTE><BR>R is empty.<BR>The argument filtering Pi contains the following mapping:<BR><FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)&#160; = &#160;<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>x1</font>)<BR>
<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x1</font>, <FONT COLOR=#cc0000>x2</font>, <FONT COLOR=#cc0000>x3</font>)&#160; = &#160;<FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>x3</font>)<BR>
<BR>We have to consider all (P,R,Pi)-chains<BR>Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.<BR><BR><pre>&#8627 Prolog</pre><pre>  &#8627 PrologToPiTRSProof</pre><pre>    &#8627 PiTRS</pre><pre>      &#8627 DependencyPairsProof</pre><pre>        &#8627 PiDP</pre><pre>          &#8627 DependencyGraphProof</pre><pre>            &#8627 PiDP</pre><pre>              &#8627 UsableRulesProof</pre><pre>                &#8627 PiDP</pre><pre>                  &#8627 PiDPToQDPProof</pre><pre>                    &#8627 <B>QDP</B></pre><pre>                      &#8627 QDPSizeChangeProof</pre><BR>Q DP problem:<BR>The TRS P consists of the following rules:<BR><BLOCKQUOTE><BR><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>Z</font>)</BLOCKQUOTE><BR>R is empty.<BR>Q is empty.<BR>We have to consider all (P,Q,R)-chains.<BR>By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. <P>From the DPs we obtained the following set of size-change graphs:
<UL><LI><FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#0000cc>s</font>(<FONT COLOR=#cc0000>Z</font>)) &#8594; <FONT COLOR=#0000cc>SUM_IN_AAG</font>(<FONT COLOR=#cc0000>Z</font>)<BR>The graph contains the following edges 1 > 1<P></LI></UL><BR><BR></body>

