Termination-Portal.org - User contributions [en]

Complexity:Rules

2011-03-01T15:13:59Z

Zini: /* Problem Sets and Problem Selection */

The purpose of this page is to provide a place for ongoing discussions
on the rules, and to describe the current rules itself.

== Discussion ==
=== Lower Bounds ===
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.

(JW: I don't like the looks of an answer starting "YES" and indicating non-termination. See "BOUNDS" proposal below.)

(GM: I don't see a problem with that: "YES" indicates that the prover has found a proof. In the case you mention, a proof for non-termination.)

=== Scoring (proposals) ===
* as for the upper bound the lower bound certificate should be ranked and both ranks could be compared lexicographically (with the upper bound as the primary criterion)

* JW prefers: don't define some artificial total order on the bounds. The natural partial ordering is given by the inclusion relation on the sets of functions that are described by the bounds. This inclusion can be computed from
<PRE>
(low1, up1) "is better than" (low2, up2) iff low1 >= low2 and up1 <= up2
</PRE>Then for each problem, answer A gets awarded k points if A is strictly better than k of the answers, where "no answer" counts as BOUNDS(LIN,INF), and "strictly better = better and not equal".
This would imply that if all answers are identical, then no-one gets a point.
Perhaps we want to add one virtual prover that always says"BOUNDS(LIN,INF)" -
so anyone who gives a better answer, gets at least one point.

* GM: For clarification: I suppose you want to use the following order: POLY >= O(n^7) >= O(n^6) etc. to name an example. And I would insist
on the use of a virtual prover: getting 0 points although an answer has been given I don't like

=== Concrete syntax ===
* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

* JW: I'm not giving up ... one more reason against the O(n^k) syntax: 3. it cannot be used for lower bounds, as we would need Omega instead of Oh. (The other two reasons are: 2. needlessly complicated, and 1. n is an undefined variable)

* proposal to replace YES/NO/MAYBE by BOUNDS: http://dev.aspsimon.org/bugzilla/show_bug.cgi?id=85#c4

LN: I'd like to support this notation. But I think "?" for an unknown bound is unnecessary. It can always be replaced by POLY(0) for the lower
bound and INF for the upper bound. [[User:Noschinski|Noschinski]] 13:26, 13 February 2010 (UTC)

* GM: I don't like the format "POLY(k)" mainly due to presentation reasons: Our first format used exactly this and in presentations I immediately got the question
what "POLY(k)" should mean. Since "O(k)" is used I don't get this question. With respect to the lower-bound: I agree that "O(k)" should be replaced by
"Omega(k)". So let's do that. But I don't see a chance to change this for the upcoming competition ...

== Rules of the Competition ==
=== Input Format ===
Problems are given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification]. where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based respectively.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

=== Scoring ===
Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

=== Problem Sets and Problem Selection ===
==== Testbeds ====

All authors of complexity tools that participated in the last
complexity competition agreed upon
the following selection of examples from the TPDB. For simplicity,
we decided on
using the same testbed for full and innermost rewriting. However, we
decided on
two separate testbeds for derivational and runtime complexity
analysis. The testbeds
are described below in detail, additionally a list of
problems for TPDB version 8.0 is provided for [[File:RC-8.0.txt|RC]] and [[File:DC-8.0.txt|DC]]. For the
individual
subcategories RC, RCi, DC and DCi all strategy and start-term
annotations should be overwritten
appropriately. Thus we simply ignore for instance
context-sensitive strategies.

===== Derivational Complexity =====
For derivational complexity analysis we restrict the TPDB as follows:
# keep only one instance of duplicated problems (modulo strategy annotations). A list of the TRSs that appear multiple times in the current TPDB version 8.0 can be found [[File:duplicates-8.0.txt|here]].
# remove all problems with relative, theory or conditional annotations. The reason for this is that none of the tools can handle those problems currently.

===== Runtime Complexity =====
For runtime complexity analysis, we further restrict the testbed for derivational complexity analysis as follows:
# remove all examples as determined by the tool Oops that participated in the competition of 2010. A list of these examples for TPDB version 8.0 can be found [[File:Oops-8.0.txt|here]]. This step aims at eliminating trivial problems that
## admit only 0-ary constructors, or
## admit only 0-ary defined function symbols, or
## admit only rules with nested defined function symbols on left-hand sides, thus all basic terms are normal forms.
# remove higher-order examples from following folder, as here the notion of runtime complexity is inapropriate:
## AotoYamada_05,
## Applicative_05,
## Applicative_AG01_innermost,
## Applicative_first_order_05, and
## Mixed_HO_10.

==== Selection function ====
On the above described testbeds, a randomly chosen subset that is actually used in the competition is determined as follows.
Here we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6''. That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

File:Oops-8.0.txt

2011-03-01T15:13:42Z

Zini: Yes-instances of Oops on TPDB 8.0

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex5_7_Luc97_iGM.xml

TRS/Transformed_CSR_innermost_04/ExConc_Zan97_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_GM03_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_Luc02b_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex9_BLR02_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex5_DLMMU04_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex25_Luc06_L.xml

TRS/Transformed_CSR_innermost_04/Ex3_2_Luc97_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex16_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex23_Luc06_L.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_2_Luc02c_iGM.xml

TRS/Transformed_CSR_innermost_04/ExSec4_2_DLMMU04_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_7_15_Bor03_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex25_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_GL02a_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex9_Luc04_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_7_77_Bor03_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex6_GM04_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex9_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex49_GM04_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex3_3_25_Bor03_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex6_Luc98_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex7_BLR02_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_nosorts_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex2_Luc03b_iGM.xml

TRS/Transformed_CSR_innermost_04/ExConc_Zan97_L.xml

TRS/Transformed_CSR_innermost_04/Ex23_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_nosorts_iGM.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_DLMMU04_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_7_37_Bor03_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex8_BLR02_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_Zan97_iGM.xml

TRS/Transformed_CSR_innermost_04/ExSec11_1_Luc02a_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex18_Luc06_L.xml

TRS/Transformed_CSR_innermost_04/Ex1_2_AEL03_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_7_56_Bor03_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex18_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_Zan97_iGM.xml

TRS/Transformed_CSR_innermost_04/ExAppendixB_AEL03_iGM.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex24_GM04_iGM.xml

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex3_12_Luc96a_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_GM99_iGM.xml

TRS/Transformed_CSR_innermost_04/ExIntrod_GM04_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_nokinds_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/LISTUTILITIES_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex15_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex14_AEGL02_iGM.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex26_Luc03b_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex24_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex2_Luc02a_iGM.xml

TRS/Transformed_CSR_innermost_04/ExIntrod_GM99_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex15_Luc98_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex5_Zan97_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex4_4_Luc96b_iGM.xml

TRS/Transformed_CSR_innermost_04/OvConsOS_nosorts_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex14_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/PEANO_nosorts_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/ExIntrod_GM01_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex6_15_AEL02_iGM.xml

TRS/Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_complete_iGM.xml

TRS/Transformed_CSR_innermost_04/ExIntrod_Zan97_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_complete_noand_iGM.xml

TRS/Transformed_CSR_innermost_04/ExProp7_Luc06_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex1_Luc04b_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/Ex6_9_Luc02c_iGM.xml

TRS/Transformed_CSR_innermost_04/MYNAT_nokinds_iGM.xml

TRS/Transformed_CSR_innermost_04/PALINDROME_nosorts_iGM.xml

TRS/ICFP_2010/96612.xml

TRS/ICFP_2010/167087.xml

TRS/ICFP_2010/3939.xml

TRS/ICFP_2010/132957.xml

TRS/ICFP_2010/4002.xml

TRS/ICFP_2010/26127.xml

TRS/ICFP_2010/4847.xml

TRS/ICFP_2010/130304.xml

TRS/ICFP_2010/4979.xml

TRS/ICFP_2010/3989.xml

TRS/ICFP_2010/135601.xml

TRS/ICFP_2010/137799.xml

TRS/ICFP_2010/48686.xml

TRS/ICFP_2010/157466.xml

TRS/ICFP_2010/26951.xml

TRS/ICFP_2010/161930.xml

TRS/ICFP_2010/96119.xml

TRS/ICFP_2010/139018.xml

TRS/ICFP_2010/264033.xml

TRS/ICFP_2010/212308.xml

TRS/ICFP_2010/51842.xml

TRS/ICFP_2010/135505.xml

TRS/ICFP_2010/167294.xml

TRS/ICFP_2010/259405.xml

TRS/ICFP_2010/137715.xml

TRS/ICFP_2010/4029.xml

TRS/ICFP_2010/188696.xml

TRS/ICFP_2010/26110.xml

TRS/ICFP_2010/139185.xml

TRS/ICFP_2010/212062.xml

TRS/ICFP_2010/26910.xml

TRS/ICFP_2010/158208.xml

TRS/ICFP_2010/91218.xml

TRS/ICFP_2010/95952.xml

TRS/ICFP_2010/43621.xml

TRS/ICFP_2010/57132.xml

TRS/ICFP_2010/137136.xml

TRS/ICFP_2010/4200.xml

TRS/ICFP_2010/3770.xml

TRS/ICFP_2010/86745.xml

TRS/ICFP_2010/96156.xml

TRS/ICFP_2010/25775.xml

TRS/ICFP_2010/149849.xml

TRS/ICFP_2010/140287.xml

TRS/ICFP_2010/86025.xml

TRS/ICFP_2010/183803.xml

TRS/ICFP_2010/150815.xml

TRS/ICFP_2010/26954.xml

TRS/ICFP_2010/26978.xml

TRS/ICFP_2010/3705.xml

TRS/ICFP_2010/186023.xml

TRS/ICFP_2010/65081.xml

TRS/ICFP_2010/188238.xml

TRS/ICFP_2010/212043.xml

TRS/ICFP_2010/27028.xml

TRS/ICFP_2010/5011.xml

TRS/ICFP_2010/186333.xml

TRS/ICFP_2010/41843.xml

TRS/ICFP_2010/212026.xml

TRS/ICFP_2010/27026.xml

TRS/ICFP_2010/96104.xml

TRS/ICFP_2010/213537.xml

TRS/ICFP_2010/91254.xml

TRS/ICFP_2010/88283.xml

TRS/ICFP_2010/41838.xml

TRS/ICFP_2010/139167.xml

TRS/ICFP_2010/140664.xml

TRS/ICFP_2010/150839.xml

TRS/ICFP_2010/160398.xml

TRS/ICFP_2010/91242.xml

TRS/ICFP_2010/128691.xml

TRS/ICFP_2010/128486.xml

TRS/ICFP_2010/42466.xml

TRS/ICFP_2010/97885.xml

TRS/ICFP_2010/166001.xml

TRS/ICFP_2010/26916.xml

TRS/ICFP_2010/132611.xml

TRS/ICFP_2010/68535.xml

TRS/ICFP_2010/26903.xml

TRS/ICFP_2010/27034.xml

TRS/ICFP_2010/147437.xml

TRS/ICFP_2010/213407.xml

TRS/ICFP_2010/3842.xml

TRS/ICFP_2010/133432.xml

TRS/ICFP_2010/85477.xml

TRS/ICFP_2010/214169.xml

TRS/ICFP_2010/133532.xml

TRS/ICFP_2010/165755.xml

TRS/ICFP_2010/138330.xml

TRS/ICFP_2010/167452.xml

TRS/ICFP_2010/158477.xml

TRS/ICFP_2010/4074.xml

TRS/ICFP_2010/88143.xml

TRS/ICFP_2010/157436.xml

TRS/ICFP_2010/4106.xml

TRS/ICFP_2010/150188.xml

TRS/ICFP_2010/26965.xml

TRS/ICFP_2010/41865.xml

TRS/ICFP_2010/26974.xml

TRS/ICFP_2010/45970.xml

TRS/ICFP_2010/160068.xml

TRS/ICFP_2010/151247.xml

TRS/ICFP_2010/128620.xml

TRS/ICFP_2010/186919.xml

TRS/ICFP_2010/4964.xml

TRS/ICFP_2010/85749.xml

TRS/ICFP_2010/4141.xml

TRS/ICFP_2010/57278.xml

TRS/ICFP_2010/132720.xml

TRS/ICFP_2010/167433.xml

TRS/ICFP_2010/160427.xml

TRS/ICFP_2010/4938.xml

TRS/ICFP_2010/86052.xml

TRS/ICFP_2010/26940.xml

TRS/ICFP_2010/139100.xml

TRS/ICFP_2010/29415.xml

TRS/ICFP_2010/85294.xml

TRS/ICFP_2010/135652.xml

TRS/ICFP_2010/254704.xml

TRS/ICFP_2010/136571.xml

TRS/ICFP_2010/3467.xml

TRS/ICFP_2010/139256.xml

TRS/ICFP_2010/158620.xml

TRS/ICFP_2010/27036.xml

TRS/ICFP_2010/3930.xml

TRS/ICFP_2010/182946.xml

TRS/ICFP_2010/212892.xml

TRS/ICFP_2010/85920.xml

TRS/ICFP_2010/96642.xml

TRS/ICFP_2010/107193.xml

TRS/ICFP_2010/96485.xml

TRS/ICFP_2010/133010.xml

TRS/ICFP_2010/4920.xml

TRS/ICFP_2010/40033.xml

TRS/ICFP_2010/211915.xml

TRS/ICFP_2010/25849.xml

TRS/ICFP_2010/96176.xml

TRS/ICFP_2010/153243.xml

TRS/ICFP_2010/4991.xml

TRS/ICFP_2010/142142.xml

TRS/ICFP_2010/153034.xml

TRS/ICFP_2010/51424.xml

TRS/ICFP_2010/96563.xml

TRS/ICFP_2010/25734.xml

TRS/ICFP_2010/137087.xml

TRS/ICFP_2010/132969.xml

TRS/ICFP_2010/68322.xml

TRS/ICFP_2010/132738.xml

TRS/ICFP_2010/167041.xml

TRS/ICFP_2010/58221.xml

TRS/ICFP_2010/88208.xml

TRS/ICFP_2010/213218.xml

TRS/ICFP_2010/139025.xml

TRS/ICFP_2010/41688.xml

TRS/ICFP_2010/149361.xml

TRS/ICFP_2010/27009.xml

TRS/ICFP_2010/187254.xml

TRS/ICFP_2010/85345.xml

TRS/ICFP_2010/27019.xml

TRS/ICFP_2010/58125.xml

TRS/ICFP_2010/41378.xml

TRS/ICFP_2010/25808.xml

TRS/ICFP_2010/107236.xml

TRS/ICFP_2010/26976.xml

TRS/ICFP_2010/96198.xml

TRS/ICFP_2010/96302.xml

TRS/ICFP_2010/136354.xml

TRS/ICFP_2010/4827.xml

TRS/ICFP_2010/25422.xml

TRS/ICFP_2010/157275.xml

TRS/ICFP_2010/133079.xml

TRS/ICFP_2010/140318.xml

TRS/ICFP_2010/142146.xml

TRS/ICFP_2010/153371.xml

TRS/ICFP_2010/140359.xml

TRS/ICFP_2010/4314.xml

TRS/ICFP_2010/96464.xml

TRS/ICFP_2010/88172.xml

TRS/ICFP_2010/64160.xml

TRS/ICFP_2010/50904.xml

TRS/ICFP_2010/157593.xml

TRS/ICFP_2010/4374.xml

TRS/ICFP_2010/84977.xml

TRS/ICFP_2010/51577.xml

TRS/ICFP_2010/85650.xml

TRS/ICFP_2010/48328.xml

TRS/ICFP_2010/4819.xml

TRS/ICFP_2010/3817.xml

TRS/ICFP_2010/97917.xml

TRS/ICFP_2010/26980.xml

TRS/ICFP_2010/4017.xml

TRS/ICFP_2010/3861.xml

TRS/ICFP_2010/167310.xml

TRS/ICFP_2010/212263.xml

TRS/ICFP_2010/3336.xml

TRS/ICFP_2010/160364.xml

TRS/ICFP_2010/26896.xml

TRS/ICFP_2010/4953.xml

TRS/ICFP_2010/150258.xml

TRS/ICFP_2010/3498.xml

TRS/ICFP_2010/98623.xml

TRS/ICFP_2010/188674.xml

TRS/ICFP_2010/132540.xml

TRS/ICFP_2010/167636.xml

TRS/ICFP_2010/140639.xml

TRS/ICFP_2010/26105.xml

TRS/ICFP_2010/43987.xml

TRS/ICFP_2010/139004.xml

TRS/ICFP_2010/162244.xml

TRS/ICFP_2010/138993.xml

TRS/ICFP_2010/149319.xml

TRS/ICFP_2010/149713.xml

TRS/ICFP_2010/39830.xml

TRS/ICFP_2010/160210.xml

TRS/ICFP_2010/167742.xml

TRS/ICFP_2010/139174.xml

TRS/ICFP_2010/161533.xml

TRS/ICFP_2010/26875.xml

TRS/ICFP_2010/136623.xml

TRS/ICFP_2010/139036.xml

TRS/ICFP_2010/3856.xml

TRS/ICFP_2010/137956.xml

TRS/ICFP_2010/3680.xml

TRS/ICFP_2010/133236.xml

TRS/ICFP_2010/26116.xml

TRS/ICFP_2010/95899.xml

TRS/ICFP_2010/135410.xml

TRS/ICFP_2010/138254.xml

TRS/ICFP_2010/160324.xml

TRS/ICFP_2010/186810.xml

TRS/ICFP_2010/42321.xml

TRS/ICFP_2010/4248.xml

TRS/ICFP_2010/157161.xml

TRS/ICFP_2010/158342.xml

TRS/ICFP_2010/40976.xml

TRS/ICFP_2010/135659.xml

TRS/ICFP_2010/84886.xml

TRS/ICFP_2010/26933.xml

TRS/ICFP_2010/91210.xml

TRS/ICFP_2010/25416.xml

TRS/ICFP_2010/26946.xml

TRS/ICFP_2010/25409.xml

TRS/ICFP_2010/167391.xml

TRS/ICFP_2010/128515.xml

TRS/ICFP_2010/96417.xml

TRS/ICFP_2010/132235.xml

TRS/ICFP_2010/26741.xml

TRS/ICFP_2010/27006.xml

TRS/ICFP_2010/166558.xml

TRS/ICFP_2010/26993.xml

TRS/ICFP_2010/138142.xml

TRS/ICFP_2010/124211.xml

TRS/ICFP_2010/132864.xml

TRS/ICFP_2010/4816.xml

TRS/ICFP_2010/259625.xml

TRS/ICFP_2010/139236.xml

TRS/ICFP_2010/213865.xml

TRS/ICFP_2010/26927.xml

TRS/ICFP_2010/135936.xml

TRS/ICFP_2010/42170.xml

TRS/ICFP_2010/86857.xml

TRS/ICFP_2010/3927.xml

TRS/ICFP_2010/26986.xml

TRS/ICFP_2010/25388.xml

TRS/ICFP_2010/212189.xml

TRS/ICFP_2010/160660.xml

TRS/ICFP_2010/3633.xml

TRS/ICFP_2010/185453.xml

TRS/ICFP_2010/149915.xml

TRS/ICFP_2010/139190.xml

TRS/ICFP_2010/26871.xml

TRS/ICFP_2010/4934.xml

TRS/ICFP_2010/26998.xml

TRS/ICFP_2010/186617.xml

TRS/ICFP_2010/4057.xml

TRS/ICFP_2010/160234.xml

TRS/ICFP_2010/26931.xml

TRS/ICFP_2010/136280.xml

TRS/ICFP_2010/136323.xml

TRS/ICFP_2010/96029.xml

TRS/ICFP_2010/213147.xml

TRS/ICFP_2010/5109.xml

TRS/ICFP_2010/180915.xml

TRS/ICFP_2010/54097.xml

TRS/ICFP_2010/96256.xml

TRS/ICFP_2010/96403.xml

TRS/ICFP_2010/159731.xml

TRS/ICFP_2010/3865.xml

TRS/ICFP_2010/138089.xml

TRS/ICFP_2010/136562.xml

TRS/ICFP_2010/4840.xml

TRS/ICFP_2010/96334.xml

TRS/ICFP_2010/161519.xml

TRS/ICFP_2010/211978.xml

TRS/ICFP_2010/136497.xml

TRS/ICFP_2010/95978.xml

TRS/ICFP_2010/167526.xml

TRS/ICFP_2010/139180.xml

TRS/ICFP_2010/4854.xml

TRS/ICFP_2010/25726.xml

TRS/ICFP_2010/157713.xml

TRS/ICFP_2010/85380.xml

TRS/ICFP_2010/124791.xml

TRS/ICFP_2010/86499.xml

TRS/ICFP_2010/137316.xml

TRS/ICFP_2010/130472.xml

TRS/ICFP_2010/212774.xml

TRS/ICFP_2010/137404.xml

TRS/ICFP_2010/39849.xml

TRS/ICFP_2010/27015.xml

TRS/ICFP_2010/188296.xml

TRS/ICFP_2010/86617.xml

TRS/ICFP_2010/88156.xml

TRS/ICFP_2010/26862.xml

TRS/ICFP_2010/153288.xml

TRS/ICFP_2010/26845.xml

TRS/ICFP_2010/26949.xml

TRS/ICFP_2010/131633.xml

TRS/ICFP_2010/3762.xml

TRS/ICFP_2010/188261.xml

TRS/ICFP_2010/160462.xml

TRS/ICFP_2010/160254.xml

TRS/ICFP_2010/57453.xml

TRS/ICFP_2010/26923.xml

TRS/ICFP_2010/135328.xml

TRS/ICFP_2010/85675.xml

TRS/ICFP_2010/4487.xml

TRS/ICFP_2010/153170.xml

TRS/ICFP_2010/184957.xml

TRS/ICFP_2010/26969.xml

TRS/ICFP_2010/96370.xml

TRS/ICFP_2010/139282.xml

TRS/ICFP_2010/85834.xml

TRS/ICFP_2010/4943.xml

TRS/ICFP_2010/142157.xml

TRS/ICFP_2010/213719.xml

TRS/ICFP_2010/165713.xml

TRS/ICFP_2010/137623.xml

TRS/ICFP_2010/152949.xml

TRS/ICFP_2010/86559.xml

TRS/ICFP_2010/86816.xml

TRS/ICFP_2010/27003.xml

TRS/ICFP_2010/44332.xml

TRS/ICFP_2010/86526.xml

TRS/ICFP_2010/140654.xml

TRS/ICFP_2010/85874.xml

TRS/ICFP_2010/3831.xml

TRS/ICFP_2010/85782.xml

TRS/ICFP_2010/128280.xml

TRS/ICFP_2010/148543.xml

TRS/ICFP_2010/214320.xml

TRS/ICFP_2010/57852.xml

TRS/ICFP_2010/96086.xml

TRS/ICFP_2010/214261.xml

TRS/ICFP_2010/142150.xml

TRS/ICFP_2010/166465.xml

TRS/ICFP_2010/162095.xml

TRS/ICFP_2010/26919.xml

TRS/ICFP_2010/96065.xml

TRS/ICFP_2010/107220.xml

TRS/ICFP_2010/4412.xml

TRS/ICFP_2010/134918.xml

TRS/ICFP_2010/3786.xml

TRS/ICFP_2010/152786.xml

TRS/ICFP_2010/167240.xml

TRS/ICFP_2010/128430.xml

TRS/ICFP_2010/25711.xml

TRS/ICFP_2010/130962.xml

TRS/ICFP_2010/86452.xml

TRS/ICFP_2010/139163.xml

TRS/ICFP_2010/5130.xml

TRS/ICFP_2010/138468.xml

TRS/ICFP_2010/3533.xml

TRS/ICFP_2010/26943.xml

TRS/ICFP_2010/24100.xml

TRS/ICFP_2010/3589.xml

TRS/ICFP_2010/56144.xml

TRS/ICFP_2010/4824.xml

TRS/ICFP_2010/4046.xml

TRS/ICFP_2010/85590.xml

TRS/ICFP_2010/127538.xml

TRS/ICFP_2010/131982.xml

TRS/ICFP_2010/3450.xml

TRS/ICFP_2010/3385.xml

TRS/ICFP_2010/149297.xml

TRS/ICFP_2010/137621.xml

TRS/ICFP_2010/27013.xml

TRS/ICFP_2010/149633.xml

TRS/ICFP_2010/133827.xml

TRS/ICFP_2010/161593.xml

TRS/ICFP_2010/132848.xml

TRS/ICFP_2010/123759.xml

TRS/ICFP_2010/85267.xml

TRS/ICFP_2010/139214.xml

TRS/ICFP_2010/149251.xml

TRS/ICFP_2010/212037.xml

TRS/ICFP_2010/133159.xml

TRS/ICFP_2010/3729.xml

TRS/ICFP_2010/4036.xml

TRS/ICFP_2010/140631.xml

TRS/ICFP_2010/4206.xml

TRS/ICFP_2010/153090.xml

TRS/ICFP_2010/138477.xml

TRS/ICFP_2010/161917.xml

TRS/ICFP_2010/3995.xml

TRS/ICFP_2010/136051.xml

TRS/ICFP_2010/26879.xml

TRS/ICFP_2010/43650.xml

TRS/ICFP_2010/135604.xml

TRS/ICFP_2010/88183.xml

TRS/ICFP_2010/136693.xml

TRS/ICFP_2010/91233.xml

TRS/ICFP_2010/150725.xml

TRS/ICFP_2010/86636.xml

TRS/ICFP_2010/137809.xml

TRS/ICFP_2010/135115.xml

TRS/ICFP_2010/128056.xml

TRS/ICFP_2010/3268.xml

TRS/ICFP_2010/212364.xml

TRS/ICFP_2010/139310.xml

TRS/ICFP_2010/3916.xml

TRS/ICFP_2010/25736.xml

TRS/ICFP_2010/3562.xml

TRS/ICFP_2010/135782.xml

TRS/ICFP_2010/5076.xml

TRS/ICFP_2010/152694.xml

TRS/ICFP_2010/133881.xml

TRS/ICFP_2010/162075.xml

TRS/ICFP_2010/149277.xml

TRS/ICFP_2010/186222.xml

TRS/ICFP_2010/43603.xml

TRS/ICFP_2010/4051.xml

TRS/ICFP_2010/166493.xml

TRS/ICFP_2010/133486.xml

TRS/ICFP_2010/4157.xml

TRS/ICFP_2010/149415.xml

TRS/ICFP_2010/136463.xml

TRS/ICFP_2010/152865.xml

TRS/ICFP_2010/136601.xml

TRS/ICFP_2010/96673.xml

TRS/ICFP_2010/212534.xml

TRS/ICFP_2010/26972.xml

TRS/ICFP_2010/124269.xml

TRS/ICFP_2010/26882.xml

TRS/ICFP_2010/48374.xml

TRS/ICFP_2010/138194.xml

TRS/ICFP_2010/97901.xml

TRS/ICFP_2010/130161.xml

TRS/ICFP_2010/188004.xml

TRS/ICFP_2010/214183.xml

TRS/ICFP_2010/25743.xml

TRS/ICFP_2010/4181.xml

TRS/ICFP_2010/150067.xml

TRS/ICFP_2010/150468.xml

TRS/ICFP_2010/26132.xml

TRS/ICFP_2010/25395.xml

TRS/ICFP_2010/96224.xml

TRS/ICFP_2010/43266.xml

TRS/ICFP_2010/85079.xml

TRS/ICFP_2010/85721.xml

TRS/ICFP_2010/57799.xml

TRS/ICFP_2010/26957.xml

TRS/ICFP_2010/4893.xml

TRS/ICFP_2010/157150.xml

TRS/ICFP_2010/53216.xml

TRS/ICFP_2010/98362.xml

TRS/ICFP_2010/96274.xml

TRS/ICFP_2010/4970.xml

TRS/ICFP_2010/96239.xml

TRS/ICFP_2010/213051.xml

TRS/ICFP_2010/96289.xml

TRS/ICFP_2010/157603.xml

TRS/ICFP_2010/96523.xml

TRS/ICFP_2010/139378.xml

TRS/ICFP_2010/165975.xml

TRS/ICFP_2010/85039.xml

TRS/ICFP_2010/166848.xml

TRS/ICFP_2010/160475.xml

TRS/ICFP_2010/40540.xml

TRS/ICFP_2010/140659.xml

TRS/ICFP_2010/128182.xml

TRS/ICFP_2010/63142.xml

TRS/ICFP_2010/97929.xml

TRS/ICFP_2010/185628.xml

TRS/ICFP_2010/187837.xml

TRS/ICFP_2010/135714.xml

TRS/ICFP_2010/128550.xml

TRS/ICFP_2010/165904.xml

TRS/ICFP_2010/132622.xml

TRS/ICFP_2010/4282.xml

TRS/ICFP_2010/81452.xml

TRS/ICFP_2010/136934.xml

TRS/ICFP_2010/3746.xml

TRS/ICFP_2010/42683.xml

TRS/ICFP_2010/132782.xml

TRS/ICFP_2010/186973.xml

TRS/ICFP_2010/4484.xml

TRS/ICFP_2010/27001.xml

TRS/ICFP_2010/263745.xml

TRS/ICFP_2010/262998.xml

TRS/ICFP_2010/136534.xml

TRS/ICFP_2010/68989.xml

TRS/ICFP_2010/48267.xml

TRS/ICFP_2010/86577.xml

TRS/ICFP_2010/150877.xml

TRS/ICFP_2010/95858.xml

TRS/ICFP_2010/132833.xml

TRS/ICFP_2010/186775.xml

TRS/ICFP_2010/97888.xml

TRS/ICFP_2010/161864.xml

TRS/ICFP_2010/27039.xml

TRS/ICFP_2010/150630.xml

TRS/ICFP_2010/212795.xml

TRS/ICFP_2010/162016.xml

TRS/ICFP_2010/41427.xml

TRS/ICFP_2010/96438.xml

TRS/ICFP_2010/27023.xml

TRS/ICFP_2010/132920.xml

TRS/ICFP_2010/138269.xml

TRS/ICFP_2010/153444.xml

TRS/ICFP_2010/165936.xml

TRS/ICFP_2010/132478.xml

TRS/ICFP_2010/26886.xml

TRS/ICFP_2010/26960.xml

TRS/Mixed_TRS/5.xml

TRS/Mixed_TRS/7.xml

TRS/Mixed_TRS/beans.xml

TRS/Mixed_TRS/1.xml

TRS/Mixed_TRS/3.xml

TRS/Mixed_TRS/while2.xml

TRS/Mixed_TRS/6.xml

TRS/Mixed_TRS/2.xml

TRS/Mixed_TRS/4.xml

TRS/Mixed_TRS/motivation.xml

TRS/Strategy_removed_AG01/#4.3.xml

TRS/Strategy_removed_AG01/#4.4.xml

TRS/Strategy_removed_AG01/#4.20.xml

TRS/Strategy_removed_AG01/#4.13.xml

TRS/Strategy_removed_AG01/#4.21.xml

TRS/Strategy_removed_AG01/#4.12a.xml

TRS/Strategy_removed_AG01/#4.15.xml

TRS/Strategy_removed_AG01/#4.18.xml

TRS/AotoYamada_05/004.xml

TRS/AotoYamada_05/025.xml

TRS/AotoYamada_05/001.xml

TRS/AotoYamada_05/024.xml

TRS/AotoYamada_05/014.xml

TRS/AotoYamada_05/019.xml

TRS/AotoYamada_05/Ex5TermProof.xml

TRS/AotoYamada_05/027.xml

TRS/AotoYamada_05/010.xml

TRS/AotoYamada_05/022.xml

TRS/AotoYamada_05/Ex1SimplyTyped.xml

TRS/AotoYamada_05/028.xml

TRS/AotoYamada_05/006.xml

TRS/AotoYamada_05/009.xml

TRS/AotoYamada_05/002.xml

TRS/AotoYamada_05/012.xml

TRS/AotoYamada_05/007.xml

TRS/AotoYamada_05/023.xml

TRS/AotoYamada_05/021.xml

TRS/AotoYamada_05/015.xml

TRS/AotoYamada_05/003.xml

TRS/AotoYamada_05/020.xml

TRS/AotoYamada_05/011.xml

TRS/AotoYamada_05/017.xml

TRS/AotoYamada_05/013.xml

TRS/AotoYamada_05/005.xml

TRS/AotoYamada_05/016.xml

TRS/AotoYamada_05/026.xml

TRS/AG01/#3.21.xml

TRS/AG01_innermost/#4.3.xml

TRS/AG01_innermost/#4.4.xml

TRS/AG01_innermost/#4.20.xml

TRS/AG01_innermost/#4.13.xml

TRS/AG01_innermost/#4.21.xml

TRS/AG01_innermost/#4.12a.xml

TRS/AG01_innermost/#4.5.xml

TRS/AG01_innermost/#4.15.xml

TRS/AG01_innermost/#4.18.xml

TRS/Strategy_removed_CSR_05/Ex24_GM04.xml

TRS/Strategy_removed_CSR_05/Ex1_GM99.xml

TRS/HirokawaMiddeldorp_04/t007.xml

TRS/HirokawaMiddeldorp_04/t008.xml

TRS/HirokawaMiddeldorp_04/t000.xml

TRS/HirokawaMiddeldorp_04/t005.xml

TRS/HirokawaMiddeldorp_04/n008.xml

TRS/HirokawaMiddeldorp_04/t010.xml

TRS/HirokawaMiddeldorp_04/t006.xml

TRS/Waldmann_06/jwno3.xml

TRS/Waldmann_06/jwteparla2.xml

TRS/Waldmann_06/jwcime1.xml

TRS/Waldmann_06/jwno7.xml

TRS/Waldmann_06/jwteparla1.xml

TRS/Waldmann_06/jwno5.xml

TRS/Waldmann_06/jwtpa2.xml

TRS/Waldmann_06/jwno8.xml

TRS/Waldmann_06/jwcime2.xml

TRS/Waldmann_06/jwno2.xml

TRS/Waldmann_06/jwaprove1.xml

TRS/Waldmann_06/jwno9.xml

TRS/Waldmann_06/jwttt.xml

TRS/Waldmann_06/jwaprove2.xml

TRS/Waldmann_06/jwtpa1.xml

TRS/Bouchare_06/10.xml

TRS/Bouchare_06/17.xml

TRS/Bouchare_06/04.xml

TRS/Bouchare_06/16.xml

TRS/Bouchare_06/08.xml

TRS/Bouchare_06/11.xml

TRS/Bouchare_06/03.xml

TRS/Bouchare_06/14.xml

TRS/Bouchare_06/13.xml

TRS/Bouchare_06/09.xml

TRS/Bouchare_06/15.xml

TRS/Bouchare_06/18.xml

TRS/Bouchare_06/02.xml

TRS/Bouchare_06/07.xml

TRS/Bouchare_06/06.xml

TRS/Bouchare_06/01.xml

TRS/Bouchare_06/05.xml

TRS/Secret_07_TRS/5.xml

TRS/Secret_07_TRS/7.xml

TRS/Secret_07_TRS/1.xml

TRS/Secret_07_TRS/2.xml

TRS/Secret_07_TRS/4.xml

TRS/Secret_07_TRS/secret2.xml

TRS/MNZ_10/8.xml

TRS/MNZ_10/nvsr.xml

TRS/MNZ_10/5.xml

TRS/MNZ_10/7.xml

TRS/MNZ_10/0.xml

TRS/MNZ_10/1.xml

TRS/MNZ_10/3.xml

TRS/MNZ_10/6.xml

TRS/MNZ_10/2.xml

TRS/MNZ_10/4.xml

TRS/MNZ_10/9.xml

TRS/CiME_04/boolean_rings.xml

TRS/Applicative_AG01_innermost/#4.3.xml

TRS/Applicative_AG01_innermost/#4.7.xml

TRS/Applicative_AG01_innermost/#4.2.xml

TRS/Applicative_AG01_innermost/#4.8.xml

TRS/Applicative_AG01_innermost/#4.13.xml

TRS/Applicative_AG01_innermost/#4.26.xml

TRS/Applicative_AG01_innermost/#4.22.xml

TRS/Applicative_AG01_innermost/#4.19.xml

TRS/Applicative_AG01_innermost/#4.36.xml

TRS/Applicative_AG01_innermost/#4.10.xml

TRS/Applicative_AG01_innermost/#4.24.xml

TRS/Applicative_AG01_innermost/#4.17.xml

TRS/Applicative_AG01_innermost/#4.34.xml

TRS/Applicative_AG01_innermost/#4.5.xml

TRS/Applicative_AG01_innermost/#4.15.xml

TRS/Applicative_AG01_innermost/#4.28.xml

TRS/Zantema_06/17.xml

TRS/Zantema_06/16.xml

TRS/Zantema_06/11.xml

TRS/Zantema_06/12.xml

TRS/Zantema_06/14.xml

TRS/Zantema_06/beans7.xml

TRS/Zantema_06/13.xml

TRS/Zantema_06/18.xml

TRS/Zantema_06/loop2.xml

TRS/Zantema_06/beans5.xml

TRS/Zantema_06/abc.xml

TRS/Zantema_06/beans4.xml

TRS/Secret_05_SRS/aprove4.xml

TRS/Secret_05_SRS/jambox4.xml

TRS/Secret_05_SRS/jambox2.xml

TRS/Secret_05_SRS/torpa2.xml

TRS/Secret_05_SRS/matchbox1.xml

TRS/Mixed_SRS/04.xml

TRS/Mixed_SRS/08.xml

TRS/Mixed_SRS/03.xml

TRS/Mixed_SRS/03-oppelt08.xml

TRS/Mixed_SRS/09.xml

TRS/Mixed_SRS/05-oppelt08.xml

TRS/Mixed_SRS/02-oppelt08.xml

TRS/Mixed_SRS/3.xml

TRS/Mixed_SRS/02.xml

TRS/Mixed_SRS/s6.xml

TRS/Mixed_SRS/touzet.xml

TRS/Mixed_SRS/2.xml

TRS/Mixed_SRS/4.xml

TRS/Mixed_SRS/06.xml

TRS/Mixed_SRS/01.xml

TRS/Mixed_SRS/05.xml

TRS/Mixed_SRS/04-oppelt08.xml

TRS/Secret_06_TRS/gen-15.xml

TRS/Secret_06_TRS/8.xml

TRS/Secret_06_TRS/gen-25.xml

TRS/Secret_06_TRS/gen-18.xml

TRS/Secret_06_TRS/tpa01.xml

TRS/Secret_06_TRS/5.xml

TRS/Secret_06_TRS/gen-14.xml

TRS/Secret_06_TRS/gen-9.xml

TRS/Secret_06_TRS/tpa02.xml

TRS/Secret_06_TRS/7.xml

TRS/Secret_06_TRS/gen-10.xml

TRS/Secret_06_TRS/tpa03.xml

TRS/Secret_06_TRS/cime1.xml

TRS/Secret_06_TRS/3.xml

TRS/Secret_06_TRS/2.xml

TRS/Secret_06_TRS/9.xml

TRS/Secret_06_TRS/gen-22.xml

TRS/Endrullis_06/pair3hard.xml

TRS/Endrullis_06/linear1.xml

TRS/Endrullis_06/quadruple1.xml

TRS/Endrullis_06/quadruple2.xml

TRS/Endrullis_06/pair3rotate.xml

TRS/Endrullis_06/labeling.xml

TRS/Endrullis_06/linear2.xml

TRS/Endrullis_06/pair2simple2.xml

TRS/Endrullis_06/pair3swap.xml

TRS/Endrullis_06/pair2hard.xml

TRS/Endrullis_06/pair2simple1.xml

TRS/Secret_07_SRS/dj.xml

TRS/Secret_07_SRS/x07.xml

TRS/Secret_07_SRS/x09.xml

TRS/Secret_07_SRS/x08.xml

TRS/Secret_07_SRS/x06.xml

TRS/Secret_07_SRS/x04.xml

TRS/TCT_09/ackhofbauernonsimp.xml

TRS/TCT_09/z86.xml

TRS/TCT_09/ackhofbauer.xml

TRS/AProVE_07/thiemann39.xml

TRS/AProVE_07/kabasci06.xml

TRS/AProVE_07/thiemann35.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-226.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-4.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-94.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-70.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-134.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-95.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-44.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-23.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-195.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-200.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-273.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-417.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-223.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-283.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-494.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-100.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-287.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-285.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-7.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-220.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-178.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-213.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-495.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-255.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-399.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-526.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-215.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-180.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-412.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-181.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-19.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-507.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-149.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-3.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-20.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-51.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-194.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-479.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-82.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-45.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-19.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-207.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-418.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-15.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-284.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-76.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-191.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-453.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-265.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-21.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-455.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-351.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-5.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-460.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-31.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-14.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-186.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-168.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-99.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-1.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-10.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-165.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-288.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-470.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-90.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-281.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-190.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-241.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-16.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-209.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-74.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-163.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-159.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-474.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-225.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-503.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-152.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-415.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-343.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-3.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-239.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-203.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-11.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-52.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-160.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-206.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-454.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-452.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-101.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-389.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-176.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-221.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-12.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-61.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-219.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-164.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-499.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-204.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-177.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-568.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-202.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-257.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-475.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-414.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-468.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-461.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-392.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-498.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-146.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-135.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-22.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-462.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-467.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-279.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-282.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-493.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-352.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-201.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-20.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-210.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-140.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-413.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-416.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-484.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-427.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-350.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-1.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-478.xml

TRS/Gebhardt_06/10.xml

TRS/Gebhardt_06/17.xml

TRS/Gebhardt_06/04.xml

TRS/Gebhardt_06/16.xml

TRS/Gebhardt_06/08.xml

TRS/Gebhardt_06/11.xml

TRS/Gebhardt_06/19.xml

TRS/Gebhardt_06/12.xml

TRS/Gebhardt_06/03.xml

TRS/Gebhardt_06/14.xml

TRS/Gebhardt_06/13.xml

TRS/Gebhardt_06/09.xml

TRS/Gebhardt_06/15.xml

TRS/Gebhardt_06/18.xml

TRS/Gebhardt_06/20.xml

TRS/Gebhardt_06/02.xml

TRS/Gebhardt_06/07.xml

TRS/Gebhardt_06/06.xml

TRS/Gebhardt_06/01.xml

TRS/Gebhardt_06/05.xml

TRS/Strategy_removed_mixed_05/test75.xml

TRS/Strategy_removed_mixed_05/test9.xml

TRS/Strategy_removed_mixed_05/bn111.xml

TRS/Strategy_removed_mixed_05/toyama.xml

TRS/Strategy_removed_mixed_05/n001.xml

TRS/Strategy_removed_mixed_05/gkg.xml

TRS/ICFP_2010_relative/167087.xml

TRS/ICFP_2010_relative/26127.xml

TRS/ICFP_2010_relative/130304.xml

TRS/ICFP_2010_relative/135601.xml

TRS/ICFP_2010_relative/137799.xml

TRS/ICFP_2010_relative/48686.xml

TRS/ICFP_2010_relative/157466.xml

TRS/ICFP_2010_relative/26951.xml

TRS/ICFP_2010_relative/161930.xml

TRS/ICFP_2010_relative/212308.xml

TRS/ICFP_2010_relative/51842.xml

TRS/ICFP_2010_relative/135505.xml

TRS/ICFP_2010_relative/167294.xml

TRS/ICFP_2010_relative/259405.xml

TRS/ICFP_2010_relative/137715.xml

TRS/ICFP_2010_relative/188696.xml

TRS/ICFP_2010_relative/26110.xml

TRS/ICFP_2010_relative/26910.xml

TRS/ICFP_2010_relative/158208.xml

TRS/ICFP_2010_relative/91218.xml

TRS/ICFP_2010_relative/43621.xml

TRS/ICFP_2010_relative/137136.xml

TRS/ICFP_2010_relative/25775.xml

TRS/ICFP_2010_relative/149849.xml

TRS/ICFP_2010_relative/183803.xml

TRS/ICFP_2010_relative/150815.xml

TRS/ICFP_2010_relative/26954.xml

TRS/ICFP_2010_relative/26978.xml

TRS/ICFP_2010_relative/188238.xml

TRS/ICFP_2010_relative/212043.xml

TRS/ICFP_2010_relative/27028.xml

TRS/ICFP_2010_relative/186333.xml

TRS/ICFP_2010_relative/41843.xml

TRS/ICFP_2010_relative/27026.xml

TRS/ICFP_2010_relative/91254.xml

TRS/ICFP_2010_relative/88283.xml

TRS/ICFP_2010_relative/41838.xml

TRS/ICFP_2010_relative/150839.xml

TRS/ICFP_2010_relative/160398.xml

TRS/ICFP_2010_relative/42466.xml

TRS/ICFP_2010_relative/97885.xml

TRS/ICFP_2010_relative/166001.xml

TRS/ICFP_2010_relative/26916.xml

TRS/ICFP_2010_relative/26903.xml

TRS/ICFP_2010_relative/27034.xml

TRS/ICFP_2010_relative/147437.xml

TRS/ICFP_2010_relative/133432.xml

TRS/ICFP_2010_relative/133532.xml

TRS/ICFP_2010_relative/165755.xml

TRS/ICFP_2010_relative/167452.xml

TRS/ICFP_2010_relative/158477.xml

TRS/ICFP_2010_relative/150188.xml

TRS/ICFP_2010_relative/26965.xml

TRS/ICFP_2010_relative/41865.xml

TRS/ICFP_2010_relative/26974.xml

TRS/ICFP_2010_relative/45970.xml

TRS/ICFP_2010_relative/160068.xml

TRS/ICFP_2010_relative/151247.xml

TRS/ICFP_2010_relative/186919.xml

TRS/ICFP_2010_relative/57278.xml

TRS/ICFP_2010_relative/167433.xml

TRS/ICFP_2010_relative/160427.xml

TRS/ICFP_2010_relative/26940.xml

TRS/ICFP_2010_relative/29415.xml

TRS/ICFP_2010_relative/254704.xml

TRS/ICFP_2010_relative/136571.xml

TRS/ICFP_2010_relative/158620.xml

TRS/ICFP_2010_relative/27036.xml

TRS/ICFP_2010_relative/182946.xml

TRS/ICFP_2010_relative/107193.xml

TRS/ICFP_2010_relative/40033.xml

TRS/ICFP_2010_relative/211915.xml

TRS/ICFP_2010_relative/25849.xml

TRS/ICFP_2010_relative/153243.xml

TRS/ICFP_2010_relative/153034.xml

TRS/ICFP_2010_relative/51424.xml

TRS/ICFP_2010_relative/25734.xml

TRS/ICFP_2010_relative/137087.xml

TRS/ICFP_2010_relative/167041.xml

TRS/ICFP_2010_relative/88208.xml

TRS/ICFP_2010_relative/41688.xml

TRS/ICFP_2010_relative/149361.xml

TRS/ICFP_2010_relative/27009.xml

TRS/ICFP_2010_relative/27019.xml

TRS/ICFP_2010_relative/58125.xml

TRS/ICFP_2010_relative/25808.xml

TRS/ICFP_2010_relative/26976.xml

TRS/ICFP_2010_relative/136354.xml

TRS/ICFP_2010_relative/25422.xml

TRS/ICFP_2010_relative/157275.xml

TRS/ICFP_2010_relative/133079.xml

TRS/ICFP_2010_relative/153371.xml

TRS/ICFP_2010_relative/50904.xml

TRS/ICFP_2010_relative/51577.xml

TRS/ICFP_2010_relative/48328.xml

TRS/ICFP_2010_relative/26980.xml

TRS/ICFP_2010_relative/167310.xml

TRS/ICFP_2010_relative/160364.xml

TRS/ICFP_2010_relative/26896.xml

TRS/ICFP_2010_relative/150258.xml

TRS/ICFP_2010_relative/98623.xml

TRS/ICFP_2010_relative/167636.xml

TRS/ICFP_2010_relative/26105.xml

TRS/ICFP_2010_relative/43987.xml

TRS/ICFP_2010_relative/162244.xml

TRS/ICFP_2010_relative/149319.xml

TRS/ICFP_2010_relative/149713.xml

TRS/ICFP_2010_relative/39830.xml

TRS/ICFP_2010_relative/160210.xml

TRS/ICFP_2010_relative/167742.xml

TRS/ICFP_2010_relative/161533.xml

TRS/ICFP_2010_relative/26875.xml

TRS/ICFP_2010_relative/137956.xml

TRS/ICFP_2010_relative/133236.xml

TRS/ICFP_2010_relative/26116.xml

TRS/ICFP_2010_relative/135410.xml

TRS/ICFP_2010_relative/160324.xml

TRS/ICFP_2010_relative/186810.xml

TRS/ICFP_2010_relative/42321.xml

TRS/ICFP_2010_relative/157161.xml

TRS/ICFP_2010_relative/158342.xml

TRS/ICFP_2010_relative/40976.xml

TRS/ICFP_2010_relative/135659.xml

TRS/ICFP_2010_relative/26933.xml

TRS/ICFP_2010_relative/91210.xml

TRS/ICFP_2010_relative/25416.xml

TRS/ICFP_2010_relative/26946.xml

TRS/ICFP_2010_relative/25409.xml

TRS/ICFP_2010_relative/167391.xml

TRS/ICFP_2010_relative/26741.xml

TRS/ICFP_2010_relative/27006.xml

TRS/ICFP_2010_relative/166558.xml

TRS/ICFP_2010_relative/26993.xml

TRS/ICFP_2010_relative/259625.xml

TRS/ICFP_2010_relative/26927.xml

TRS/ICFP_2010_relative/42170.xml

TRS/ICFP_2010_relative/3927.xml

TRS/ICFP_2010_relative/26986.xml

TRS/ICFP_2010_relative/25388.xml

TRS/ICFP_2010_relative/160660.xml

TRS/ICFP_2010_relative/185453.xml

TRS/ICFP_2010_relative/149915.xml

TRS/ICFP_2010_relative/26871.xml

TRS/ICFP_2010_relative/26998.xml

TRS/ICFP_2010_relative/186617.xml

TRS/ICFP_2010_relative/26931.xml

TRS/ICFP_2010_relative/136280.xml

TRS/ICFP_2010_relative/136323.xml

TRS/ICFP_2010_relative/213147.xml

TRS/ICFP_2010_relative/180915.xml

TRS/ICFP_2010_relative/138089.xml

TRS/ICFP_2010_relative/161519.xml

TRS/ICFP_2010_relative/136497.xml

TRS/ICFP_2010_relative/167526.xml

TRS/ICFP_2010_relative/25726.xml

TRS/ICFP_2010_relative/157713.xml

TRS/ICFP_2010_relative/137316.xml

TRS/ICFP_2010_relative/130472.xml

TRS/ICFP_2010_relative/27015.xml

TRS/ICFP_2010_relative/188296.xml

TRS/ICFP_2010_relative/88156.xml

TRS/ICFP_2010_relative/26862.xml

TRS/ICFP_2010_relative/153288.xml

TRS/ICFP_2010_relative/26845.xml

TRS/ICFP_2010_relative/26949.xml

TRS/ICFP_2010_relative/188261.xml

TRS/ICFP_2010_relative/160462.xml

TRS/ICFP_2010_relative/160254.xml

TRS/ICFP_2010_relative/26923.xml

TRS/ICFP_2010_relative/153170.xml

TRS/ICFP_2010_relative/184957.xml

TRS/ICFP_2010_relative/26969.xml

TRS/ICFP_2010_relative/165713.xml

TRS/ICFP_2010_relative/152949.xml

TRS/ICFP_2010_relative/27003.xml

TRS/ICFP_2010_relative/44332.xml

TRS/ICFP_2010_relative/148543.xml

TRS/ICFP_2010_relative/166465.xml

TRS/ICFP_2010_relative/162095.xml

TRS/ICFP_2010_relative/26919.xml

TRS/ICFP_2010_relative/152786.xml

TRS/ICFP_2010_relative/167240.xml

TRS/ICFP_2010_relative/25711.xml

TRS/ICFP_2010_relative/130962.xml

TRS/ICFP_2010_relative/26943.xml

TRS/ICFP_2010_relative/24100.xml

TRS/ICFP_2010_relative/56144.xml

TRS/ICFP_2010_relative/149297.xml

TRS/ICFP_2010_relative/137621.xml

TRS/ICFP_2010_relative/27013.xml

TRS/ICFP_2010_relative/149633.xml

TRS/ICFP_2010_relative/161593.xml

TRS/ICFP_2010_relative/132848.xml

TRS/ICFP_2010_relative/149251.xml

TRS/ICFP_2010_relative/4206.xml

TRS/ICFP_2010_relative/153090.xml

TRS/ICFP_2010_relative/161917.xml

TRS/ICFP_2010_relative/26879.xml

TRS/ICFP_2010_relative/43650.xml

TRS/ICFP_2010_relative/88183.xml

TRS/ICFP_2010_relative/136693.xml

TRS/ICFP_2010_relative/91233.xml

TRS/ICFP_2010_relative/150725.xml

TRS/ICFP_2010_relative/212364.xml

TRS/ICFP_2010_relative/25736.xml

TRS/ICFP_2010_relative/152694.xml

TRS/ICFP_2010_relative/162075.xml

TRS/ICFP_2010_relative/149277.xml

TRS/ICFP_2010_relative/186222.xml

TRS/ICFP_2010_relative/43603.xml

TRS/ICFP_2010_relative/166493.xml

TRS/ICFP_2010_relative/149415.xml

TRS/ICFP_2010_relative/136463.xml

TRS/ICFP_2010_relative/152865.xml

TRS/ICFP_2010_relative/136601.xml

TRS/ICFP_2010_relative/26972.xml

TRS/ICFP_2010_relative/26882.xml

TRS/ICFP_2010_relative/48374.xml

TRS/ICFP_2010_relative/130161.xml

TRS/ICFP_2010_relative/188004.xml

TRS/ICFP_2010_relative/214183.xml

TRS/ICFP_2010_relative/25743.xml

TRS/ICFP_2010_relative/150067.xml

TRS/ICFP_2010_relative/150468.xml

TRS/ICFP_2010_relative/26132.xml

TRS/ICFP_2010_relative/25395.xml

TRS/ICFP_2010_relative/43266.xml

TRS/ICFP_2010_relative/26957.xml

TRS/ICFP_2010_relative/157150.xml

TRS/ICFP_2010_relative/53216.xml

TRS/ICFP_2010_relative/157603.xml

TRS/ICFP_2010_relative/165975.xml

TRS/ICFP_2010_relative/166848.xml

TRS/ICFP_2010_relative/160475.xml

TRS/ICFP_2010_relative/40540.xml

TRS/ICFP_2010_relative/185628.xml

TRS/ICFP_2010_relative/187837.xml

TRS/ICFP_2010_relative/135714.xml

TRS/ICFP_2010_relative/165904.xml

TRS/ICFP_2010_relative/136934.xml

TRS/ICFP_2010_relative/42683.xml

TRS/ICFP_2010_relative/186973.xml

TRS/ICFP_2010_relative/27001.xml

TRS/ICFP_2010_relative/263745.xml

TRS/ICFP_2010_relative/136534.xml

TRS/ICFP_2010_relative/48267.xml

TRS/ICFP_2010_relative/150877.xml

TRS/ICFP_2010_relative/186775.xml

TRS/ICFP_2010_relative/161864.xml

TRS/ICFP_2010_relative/27039.xml

TRS/ICFP_2010_relative/150630.xml

TRS/ICFP_2010_relative/162016.xml

TRS/ICFP_2010_relative/41427.xml

TRS/ICFP_2010_relative/27023.xml

TRS/ICFP_2010_relative/153444.xml

TRS/ICFP_2010_relative/165936.xml

TRS/ICFP_2010_relative/26886.xml

TRS/ICFP_2010_relative/26960.xml

TRS/SK90/4.37.xml

TRS/SK90/2.01.xml

TRS/SK90/4.04.xml

TRS/SK90/4.32.xml

TRS/SK90/4.11.xml

TRS/SK90/2.33.xml

TRS/SK90/4.33.xml

TRS/SK90/4.40.xml

TRS/SK90/2.46.xml

TRS/SK90/4.55.xml

TRS/SK90/4.23.xml

TRS/SK90/2.58.xml

TRS/SK90/4.21.xml

TRS/SK90/2.60.xml

TRS/SK90/2.06.xml

TRS/SK90/4.52.xml

TRS/SK90/2.35.xml

TRS/SK90/4.56.xml

TRS/SK90/4.41.xml

TRS/SK90/2.32.xml

TRS/SK90/4.39.xml

TRS/SK90/2.56.xml

TRS/SK90/2.04.xml

TRS/SK90/4.44.xml

TRS/SK90/2.10.xml

TRS/SK90/4.49.xml

TRS/SK90/4.20.xml

TRS/SK90/4.19.xml

TRS/SK90/2.34.xml

TRS/SK90/4.15.xml

TRS/SK90/2.57.xml

TRS/SK90/4.03.xml

TRS/SK90/4.01.xml

TRS/SK90/2.08.xml

TRS/SK90/4.14.xml

TRS/SK90/2.05.xml

TRS/SK90/4.08.xml

TRS/SK90/4.46.xml

TRS/SK90/4.02.xml

TRS/SK90/4.50.xml

TRS/SK90/4.36.xml

TRS/AProVE_04/improved_usable2.xml

TRS/AProVE_04/forward_instantiation2.xml

TRS/AProVE_04/forward_instantiation.xml

TRS/AProVE_04/improved_usable.xml

TRS/Applicative_05/Ex2_6_1Composition.xml

TRS/Applicative_05/Ex8Polymorphic.xml

TRS/Applicative_05/TreeLevels.xml

TRS/Applicative_05/TakeDropWhile.xml

TRS/Applicative_05/TreeMap.xml

TRS/Applicative_05/TreeSize.xml

TRS/Applicative_05/Ex4MapList.xml

TRS/Applicative_05/TypeEx3.xml

TRS/Applicative_05/Ex6Folding.xml

TRS/Applicative_05/Ex7Sorting.xml

TRS/Applicative_05/TypeEx1.xml

TRS/Applicative_05/termMonTypes.xml

TRS/Applicative_05/Ex10Functional.xml

TRS/Applicative_05/Ex2_8_1ConstSubstFix.xml

TRS/Applicative_05/Ex6Recursor.xml

TRS/Applicative_05/Ex7_9.xml

TRS/Applicative_05/TreeHeight.xml

TRS/Applicative_05/mapDivMinus.xml

TRS/Applicative_05/BTreeMember.xml

TRS/Applicative_05/Ex6_11.xml

TRS/Applicative_05/Ex5Sorting.xml

TRS/Applicative_05/Ex2PrimRec.xml

TRS/Applicative_05/Ex9Maps.xml

TRS/Applicative_05/mapDivMinusHard.xml

TRS/Applicative_05/Ex7OrdinalRec.xml

TRS/Applicative_05/ReverseLastInit.xml

TRS/Applicative_05/Ex5Folding.xml

TRS/Applicative_05/Ex3Lists.xml

TRS/Applicative_05/nonTermF.xml

TRS/Applicative_05/TreeFlatten.xml

TRS/Zantema_05/jw50.xml

TRS/Zantema_05/jw14.xml

TRS/Zantema_05/jw26.xml

TRS/Zantema_05/jw01.xml

TRS/Zantema_05/jw24.xml

TRS/Zantema_05/z08.xml

TRS/Zantema_05/z09.xml

TRS/Zantema_05/jw28.xml

TRS/Zantema_05/jw30.xml

TRS/Zantema_05/jw23.xml

TRS/Zantema_05/jw20.xml

TRS/Zantema_05/z05.xml

TRS/Zantema_05/jw19.xml

TRS/Zantema_05/z11.xml

TRS/Zantema_05/jw43.xml

TRS/Zantema_05/jw09.xml

TRS/Zantema_05/jw16.xml

TRS/Zantema_05/z21.xml

TRS/Zantema_05/jw38.xml

TRS/Zantema_05/jw47.xml

TRS/Zantema_05/jw44.xml

TRS/Zantema_05/jw02.xml

TRS/Zantema_05/jw42.xml

TRS/Zantema_05/jw39.xml

TRS/Zantema_05/jw33.xml

TRS/Zantema_05/jw31.xml

TRS/Zantema_05/jw40.xml

TRS/Zantema_05/jw04.xml

TRS/Zantema_05/jw13.xml

TRS/Zantema_05/jw41.xml

TRS/Zantema_05/z04.xml

TRS/Zantema_05/z19.xml

TRS/Zantema_05/jw36.xml

TRS/Zantema_05/jw11.xml

TRS/Zantema_05/z25.xml

TRS/Zantema_05/jw18.xml

TRS/Zantema_05/z01.xml

TRS/Zantema_05/jw17.xml

TRS/Zantema_05/jw35.xml

TRS/Zantema_05/jw34.xml

TRS/Zantema_05/jw15.xml

TRS/Zantema_05/jw08.xml

TRS/Zantema_05/jw22.xml

TRS/Zantema_05/jw32.xml

TRS/Zantema_05/z22.xml

TRS/Zantema_05/z02.xml

TRS/Zantema_05/z03.xml

TRS/Zantema_05/jw25.xml

TRS/Zantema_05/jw27.xml

TRS/Zantema_05/jw03.xml

TRS/Zantema_05/jw05.xml

TRS/Zantema_05/z20.xml

TRS/Zantema_05/jw07.xml

TRS/Zantema_05/jw06.xml

TRS/Zantema_05/z30.xml

TRS/Zantema_05/z06.xml

TRS/Zantema_05/jw12.xml

TRS/Zantema_05/jw37.xml

TRS/Zantema_05/z07.xml

TRS/Zantema_05/z29.xml

TRS/Zantema_05/jw21.xml

TRS/Zantema_05/jw29.xml

TRS/Zantema_04/z089.xml

TRS/Zantema_04/z071.xml

TRS/Zantema_04/z012.xml

TRS/Zantema_04/z096.xml

TRS/Zantema_04/z006.xml

TRS/Zantema_04/z021.xml

TRS/Zantema_04/z109.xml

TRS/Zantema_04/z066.xml

TRS/Zantema_04/z087.xml

TRS/Zantema_04/z036.xml

TRS/Zantema_04/z041.xml

TRS/Zantema_04/z035.xml

TRS/Zantema_04/z025.xml

TRS/Zantema_04/z085.xml

TRS/Zantema_04/z048.xml

TRS/Zantema_04/z064.xml

TRS/Zantema_04/z088.xml

TRS/Zantema_04/z050.xml

TRS/Zantema_04/z040.xml

TRS/Zantema_04/z108.xml

TRS/Zantema_04/z033.xml

TRS/Zantema_04/z031.xml

TRS/Zantema_04/z039.xml

TRS/Zantema_04/z023.xml

TRS/Zantema_04/z029.xml

TRS/Zantema_04/z119.xml

TRS/Zantema_04/z113.xml

TRS/Zantema_04/z030.xml

TRS/Zantema_04/z127.xml

TRS/Zantema_04/z104.xml

TRS/Zantema_04/z034.xml

TRS/Zantema_04/z027.xml

TRS/Zantema_04/z061.xml

TRS/Zantema_04/z007.xml

TRS/Zantema_04/z001.xml

TRS/Zantema_04/z128.xml

TRS/Zantema_04/z101.xml

TRS/Zantema_04/z086.xml

TRS/Zantema_04/z038.xml

TRS/Zantema_04/z049.xml

TRS/Zantema_04/z053.xml

TRS/Zantema_04/z037.xml

TRS/Zantema_04/z024.xml

TRS/Zantema_04/z063.xml

TRS/Zantema_04/z056.xml

TRS/Zantema_04/z058.xml

TRS/Zantema_04/z032.xml

TRS/Zantema_04/z110.xml

TRS/Zantema_04/z028.xml

TRS/Zantema_04/z102.xml

TRS/Zantema_04/z098.xml

TRS/Zantema_04/z121.xml

TRS/Zantema_04/z097.xml

TRS/Zantema_04/z115.xml

TRS/Zantema_04/z069.xml

TRS/Zantema_04/z055.xml

TRS/Zantema_04/z051.xml

TRS/Zantema_04/z059.xml

TRS/Zantema_04/z095.xml

TRS/Zantema_04/z093.xml

TRS/Zantema_04/z022.xml

TRS/Zantema_04/z062.xml

TRS/Zantema_04/z116.xml

TRS/Zantema_04/z019.xml

TRS/Zantema_04/z060.xml

TRS/Zantema_04/z126.xml

TRS/Zantema_04/z070.xml

TRS/Zantema_04/z011.xml

TRS/Zantema_04/z068.xml

TRS/Zantema_04/z122.xml

TRS/Zantema_04/z015.xml

TRS/Zantema_04/z112.xml

TRS/Zantema_04/z052.xml

TRS/Zantema_04/z067.xml

TRS/Zantema_04/z054.xml

TRS/Zantema_04/z084.xml

TRS/Zantema_04/z057.xml

TRS/Mixed_HO_10/prenex.xml

TRS/Secret_06_SRS/secr7.xml

TRS/Secret_06_SRS/multum4.xml

TRS/Secret_06_SRS/8.xml

TRS/Secret_06_SRS/secr9.xml

TRS/Secret_06_SRS/multum6.xml

TRS/Secret_06_SRS/secr10.xml

TRS/Secret_06_SRS/5.xml

TRS/Secret_06_SRS/3-matchbox.xml

TRS/Secret_06_SRS/secr6.xml

TRS/Secret_06_SRS/multum3.xml

TRS/Secret_06_SRS/secr1.xml

TRS/Secret_06_SRS/multum1.xml

TRS/Secret_06_SRS/2-matchbox.xml

TRS/Secret_06_SRS/1.xml

TRS/Secret_06_SRS/3.xml

TRS/Secret_06_SRS/6.xml

TRS/Secret_06_SRS/multum2.xml

TRS/Secret_06_SRS/2.xml

TRS/Secret_06_SRS/multum5.xml

TRS/Secret_06_SRS/secr2.xml

TRS/Trafo_06/dup13.xml

TRS/Trafo_06/dup17.xml

TRS/Trafo_06/dup10.xml

TRS/Trafo_06/un16.xml

TRS/Trafo_06/un09.xml

TRS/Trafo_06/un06.xml

TRS/Trafo_06/un04.xml

TRS/Trafo_06/hom03.xml

TRS/Trafo_06/dup14.xml

TRS/Trafo_06/un07.xml

TRS/Trafo_06/un15.xml

TRS/Trafo_06/hom02.xml

TRS/Trafo_06/un08.xml

TRS/Trafo_06/un02.xml

TRS/Trafo_06/dup08.xml

TRS/Trafo_06/hom01.xml

TRS/Trafo_06/dup07.xml

TRS/Trafo_06/un14.xml

TRS/Trafo_06/dup09.xml

TRS/Trafo_06/dup06.xml

TRS/Trafo_06/un17.xml

TRS/Trafo_06/un10.xml

TRS/Trafo_06/dup15.xml

TRS/Trafo_06/dup12.xml

TRS/Trafo_06/dup01.xml

TRS/Trafo_06/un12.xml

TRS/Trafo_06/dup05.xml

TRS/Trafo_06/un18.xml

TRS/Trafo_06/un13.xml

TRS/Trafo_06/un05.xml

TRS/Trafo_06/dup11.xml

TRS/Trafo_06/un11.xml

TRS/Trafo_06/dup16.xml

TRS/Waldmann_06_SRS/uni-2.xml

TRS/Waldmann_06_SRS/uni-1.xml

TRS/Waldmann_06_SRS/sym-1.xml

TRS/Waldmann_06_SRS/sym-6.xml

TRS/Waldmann_06_SRS/uni-7.xml

TRS/Waldmann_06_SRS/sym-2.xml

TRS/Waldmann_06_SRS/uni-5.xml

TRS/Waldmann_06_SRS/uni-4.xml

TRS/Waldmann_06_SRS/jw5.xml

TRS/Waldmann_06_SRS/uni-3.xml

TRS/Waldmann_06_SRS/sym-4.xml

TRS/Waldmann_06_SRS/jw1.xml

TRS/Waldmann_06_SRS/sym-5.xml

TRS/Waldmann_06_SRS/jw4.xml

TRS/Waldmann_06_SRS/uni-6.xml

TRS/Waldmann_06_SRS/z086-variant.xml

TRS/Applicative_first_order_05/hydra.xml

TRS/Applicative_first_order_05/17.xml

TRS/Applicative_first_order_05/08.xml

TRS/Applicative_first_order_05/#3.22.xml

TRS/Applicative_first_order_05/#3.36.xml

TRS/Applicative_first_order_05/#3.57.xml

TRS/Applicative_first_order_05/#3.40.xml

TRS/Applicative_first_order_05/minsort.xml

TRS/Applicative_first_order_05/11.xml

TRS/Applicative_first_order_05/12.xml

TRS/Applicative_first_order_05/#3.52.xml

TRS/Applicative_first_order_05/#3.45.xml

TRS/Applicative_first_order_05/#3.25.xml

TRS/Applicative_first_order_05/#3.27.xml

TRS/Applicative_first_order_05/#3.18.xml

TRS/Applicative_first_order_05/13.xml

TRS/Applicative_first_order_05/18.xml

TRS/Applicative_first_order_05/#3.16.xml

TRS/Applicative_first_order_05/perfect.xml

TRS/Applicative_first_order_05/#3.2.xml

TRS/Applicative_first_order_05/33.xml

TRS/Applicative_first_order_05/#3.13.xml

TRS/Applicative_first_order_05/30.xml

TRS/Applicative_first_order_05/perfect2.xml

TRS/Applicative_first_order_05/#3.48.xml

TRS/Applicative_first_order_05/#3.38.xml

TRS/Applicative_first_order_05/#3.8.xml

TRS/Applicative_first_order_05/#3.32.xml

TRS/Applicative_first_order_05/02.xml

TRS/Applicative_first_order_05/21.xml

TRS/Applicative_first_order_05/#3.10.xml

TRS/Applicative_first_order_05/31.xml

TRS/Applicative_first_order_05/06.xml

TRS/Applicative_first_order_05/01.xml

TRS/Applicative_first_order_05/#3.6.xml

TRS/Applicative_first_order_05/motivation.xml

TRS/Applicative_first_order_05/29.xml

TRS/Applicative_first_order_05/#3.55.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-19.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-21.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-3.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-18.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-17.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-3.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-13.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-4.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-20.xml

TRS/Various_04/19.xml

TRS/Various_04/03.xml

TRS/Various_04/27.xml

TRS/Various_04/26.xml

TRS/Various_04/09.xml

TRS/Various_04/25.xml

TRS/Various_04/02.xml

TRS/Various_04/21.xml

TRS/Various_04/07.xml

TRS/Various_04/06.xml

TRS/Various_04/05.xml

TRS/Mixed_innermost/test75.xml

TRS/Mixed_innermost/innermost2.xml

TRS/Mixed_innermost/innermost1.xml

TRS/Mixed_innermost/test9.xml

TRS/Mixed_innermost/bn111.xml

TRS/Mixed_innermost/toyama.xml

TRS/Mixed_innermost/innermost3.xml

TRS/Mixed_innermost/n001.xml

TRS/Mixed_innermost/gkg.xml

TRS/Mixed_innermost/test833.xml

TRS/AProVE_06/mapHard.xml

TRS/Der95/17.xml

TRS/Der95/04.xml

TRS/Der95/03.xml

TRS/Der95/28.xml

TRS/Der95/13.xml

TRS/Der95/09.xml

TRS/Der95/30.xml

TRS/Der95/02.xml

TRS/Der95/01.xml

TRS/Secret_05_TRS/aprove1.xml

TRS/Secret_05_TRS/teparla1.xml

TRS/Secret_05_TRS/teparla3.xml

TRS/Secret_05_TRS/matchbox2.xml

TRS/Secret_05_TRS/teparla2.xml

TRS/Secret_05_TRS/cime1.xml

TRS/Secret_05_TRS/matchbox1.xml

TRS/Rubio_04/mfp90b.xml

TRS/Rubio_04/lescanne.xml

TRS/Rubio_04/aoto.xml

TRS/Rubio_04/bn129.xml

TRS/Rubio_04/lindau.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_iGM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_iGM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex1_GM03_iGM.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_iGM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_iGM.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_L.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_iGM.xml

TRS/Transformed_CSR_04/Ex16_Luc06_iGM.xml

TRS/Transformed_CSR_04/Ex23_Luc06_L.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_iGM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex1_GL02a_iGM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex9_Luc04_iGM.xml

TRS/Transformed_CSR_04/Ex1_GM99_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex6_GM04_iGM.xml

TRS/Transformed_CSR_04/Ex9_Luc06_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex49_GM04_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex6_Luc98_iGM.xml

TRS/Transformed_CSR_04/Ex7_BLR02_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_iGM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_L.xml

TRS/Transformed_CSR_04/Ex23_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_iGM.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_FR.xml

TRS/Transformed_CSR_04/PEANO_nokinds_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex8_BLR02_iGM.xml

TRS/Transformed_CSR_04/MYNAT_complete_iGM.xml

TRS/Transformed_CSR_04/Ex1_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_L.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_iGM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_L.xml

TRS/Transformed_CSR_04/Ex16_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_iGM.xml

TRS/Transformed_CSR_04/Ex4_Zan97_iGM.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts-noand_L.xml

TRS/Transformed_CSR_04/OvConsOS_complete_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_iGM.xml

TRS/Transformed_CSR_04/Ex6_GM04_L.xml

TRS/Transformed_CSR_04/Ex24_GM04_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_iGM.xml

TRS/Transformed_CSR_04/Ex1_GM99_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex15_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_complete_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_iGM.xml

TRS/Transformed_CSR_04/Ex24_Luc06_iGM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_iGM.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex15_Luc98_iGM.xml

TRS/Transformed_CSR_04/Ex5_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex9_Luc04_FR.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_iGM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_complete_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_iGM.xml

File:Duplicates-8.0.txt

2011-03-01T15:06:33Z

Zini: Problems appearing at least twice in the TPDB 8.0

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_C.xml

Transformed_CSR_innermost_04/ExProp7_Luc06_L.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_GM.xml

Transformed_CSR_04/PALINDROME_nokinds-noand_L.xml

Transformed_CSR_04/Ex1_Luc04b_Z.xml

Transformed_CSR_innermost_04/PEANO_complete_noand_GM.xml

Transformed_CSR_04/Ex9_Luc06_FR.xml

Transformed_CSR_innermost_04/Ex6_15_AEL02_GM.xml

Transformed_CSR_04/OvConsOS_nosorts-noand_FR.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_iGM.xml

Transformed_CSR_04/Ex6_GM04_FR.xml

Transformed_CSR_innermost_04/PALINDROME_complete_noand_iGM.xml

Transformed_CSR_innermost_04/Ex4_7_15_Bor03_GM.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/Ex7_BLR02_iGM.xml

Transformed_CSR_innermost_04/ExProp7_Luc06_C.xml

Transformed_CSR_04/LengthOfFiniteLists_nokinds_FR.xml

Transformed_CSR_innermost_04/Ex4_7_15_Bor03_C.xml

Transformed_CSR_04/PALINDROME_complete-noand_L.xml

Transformed_CSR_innermost_04/PEANO_nokinds_noand_C.xml

Transformed_CSR_innermost_04/Ex24_Luc06_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_noand_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_complete_noand_iGM.xml

Transformed_CSR_innermost_04/Ex7_BLR02_C.xml

Transformed_CSR_innermost_04/MYNAT_complete_noand_iGM.xml

Transformed_CSR_innermost_04/Ex3_12_Luc96a_C.xml

Transformed_CSR_innermost_04/Ex8_BLR02_GM.xml

Transformed_CSR_innermost_04/Ex4_7_77_Bor03_iGM.xml

Transformed_CSR_04/Ex1_GL02a_Z.xml

Transformed_CSR_innermost_04/Ex9_BLR02_C.xml

Transformed_CSR_innermost_04/Ex2_Luc02a_C.xml

Transformed_CSR_innermost_04/ExSec11_1_Luc02a_C.xml

Transformed_CSR_04/PALINDROME_nosorts-noand_L.xml

Transformed_CSR_innermost_04/MYNAT_complete_C.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_noand_GM.xml

Transformed_CSR_innermost_04/PEANO_complete_noand_C.xml

Transformed_CSR_innermost_04/Ex24_GM04_GM.xml

Transformed_CSR_innermost_04/Ex6_Luc98_L.xml

Transformed_CSR_innermost_04/ExIntrod_GM04_C.xml

Transformed_CSR_innermost_04/PALINDROME_complete_C.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_noand_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_noand_iGM.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_noand_iGM.xml

Transformed_CSR_innermost_04/Ex1_Luc04b_GM.xml

Transformed_CSR_04/LengthOfFiniteLists_nokinds_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_GM.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_noand_iGM.xml

Transformed_CSR_innermost_04/PEANO_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/Ex14_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex15_Luc98_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_noand_GM.xml

Transformed_CSR_innermost_04/Ex4_7_77_Bor03_C.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_noand_GM.xml

Transformed_CSR_04/Ex5_DLMMU04_Z.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_noand_C.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_noand_C.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_iGM.xml

Transformed_CSR_innermost_04/Ex15_Luc98_C.xml

Transformed_CSR_innermost_04/Ex3_2_Luc97_GM.xml

Transformed_CSR_innermost_04/Ex18_Luc06_GM.xml

Transformed_CSR_innermost_04/Ex24_GM04_C.xml

Transformed_CSR_innermost_04/Ex8_BLR02_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_iGM.xml

Transformed_CSR_04/OvConsOS_nosorts_FR.xml

Transformed_CSR_innermost_04/Ex6_9_Luc02c_iGM.xml

Transformed_CSR_innermost_04/Ex23_Luc06_C.xml

Transformed_CSR_04/Ex1_Zan97_L.xml

Transformed_CSR_04/ExConc_Zan97_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_noand_iGM.xml

Transformed_CSR_04/Ex1_GM99_L.xml

Transformed_CSR_innermost_04/Ex4_Zan97_iGM.xml

Transformed_CSR_innermost_04/Ex1_GM03_iGM.xml

Transformed_CSR_innermost_04/ExSec11_1_Luc02a_iGM.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_GM.xml

Transformed_CSR_innermost_04/Ex3_12_Luc96a_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_noand_C.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_C.xml

Transformed_CSR_innermost_04/Ex6_GM04_GM.xml

Transformed_CSR_innermost_04/Ex25_Luc06_L.xml

Transformed_CSR_innermost_04/PEANO_nosorts_noand_C.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_GM.xml

Transformed_CSR_innermost_04/ExSec4_2_DLMMU04_GM.xml

Transformed_CSR_04/LengthOfFiniteLists_nokinds-noand_FR.xml

Transformed_CSR_04/Ex1_GL02a_L.xml

Transformed_CSR_04/Ex4_DLMMU04_Z.xml

Transformed_CSR_04/Ex9_Luc04_FR.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_C.xml

Transformed_CSR_innermost_04/Ex14_Luc06_C.xml

Transformed_CSR_04/Ex4_DLMMU04_FR.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_GM.xml

Transformed_CSR_04/Ex24_Luc06_FR.xml

Transformed_CSR_innermost_04/PALINDROME_complete_noand_C.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_C.xml

Transformed_CSR_04/Ex1_Zan97_FR.xml

Transformed_CSR_04/Ex1_Luc04b_FR.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_C.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_noand_C.xml

Transformed_CSR_innermost_04/Ex9_Luc06_C.xml

Transformed_CSR_04/OvConsOS_nosorts-noand_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_noand_iGM.xml

Transformed_CSR_04/Ex15_Luc06_L.xml

Transformed_CSR_04/OvConsOS_nokinds-noand_Z.xml

Transformed_CSR_innermost_04/Ex14_Luc06_GM.xml

Transformed_CSR_innermost_04/OvConsOS_complete_noand_C.xml

Transformed_CSR_innermost_04/Ex5_7_Luc97_iGM.xml

Transformed_CSR_innermost_04/Ex6_Luc98_C.xml

Transformed_CSR_innermost_04/ExProp7_Luc06_GM.xml

Transformed_CSR_innermost_04/ExConc_Zan97_C.xml

Transformed_CSR_innermost_04/Ex25_Luc06_GM.xml

Transformed_CSR_innermost_04/Ex2_Luc03b_C.xml

Transformed_CSR_innermost_04/ExSec11_1_Luc02a_L.xml

Transformed_CSR_innermost_04/Ex6_9_Luc02c_C.xml

Transformed_CSR_innermost_04/Ex3_3_25_Bor03_GM.xml

Transformed_CSR_innermost_04/Ex14_AEGL02_C.xml

Transformed_CSR_innermost_04/Ex3_2_Luc97_iGM.xml

Transformed_CSR_04/Ex4_4_Luc96b_Z.xml

Transformed_CSR_innermost_04/Ex23_Luc06_iGM.xml

Transformed_CSR_innermost_04/ExSec4_2_DLMMU04_C.xml

Transformed_CSR_innermost_04/Ex6_Luc98_iGM.xml

Transformed_CSR_innermost_04/Ex4_4_Luc96b_L.xml

Transformed_CSR_innermost_04/PEANO_complete_iGM.xml

Transformed_CSR_innermost_04/Ex4_DLMMU04_iGM.xml

Transformed_CSR_04/OvConsOS_nokinds-noand_FR.xml

Transformed_CSR_innermost_04/Ex25_Luc06_C.xml

Transformed_CSR_innermost_04/Ex9_BLR02_iGM.xml

Transformed_CSR_innermost_04/ExConc_Zan97_iGM.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_iGM.xml

Transformed_CSR_innermost_04/Ex6_15_AEL02_C.xml

Transformed_CSR_innermost_04/Ex3_12_Luc96a_GM.xml

Transformed_CSR_04/LengthOfFiniteLists_nokinds-noand_Z.xml

Transformed_CSR_innermost_04/Ex1_2_AEL03_GM.xml

Transformed_CSR_innermost_04/ExIntrod_GM04_iGM.xml

Transformed_CSR_innermost_04/Ex3_3_25_Bor03_L.xml

Transformed_CSR_innermost_04/Ex49_GM04_GM.xml

Transformed_CSR_innermost_04/Ex5_7_Luc97_C.xml

Transformed_CSR_innermost_04/Ex16_Luc06_iGM.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_iGM.xml

Transformed_CSR_innermost_04/PEANO_complete_GM.xml

Transformed_CSR_04/Ex24_GM04_L.xml

Transformed_CSR_innermost_04/Ex2_Luc03b_GM.xml

Transformed_CSR_innermost_04/PALINDROME_complete_noand_GM.xml

Transformed_CSR_innermost_04/Ex1_2_Luc02c_GM.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_GM.xml

Transformed_CSR_innermost_04/Ex4_4_Luc96b_iGM.xml

Transformed_CSR_innermost_04/ExProp7_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex2_Luc03b_iGM.xml

Transformed_CSR_innermost_04/Ex4_DLMMU04_C.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_complete_C.xml

Transformed_CSR_innermost_04/PEANO_nosorts_C.xml

Transformed_CSR_innermost_04/Ex3_2_Luc97_C.xml

Transformed_CSR_innermost_04/ExIntrod_GM01_GM.xml

Transformed_CSR_innermost_04/Ex2_Luc03b_L.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_noand_GM.xml

Transformed_CSR_innermost_04/Ex1_Zan97_GM.xml

Transformed_CSR_innermost_04/Ex4_7_56_Bor03_iGM.xml

Transformed_CSR_innermost_04/Ex15_Luc06_C.xml

Transformed_CSR_innermost_04/Ex1_Zan97_iGM.xml

Transformed_CSR_innermost_04/Ex6_15_AEL02_iGM.xml

Transformed_CSR_innermost_04/Ex6_Luc98_GM.xml

Transformed_CSR_innermost_04/ExIntrod_Zan97_GM.xml

Transformed_CSR_innermost_04/ExSec11_1_Luc02a_GM.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_noand_C.xml

Transformed_CSR_innermost_04/ExIntrod_GM01_iGM.xml

Transformed_CSR_04/Ex1_GM03_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_noand_C.xml

Strategy_outermost_added_08/ttt2.xml

Strategy_outermost_added_08/ttt1.xml

Strategy_removed_CSR_05/Ex1_GL02a.xml

Strategy_removed_CSR_05/Ex4_Zan97.xml

Strategy_removed_CSR_05/Ex1_2_AEL03.xml

Strategy_removed_CSR_05/Ex9_BLR02.xml

CSR_04/Ex18_Luc06.xml

Strategy_removed_mixed_05/ExSec11_1_Luc02a.xml

Strategy_removed_CSR_05/ExAppendixB_AEL03.xml

Strategy_removed_CSR_05/Ex26_Luc03b.xml

Strategy_removed_CSR_05/Ex5_7_Luc97.xml

Strategy_removed_CSR_05/Ex6_GM04.xml

Strategy_removed_CSR_05/Ex3_12_Luc96a.xml

Strategy_removed_CSR_05/Ex6_9_Luc02c.xml

Strategy_removed_CSR_05/Ex1_2_Luc02c.xml

Strategy_removed_CSR_05/ExIntrod_Zan97.xml

Strategy_removed_CSR_05/ExIntrod_GM99.xml

Strategy_removed_CSR_05/Ex1_Luc02b.xml

Strategy_removed_CSR_05/ExIntrod_GM04.xml

Strategy_removed_CSR_05/Ex4_7_56_Bor03.xml

Strategy_removed_CSR_05/Ex14_AEGL02.xml

Strategy_removed_CSR_05/Ex7_BLR02.xml

Strategy_removed_CSR_05/Ex4_7_15_Bor03.xml

Strategy_removed_mixed_05/test75.xml

SK90/4.55.xml

Strategy_removed_mixed_05/test830.xml

Strategy_removed_mixed_05/gkg.xml

Strategy_removed_mixed_05/bn111.xml

Mixed_innermost/thiemann28i.xml

Strategy_removed_mixed_05/test10.xml

Strategy_removed_mixed_05/test77.xml

Strategy_outermost_added_08/LengthOfFiniteLists_nosorts-noand_Z.xml

Strategy_removed_AG01/#4.17.xml

Strategy_outermost_added_08/n008.xml

Strategy_outermost_added_08/Ex6_GM04_Z.xml

Strategy_removed_AG01/#4.14.xml

Strategy_outermost_added_08/Ex14_Luc06_Z.xml

Strategy_outermost_added_08/n007.xml

Strategy_outermost_added_08/001.xml

Strategy_outermost_added_08/4.06.xml

Strategy_outermost_added_08/append-wrong.xml

Strategy_outermost_added_08/Ex2_8_1ConstSubstFix.xml

Strategy_outermost_added_08/n006.xml

Strategy_outermost_added_08/Ex9_Luc04_Z.xml

Strategy_outermost_added_08/Hamming.xml

Strategy_outermost_added_08/Ex9_Luc06_L.xml

Strategy_removed_AG01/#4.3.xml

Strategy_removed_AG01/#4.2.xml

Strategy_outermost_added_08/TypeEx3.xml

Strategy_outermost_added_08/4.34.xml

Strategy_removed_AG01/#4.4.xml

Waldmann_06/jwno4.xml

Strategy_removed_AG01/#4.12a.xml

Waldmann_06/jwno6.xml

Strategy_outermost_added_08/n004.xml

Strategy_outermost_added_08/thiemann28.xml

Zantema_04/z086.xml

Transformed_outermost_08/cariboo_ex4.xml

SK90/4.27.xml

ICFP_2010_relative/4206.xml

ICFP_2010_relative/41838.xml

ICFP_2010_relative/183803.xml

ICFP_2010_relative/25808.xml

ICFP_2010_relative/25395.xml

ICFP_2010_relative/27039.xml

ICFP_2010_relative/27213.xml

ICFP_2010_relative/107193.xml

ICFP_2010_relative/160462.xml

ICFP_2010_relative/184957.xml

ICFP_2010_relative/91210.xml

ICFP_2010_relative/167742.xml

ICFP_2010_relative/188261.xml

ICFP_2010_relative/26879.xml

ICFP_2010_relative/51424.xml

ICFP_2010_relative/214183.xml

ICFP_2010_relative/26919.xml

ICFP_2010_relative/187837.xml

ICFP_2010_relative/27013.xml

ICFP_2010_relative/136323.xml

ICFP_2010_relative/161519.xml

ICFP_2010_relative/148543.xml

ICFP_2010_relative/137799.xml

ICFP_2010_relative/213147.xml

ICFP_2010_relative/26882.xml

ICFP_2010_relative/157603.xml

ICFP_2010_relative/26069.xml

ICFP_2010_relative/188238.xml

ICFP_2010_relative/26927.xml

ICFP_2010_relative/136463.xml

ICFP_2010_relative/26933.xml

ICFP_2010_relative/160398.xml

ICFP_2010_relative/29415.xml

ICFP_2010_relative/166558.xml

ICFP_2010_relative/137087.xml

ICFP_2010_relative/57278.xml

ICFP_2010_relative/149297.xml

ICFP_2010_relative/45970.xml

ICFP_2010_relative/162095.xml

ICFP_2010_relative/161930.xml

ICFP_2010_relative/162244.xml

ICFP_2010_relative/137715.xml

ICFP_2010_relative/26960.xml

ICFP_2010_relative/88156.xml

ICFP_2010_relative/133532.xml

ICFP_2010_relative/27030.xml

ICFP_2010_relative/26978.xml

ICFP_2010_relative/26910.xml

ICFP_2010_relative/188696.xml

ICFP_2010_relative/212364.xml

ICFP_2010_relative/42321.xml

ICFP_2010_relative/28464.xml

ICFP_2010_relative/48328.xml

ICFP_2010_relative/26683.xml

ICFP_2010_relative/25711.xml

ICFP_2010_relative/136601.xml

ICFP_2010_relative/152949.xml

ICFP_2010_relative/27131.xml

ICFP_2010_relative/43266.xml

ICFP_2010_relative/157275.xml

ICFP_2010_relative/58194.xml

ICFP_2010_relative/149915.xml

ICFP_2010_relative/27006.xml

ICFP_2010_relative/25734.xml

ICFP_2010_relative/185628.xml

ICFP_2010_relative/136534.xml

ICFP_2010_relative/26291.xml

ICFP_2010_relative/149415.xml

ICFP_2010_relative/26916.xml

ICFP_2010_relative/25416.xml

ICFP_2010_relative/43987.xml

ICFP_2010_relative/51842.xml

ICFP_2010_relative/25409.xml

ICFP_2010_relative/136693.xml

ICFP_2010_relative/26130.xml

ICFP_2010_relative/51577.xml

ICFP_2010_relative/88208.xml

ICFP_2010_relative/26972.xml

ICFP_2010_relative/41688.xml

ICFP_2010_relative/25726.xml

ICFP_2010_relative/165936.xml

ICFP_2010_relative/40976.xml

ICFP_2010_relative/26875.xml

ICFP_2010_relative/133432.xml

ICFP_2010_relative/27034.xml

ICFP_2010_relative/26986.xml

ICFP_2010_relative/158152.xml

ICFP_2010_relative/48262.xml

ICFP_2010_relative/167087.xml

ICFP_2010_relative/27026.xml

ICFP_2010_relative/26845.xml

ICFP_2010_relative/41427.xml

ICFP_2010_relative/26946.xml

ICFP_2010_relative/26127.xml

ICFP_2010_relative/132848.xml

ICFP_2010_relative/56144.xml

ICFP_2010_relative/45757.xml

ICFP_2010_relative/41865.xml

ICFP_2010_relative/135505.xml

ICFP_2010_relative/135659.xml

ICFP_2010_relative/254704.xml

ICFP_2010_relative/167452.xml

ICFP_2010_relative/26123.xml

ICFP_2010_relative/167240.xml

ICFP_2010_relative/166001.xml

ICFP_2010_relative/27280.xml

ICFP_2010_relative/157713.xml

ICFP_2010_relative/138089.xml

ICFP_2010_relative/182946.xml

ICFP_2010_relative/153288.xml

ICFP_2010_relative/130962.xml

ICFP_2010_relative/211915.xml

ICFP_2010_relative/48374.xml

ICFP_2010_relative/157466.xml

ICFP_2010_relative/26186.xml

ICFP_2010_relative/152786.xml

ICFP_2010_relative/53216.xml

ICFP_2010_relative/133236.xml

ICFP_2010_relative/27036.xml

ICFP_2010_relative/259625.xml

ICFP_2010_relative/26949.xml

ICFP_2010_relative/26871.xml

ICFP_2010_relative/162016.xml

ICFP_2010_relative/137621.xml

ICFP_2010_relative/161917.xml

ICFP_2010_relative/165755.xml

ICFP_2010_relative/153090.xml

ICFP_2010_relative/150877.xml

ICFP_2010_relative/130304.xml

ICFP_2010_relative/167041.xml

ICFP_2010_relative/28838.xml

ICFP_2010_relative/133079.xml

ICFP_2010_relative/28293.xml

ICFP_2010_relative/130472.xml

ICFP_2010_relative/160475.xml

ICFP_2010_relative/26940.xml

ICFP_2010_relative/212043.xml

ICFP_2010_relative/42170.xml

ICFP_2010_relative/186775.xml

ICFP_2010_relative/153243.xml

ICFP_2010_relative/149277.xml

ICFP_2010_relative/26226.xml

ICFP_2010_relative/97885.xml

Strategy_removed_mixed_05/ex6.xml

Strategy_removed_mixed_05/ex3.xml

Strategy_removed_mixed_05/ex1.xml

TCT_09/ma2.xml

HirokawaMiddeldorp_04/n008.xml

Strategy_removed_AG01/#4.19.xml

Strategy_removed_AG01/#4.21.xml

Strategy_removed_AG01/#4.37a.xml

Strategy_removed_AG01/#4.37.xml

Strategy_removed_AG01/#4.34.xml

Strategy_removed_AG01/#4.26.xml

Strategy_removed_AG01/#4.30.xml

Strategy_removed_AG01/#4.27.xml

Strategy_removed_AG01/#4.25.xml

Strategy_removed_AG01/#4.30a.xml

ICFP_2010/26555.xml

Strategy_removed_AG01/#4.20.xml

Strategy_removed_AG01/#4.35.xml

Strategy_removed_AG01/#4.23.xml

Strategy_removed_AG01/#4.22.xml

Strategy_removed_AG01/#4.29.xml

Strategy_removed_AG01/#4.33.xml

Strategy_removed_AG01/#4.36.xml

Strategy_removed_AG01/#4.32.xml

Strategy_removed_AG01/#4.28.xml

Strategy_removed_AG01/#4.20a.xml

Strategy_removed_AG01/#4.30b.xml

TCT_09/bits.xml

TCT_09/ma5.xml

Strategy_removed_mixed_05/ex5.xml

Strategy_removed_mixed_05/ex2.xml

Strategy_removed_mixed_05/ex4.xml

ICFP_2010_relative/150468.xml

ICFP_2010_relative/27009.xml

ICFP_2010_relative/150188.xml

ICFP_2010_relative/149319.xml

ICFP_2010_relative/27134.xml

ICFP_2010_relative/153034.xml

ICFP_2010_relative/26976.xml

ICFP_2010_relative/186333.xml

ICFP_2010_relative/165904.xml

ICFP_2010_relative/136354.xml

ICFP_2010_relative/48686.xml

ICFP_2010_relative/27023.xml

ICFP_2010_relative/185453.xml

ICFP_2010_relative/160068.xml

ICFP_2010_relative/186222.xml

ICFP_2010_relative/27235.xml

ICFP_2010_relative/214011.xml

ICFP_2010_relative/26943.xml

ICFP_2010_relative/28643.xml

ICFP_2010_relative/157150.xml

ICFP_2010_relative/26903.xml

ICFP_2010_relative/259405.xml

ICFP_2010_relative/212308.xml

ICFP_2010_relative/186919.xml

ICFP_2010_relative/48267.xml

ICFP_2010_relative/40540.xml

ICFP_2010_relative/26896.xml

ICFP_2010_relative/180915.xml

ICFP_2010_relative/167433.xml

ICFP_2010_relative/91218.xml

ICFP_2010_relative/25775.xml

ICFP_2010_relative/160364.xml

ICFP_2010_relative/57355.xml

ICFP_2010_relative/40708.xml

ICFP_2010_relative/186973.xml

ICFP_2010_relative/188296.xml

ICFP_2010_relative/186810.xml

ICFP_2010_relative/152865.xml

ICFP_2010_relative/147437.xml

ICFP_2010_relative/44332.xml

ICFP_2010_relative/165713.xml

ICFP_2010_relative/26886.xml

ICFP_2010_relative/91233.xml

ICFP_2010_relative/167526.xml

ICFP_2010_relative/152694.xml

ICFP_2010_relative/150839.xml

ICFP_2010_relative/41843.xml

ICFP_2010_relative/26993.xml

ICFP_2010_relative/157161.xml

ICFP_2010_relative/45720.xml

ICFP_2010_relative/43603.xml

ICFP_2010_relative/160427.xml

ICFP_2010_relative/149251.xml

ICFP_2010_relative/186617.xml

ICFP_2010_relative/153170.xml

ICFP_2010_relative/161533.xml

ICFP_2010_relative/166493.xml

ICFP_2010_relative/150067.xml

ICFP_2010_relative/43621.xml

ICFP_2010_relative/136497.xml

ICFP_2010_relative/161864.xml

ICFP_2010_relative/160660.xml

ICFP_2010_relative/130161.xml

ICFP_2010_relative/150630.xml

ICFP_2010_relative/137956.xml

ICFP_2010_relative/26954.xml

ICFP_2010_relative/26110.xml

ICFP_2010_relative/25743.xml

ICFP_2010_relative/136934.xml

ICFP_2010_relative/137136.xml

ICFP_2010_relative/161593.xml

ICFP_2010_relative/27003.xml

ICFP_2010_relative/91254.xml

ICFP_2010_relative/26969.xml

ICFP_2010_relative/150258.xml

ICFP_2010_relative/188004.xml

ICFP_2010_relative/136280.xml

ICFP_2010_relative/160210.xml

ICFP_2010_relative/167310.xml

ICFP_2010_relative/42683.xml

ICFP_2010_relative/40033.xml

ICFP_2010_relative/167391.xml

ICFP_2010_relative/167294.xml

ICFP_2010_relative/158342.xml

ICFP_2010_relative/149633.xml

ICFP_2010_relative/158208.xml

ICFP_2010_relative/26957.xml

ICFP_2010_relative/136571.xml

ICFP_2010_relative/151247.xml

ICFP_2010_relative/26862.xml

ICFP_2010_relative/39830.xml

ICFP_2010_relative/167636.xml

ICFP_2010_relative/150815.xml

ICFP_2010_relative/165975.xml

ICFP_2010_relative/157388.xml

ICFP_2010_relative/137316.xml

ICFP_2010_relative/135601.xml

ICFP_2010_relative/25422.xml

ICFP_2010_relative/158620.xml

ICFP_2010_relative/153444.xml

ICFP_2010_relative/26951.xml

ICFP_2010_relative/25736.xml

ICFP_2010_relative/135410.xml

ICFP_2010_relative/158477.xml

ICFP_2010_relative/27028.xml

ICFP_2010_relative/149713.xml

ICFP_2010_relative/26974.xml

ICFP_2010_relative/25849.xml

ICFP_2010_relative/162075.xml

ICFP_2010_relative/42466.xml

ICFP_2010_relative/149849.xml

ICFP_2010_relative/213560.xml

ICFP_2010_relative/26931.xml

ICFP_2010_relative/58125.xml

ICFP_2010_relative/26980.xml

ICFP_2010_relative/24100.xml

ICFP_2010_relative/43650.xml

ICFP_2010_relative/150725.xml

ICFP_2010_relative/26105.xml

ICFP_2010_relative/88183.xml

ICFP_2010_relative/27019.xml

ICFP_2010_relative/135714.xml

ICFP_2010_relative/50904.xml

ICFP_2010_relative/160324.xml

ICFP_2010_relative/26116.xml

ICFP_2010_relative/166848.xml

ICFP_2010_relative/26132.xml

ICFP_2010_relative/98623.xml

ICFP_2010_relative/88283.xml

ICFP_2010_relative/27001.xml

ICFP_2010_relative/27015.xml

ICFP_2010_relative/25388.xml

ICFP_2010_relative/149361.xml

ICFP_2010_relative/153371.xml

ICFP_2010_relative/26741.xml

ICFP_2010_relative/160254.xml

ICFP_2010_relative/26998.xml

ICFP_2010_relative/213437.xml

ICFP_2010_relative/26965.xml

ICFP_2010_relative/166465.xml

ICFP_2010_relative/3927.xml

ICFP_2010_relative/263745.xml

ICFP_2010_relative/26923.xml

Transformed_outermost_08/cariboo_ex6.xml

Transformed_outermost_08/cariboo_ex5.xml

Zantema_04/z080.xml

Strategy_removed_AG01/#4.18.xml

Waldmann_06/jwno9.xml

Strategy_outermost_added_08/2.05.xml

Strategy_removed_AG01/#4.15.xml

Strategy_outermost_added_08/4.49.xml

Strategy_outermost_added_08/4.40.xml

Strategy_removed_AG01/#4.7.xml

Strategy_outermost_added_08/003.xml

Strategy_outermost_added_08/n003.xml

Strategy_outermost_added_08/ex6.xml

Strategy_outermost_added_08/TypeEx5.xml

Waldmann_06/jwno1.xml

Strategy_removed_AG01/#4.13.xml

Strategy_outermost_added_08/termMonTypes.xml

Strategy_outermost_added_08/4.54.xml

Strategy_outermost_added_08/Ex1_Zan97_Z.xml

Strategy_outermost_added_08/Ex1_GM99_Z.xml

Strategy_outermost_added_08/n002.xml

Strategy_removed_AG01/#4.16.xml

Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_Z.xml

Strategy_outermost_added_08/n005.xml

Strategy_outermost_added_08/Ex9_Luc06_Z.xml

Strategy_outermost_added_08/Ex24_Luc06_Z.xml

Strategy_outermost_added_08/nonTermF.xml

Strategy_outermost_added_08/round_nonterm.xml

Strategy_removed_mixed_05/toyama.xml

Strategy_removed_mixed_05/test76.xml

Strategy_removed_mixed_05/muladd.xml

Strategy_removed_mixed_05/tricky1.xml

Strategy_removed_mixed_05/n001.xml

Strategy_removed_mixed_05/test9.xml

Mixed_innermost/thiemann26i.xml

Strategy_outermost_added_08/nonterm.xml

Strategy_removed_CSR_05/Ex24_GM04.xml

Strategy_removed_CSR_05/Ex5_Zan97.xml

Strategy_removed_CSR_05/Ex2_Luc03b.xml

Strategy_removed_CSR_05/Ex1_GM03.xml

Strategy_removed_CSR_05/Ex4_7_77_Bor03.xml

Strategy_removed_CSR_05/Ex4_7_37_Bor03.xml

Strategy_removed_CSR_05/Ex6_15_AEL02.xml

Strategy_removed_CSR_05/Ex4_4_Luc96b.xml

Strategy_removed_CSR_05/Ex49_GM04.xml

Strategy_removed_CSR_05/ExIntrod_GM01.xml

Strategy_removed_CSR_05/Ex15_Luc98.xml

Strategy_removed_CSR_05/Ex3_2_Luc97.xml

Strategy_removed_CSR_05/Ex8_BLR02.xml

Strategy_removed_CSR_05/Ex3_3_25_Bor03.xml

Strategy_removed_CSR_05/ExConc_Zan97.xml

Strategy_removed_CSR_05/Ex1_GM99.xml

Strategy_removed_CSR_05/Ex1_Zan97.xml

Strategy_removed_CSR_05/Ex6_Luc98.xml

Strategy_outermost_added_08/cime4.xml

Zantema_08/toyama_out.xml

Transformed_CSR_04/LengthOfFiniteLists_nosorts_FR.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/PEANO_nokinds_noand_iGM.xml

Transformed_CSR_innermost_04/Ex1_GM03_C.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_noand_iGM.xml

Transformed_CSR_innermost_04/Ex2_Luc02a_L.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_noand_iGM.xml

Transformed_CSR_innermost_04/Ex4_7_37_Bor03_C.xml

Transformed_CSR_innermost_04/ExIntrod_GM01_C.xml

Transformed_CSR_innermost_04/Ex6_GM04_iGM.xml

Transformed_CSR_innermost_04/Ex8_BLR02_C.xml

Transformed_CSR_innermost_04/Ex24_Luc06_C.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_C.xml

Transformed_CSR_innermost_04/Ex15_Luc98_GM.xml

Transformed_CSR_04/Ex3_3_25_Bor03_Z.xml

Transformed_CSR_innermost_04/PEANO_nokinds_GM.xml

Transformed_CSR_innermost_04/Ex1_Luc02b_iGM.xml

Transformed_CSR_innermost_04/Ex1_GM99_C.xml

Transformed_CSR_innermost_04/Ex1_Zan97_C.xml

Transformed_CSR_04/Ex4_4_Luc96b_FR.xml

Transformed_CSR_innermost_04/Ex4_7_56_Bor03_C.xml

Transformed_CSR_innermost_04/PALINDROME_complete_GM.xml

Transformed_CSR_04/Ex14_Luc06_FR.xml

Transformed_CSR_innermost_04/Ex16_Luc06_GM.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_GM.xml

Transformed_CSR_innermost_04/Ex9_BLR02_GM.xml

Transformed_CSR_04/Ex14_Luc06_L.xml

Transformed_CSR_innermost_04/PEANO_nosorts_GM.xml

Transformed_CSR_innermost_04/Ex1_GM03_GM.xml

Transformed_CSR_innermost_04/Ex26_Luc03b_GM.xml

Transformed_CSR_04/Ex14_AEGL02_FR.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_noand_iGM.xml

Transformed_CSR_04/LengthOfFiniteLists_nosorts-noand_FR.xml

Transformed_CSR_innermost_04/OvConsOS_complete_GM.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_GM.xml

Transformed_CSR_innermost_04/Ex1_GL02a_iGM.xml

Transformed_CSR_innermost_04/Ex24_Luc06_GM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_GM.xml

Transformed_CSR_innermost_04/MYNAT_complete_GM.xml

Transformed_CSR_04/ExIntrod_GM04_FR.xml

Transformed_CSR_innermost_04/Ex49_GM04_iGM.xml

Transformed_CSR_innermost_04/Ex9_Luc04_C.xml

Transformed_CSR_04/ExIntrod_Zan97_Z.xml

Transformed_CSR_innermost_04/Ex18_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex4_7_37_Bor03_iGM.xml

Transformed_CSR_innermost_04/Ex3_3_25_Bor03_C.xml

Transformed_CSR_04/ExIntrod_GM01_Z.xml

Transformed_CSR_innermost_04/ExIntrod_GM99_iGM.xml

Transformed_CSR_04/Ex16_Luc06_L.xml

Transformed_CSR_innermost_04/Ex15_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex1_2_AEL03_C.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_iGM.xml

Transformed_CSR_innermost_04/Ex4_7_77_Bor03_GM.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_iGM.xml

Transformed_CSR_innermost_04/Ex7_BLR02_GM.xml

Transformed_CSR_innermost_04/Ex4_7_56_Bor03_GM.xml

Transformed_CSR_innermost_04/ExSec4_2_DLMMU04_iGM.xml

Transformed_CSR_innermost_04/ExIntrod_GM99_GM.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/Ex18_Luc06_L.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nosorts_noand_GM.xml

Transformed_CSR_innermost_04/Ex4_7_15_Bor03_L.xml

Transformed_CSR_innermost_04/MYNAT_complete_noand_C.xml

Transformed_CSR_04/Ex24_Luc06_L.xml

Transformed_CSR_innermost_04/Ex9_Luc06_GM.xml

Transformed_CSR_innermost_04/MYNAT_complete_iGM.xml

Transformed_CSR_innermost_04/Ex9_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex2_Luc02a_GM.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_GM.xml

Transformed_CSR_innermost_04/Ex5_Zan97_C.xml

Transformed_CSR_innermost_04/Ex5_DLMMU04_iGM.xml

Transformed_CSR_innermost_04/PEANO_complete_C.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_C.xml

Transformed_CSR_innermost_04/Ex1_2_Luc02c_iGM.xml

Transformed_CSR_innermost_04/Ex6_9_Luc02c_GM.xml

Transformed_CSR_innermost_04/Ex3_3_25_Bor03_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_complete_GM.xml

Transformed_CSR_innermost_04/Ex4_7_15_Bor03_iGM.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_iGM.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_noand_GM.xml

Transformed_CSR_innermost_04/Ex4_Zan97_GM.xml

Transformed_CSR_innermost_04/ExIntrod_GM99_C.xml

Transformed_CSR_innermost_04/ExIntrod_Zan97_C.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_noand_C.xml

Transformed_CSR_innermost_04/PEANO_nokinds_noand_GM.xml

Transformed_CSR_innermost_04/Ex4_Zan97_C.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_noand_C.xml

Transformed_CSR_innermost_04/Ex1_GL02a_GM.xml

Transformed_CSR_innermost_04/Ex1_Luc04b_C.xml

Transformed_CSR_innermost_04/Ex1_2_Luc02c_C.xml

Transformed_CSR_innermost_04/PEANO_nosorts_iGM.xml

Transformed_CSR_innermost_04/Ex24_GM04_iGM.xml

Transformed_CSR_innermost_04/Ex1_Luc02b_GM.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_noand_iGM.xml

Transformed_CSR_innermost_04/ExIntrod_Zan97_iGM.xml

Transformed_CSR_innermost_04/ExIntrod_GM04_GM.xml

Transformed_CSR_innermost_04/PALINDROME_complete_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_C.xml

Transformed_CSR_innermost_04/Ex5_DLMMU04_C.xml

Transformed_CSR_innermost_04/Ex6_GM04_C.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_noand_C.xml

Transformed_CSR_innermost_04/ExAppendixB_AEL03_iGM.xml

Transformed_CSR_innermost_04/Ex1_2_AEL03_iGM.xml

Transformed_CSR_innermost_04/PEANO_nokinds_C.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_iGM.xml

Transformed_CSR_innermost_04/Ex26_Luc03b_C.xml

Transformed_CSR_innermost_04/MYNAT_nosorts_C.xml

Transformed_CSR_innermost_04/Ex1_GM99_GM.xml

Transformed_CSR_innermost_04/OvConsOS_nokinds_noand_C.xml

Transformed_CSR_innermost_04/Ex1_Luc04b_iGM.xml

Transformed_CSR_innermost_04/Ex5_DLMMU04_GM.xml

Transformed_CSR_innermost_04/MYNAT_nokinds_GM.xml

Transformed_CSR_innermost_04/Ex1_GM99_iGM.xml

Transformed_CSR_innermost_04/Ex5_Zan97_GM.xml

Transformed_CSR_innermost_04/Ex25_Luc06_iGM.xml

Transformed_CSR_innermost_04/Ex9_Luc04_GM.xml

Transformed_CSR_innermost_04/ExAppendixB_AEL03_GM.xml

Transformed_CSR_innermost_04/OvConsOS_complete_noand_GM.xml

Transformed_CSR_innermost_04/Ex4_7_37_Bor03_GM.xml

Transformed_CSR_innermost_04/Ex1_Luc02b_C.xml

Transformed_CSR_04/ExIntrod_GM01_FR.xml

Transformed_CSR_innermost_04/Ex49_GM04_C.xml

Transformed_CSR_04/Ex1_GM99_FR.xml

Transformed_CSR_innermost_04/Ex2_Luc02a_iGM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_noand_iGM.xml

Transformed_CSR_innermost_04/Ex4_4_Luc96b_GM.xml

Transformed_CSR_innermost_04/PALINDROME_nosorts_noand_C.xml

Transformed_CSR_innermost_04/PEANO_nokinds_iGM.xml

Transformed_CSR_innermost_04/Ex9_BLR02_L.xml

Transformed_CSR_innermost_04/Ex23_Luc06_L.xml

Transformed_CSR_04/LengthOfFiniteLists_complete-noand_Z.xml

Transformed_CSR_innermost_04/Ex14_AEGL02_iGM.xml

Transformed_CSR_innermost_04/Ex26_Luc03b_L.xml

Transformed_CSR_innermost_04/Ex5_Zan97_iGM.xml

Transformed_CSR_04/Ex9_Luc04_L.xml

Transformed_CSR_innermost_04/ExConc_Zan97_GM.xml

Transformed_CSR_04/Ex14_AEGL02_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_complete_C.xml

Transformed_CSR_innermost_04/MYNAT_complete_noand_GM.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nosorts_iGM.xml

Transformed_CSR_innermost_04/Ex23_Luc06_GM.xml

Transformed_CSR_innermost_04/OvConsOS_nosorts_C.xml

Transformed_CSR_innermost_04/Ex15_Luc06_GM.xml

Transformed_CSR_innermost_04/Ex14_AEGL02_GM.xml

Transformed_CSR_innermost_04/Ex5_7_Luc97_GM.xml

Transformed_CSR_04/Ex6_15_AEL02_Z.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_noand_C.xml

Transformed_CSR_innermost_04/PALINDROME_nokinds_C.xml

Transformed_CSR_innermost_04/ExConc_Zan97_L.xml

Transformed_CSR_innermost_04/Ex4_DLMMU04_GM.xml

Transformed_CSR_innermost_04/PEANO_complete_noand_iGM.xml

Transformed_CSR_innermost_04/PEANO_nosorts_noand_iGM.xml

Transformed_CSR_innermost_04/ExAppendixB_AEL03_C.xml

Transformed_CSR_04/OvConsOS_nosorts_Z.xml

Transformed_CSR_innermost_04/Ex4_4_Luc96b_C.xml

Transformed_CSR_innermost_04/OvConsOS_complete_iGM.xml

Transformed_CSR_innermost_04/Ex16_Luc06_C.xml

Transformed_CSR_innermost_04/LengthOfFiniteLists_nokinds_noand_GM.xml

Transformed_CSR_04/ExIntrod_GM04_Z.xml

Transformed_CSR_04/LengthOfFiniteLists_complete-noand_FR.xml

Transformed_CSR_04/Ex14_AEGL02_L.xml

Transformed_CSR_innermost_04/Ex18_Luc06_C.xml

Transformed_CSR_innermost_04/Ex1_GL02a_C.xml

Transformed_CSR_innermost_04/Ex9_Luc04_iGM.xml

Transformed_CSR_04/Ex5_DLMMU04_FR.xml

Transformed_CSR_04/ExIntrod_GM99_Z.xml

Transformed_CSR_innermost_04/Ex26_Luc03b_iGM.xml

Transformed_CSR_innermost_04/LISTUTILITIES_nokinds_noand_GM.xml

File:DC-8.0.txt

2011-03-01T15:05:25Z

Zini: DC testbed for TPDB 8.0

TRS/ICFP_2010/211639.xml

TRS/ICFP_2010/96612.xml

TRS/ICFP_2010/167087.xml

TRS/ICFP_2010/3939.xml

TRS/ICFP_2010/132957.xml

TRS/ICFP_2010/4002.xml

TRS/ICFP_2010/28464.xml

TRS/ICFP_2010/26127.xml

TRS/ICFP_2010/4847.xml

TRS/ICFP_2010/213281.xml

TRS/ICFP_2010/130304.xml

TRS/ICFP_2010/4979.xml

TRS/ICFP_2010/3989.xml

TRS/ICFP_2010/135601.xml

TRS/ICFP_2010/137799.xml

TRS/ICFP_2010/48686.xml

TRS/ICFP_2010/27235.xml

TRS/ICFP_2010/40708.xml

TRS/ICFP_2010/157466.xml

TRS/ICFP_2010/230819.xml

TRS/ICFP_2010/26951.xml

TRS/ICFP_2010/161930.xml

TRS/ICFP_2010/96119.xml

TRS/ICFP_2010/139018.xml

TRS/ICFP_2010/264033.xml

TRS/ICFP_2010/54622.xml

TRS/ICFP_2010/212308.xml

TRS/ICFP_2010/51842.xml

TRS/ICFP_2010/135505.xml

TRS/ICFP_2010/167294.xml

TRS/ICFP_2010/259405.xml

TRS/ICFP_2010/137715.xml

TRS/ICFP_2010/4029.xml

TRS/ICFP_2010/188696.xml

TRS/ICFP_2010/26110.xml

TRS/ICFP_2010/139185.xml

TRS/ICFP_2010/212062.xml

TRS/ICFP_2010/26910.xml

TRS/ICFP_2010/158208.xml

TRS/ICFP_2010/91218.xml

TRS/ICFP_2010/95952.xml

TRS/ICFP_2010/43621.xml

TRS/ICFP_2010/57132.xml

TRS/ICFP_2010/137136.xml

TRS/ICFP_2010/4200.xml

TRS/ICFP_2010/3770.xml

TRS/ICFP_2010/86745.xml

TRS/ICFP_2010/96156.xml

TRS/ICFP_2010/25775.xml

TRS/ICFP_2010/149849.xml

TRS/ICFP_2010/140287.xml

TRS/ICFP_2010/86025.xml

TRS/ICFP_2010/183803.xml

TRS/ICFP_2010/150815.xml

TRS/ICFP_2010/54532.xml

TRS/ICFP_2010/26954.xml

TRS/ICFP_2010/26978.xml

TRS/ICFP_2010/247254.xml

TRS/ICFP_2010/3705.xml

TRS/ICFP_2010/186023.xml

TRS/ICFP_2010/65081.xml

TRS/ICFP_2010/188238.xml

TRS/ICFP_2010/212043.xml

TRS/ICFP_2010/27028.xml

TRS/ICFP_2010/5011.xml

TRS/ICFP_2010/186333.xml

TRS/ICFP_2010/41843.xml

TRS/ICFP_2010/212026.xml

TRS/ICFP_2010/27026.xml

TRS/ICFP_2010/96104.xml

TRS/ICFP_2010/213537.xml

TRS/ICFP_2010/91254.xml

TRS/ICFP_2010/88283.xml

TRS/ICFP_2010/41838.xml

TRS/ICFP_2010/139167.xml

TRS/ICFP_2010/140664.xml

TRS/ICFP_2010/150839.xml

TRS/ICFP_2010/160398.xml

TRS/ICFP_2010/91242.xml

TRS/ICFP_2010/128691.xml

TRS/ICFP_2010/128486.xml

TRS/ICFP_2010/42466.xml

TRS/ICFP_2010/97885.xml

TRS/ICFP_2010/25192.xml

TRS/ICFP_2010/27280.xml

TRS/ICFP_2010/166001.xml

TRS/ICFP_2010/230948.xml

TRS/ICFP_2010/26916.xml

TRS/ICFP_2010/132611.xml

TRS/ICFP_2010/68535.xml

TRS/ICFP_2010/26903.xml

TRS/ICFP_2010/27034.xml

TRS/ICFP_2010/147437.xml

TRS/ICFP_2010/213407.xml

TRS/ICFP_2010/3842.xml

TRS/ICFP_2010/247992.xml

TRS/ICFP_2010/133432.xml

TRS/ICFP_2010/85477.xml

TRS/ICFP_2010/214169.xml

TRS/ICFP_2010/133532.xml

TRS/ICFP_2010/165755.xml

TRS/ICFP_2010/138330.xml

TRS/ICFP_2010/167452.xml

TRS/ICFP_2010/158477.xml

TRS/ICFP_2010/4074.xml

TRS/ICFP_2010/88143.xml

TRS/ICFP_2010/157436.xml

TRS/ICFP_2010/4106.xml

TRS/ICFP_2010/150188.xml

TRS/ICFP_2010/26965.xml

TRS/ICFP_2010/41865.xml

TRS/ICFP_2010/212480.xml

TRS/ICFP_2010/26974.xml

TRS/ICFP_2010/26103.xml

TRS/ICFP_2010/45970.xml

TRS/ICFP_2010/160068.xml

TRS/ICFP_2010/151247.xml

TRS/ICFP_2010/128620.xml

TRS/ICFP_2010/186919.xml

TRS/ICFP_2010/4964.xml

TRS/ICFP_2010/85749.xml

TRS/ICFP_2010/4141.xml

TRS/ICFP_2010/57278.xml

TRS/ICFP_2010/132720.xml

TRS/ICFP_2010/25731.xml

TRS/ICFP_2010/167433.xml

TRS/ICFP_2010/160427.xml

TRS/ICFP_2010/4938.xml

TRS/ICFP_2010/86052.xml

TRS/ICFP_2010/26940.xml

TRS/ICFP_2010/139100.xml

TRS/ICFP_2010/29415.xml

TRS/ICFP_2010/85294.xml

TRS/ICFP_2010/135652.xml

TRS/ICFP_2010/254704.xml

TRS/ICFP_2010/136571.xml

TRS/ICFP_2010/3467.xml

TRS/ICFP_2010/139256.xml

TRS/ICFP_2010/158620.xml

TRS/ICFP_2010/27036.xml

TRS/ICFP_2010/3930.xml

TRS/ICFP_2010/182946.xml

TRS/ICFP_2010/158152.xml

TRS/ICFP_2010/212892.xml

TRS/ICFP_2010/85920.xml

TRS/ICFP_2010/96642.xml

TRS/ICFP_2010/107193.xml

TRS/ICFP_2010/96485.xml

TRS/ICFP_2010/133010.xml

TRS/ICFP_2010/4920.xml

TRS/ICFP_2010/40033.xml

TRS/ICFP_2010/211915.xml

TRS/ICFP_2010/25849.xml

TRS/ICFP_2010/96176.xml

TRS/ICFP_2010/264370.xml

TRS/ICFP_2010/153243.xml

TRS/ICFP_2010/4991.xml

TRS/ICFP_2010/142142.xml

TRS/ICFP_2010/247906.xml

TRS/ICFP_2010/153034.xml

TRS/ICFP_2010/51424.xml

TRS/ICFP_2010/246924.xml

TRS/ICFP_2010/96563.xml

TRS/ICFP_2010/25734.xml

TRS/ICFP_2010/137087.xml

TRS/ICFP_2010/132969.xml

TRS/ICFP_2010/68322.xml

TRS/ICFP_2010/132738.xml

TRS/ICFP_2010/167041.xml

TRS/ICFP_2010/58221.xml

TRS/ICFP_2010/88208.xml

TRS/ICFP_2010/213218.xml

TRS/ICFP_2010/58301.xml

TRS/ICFP_2010/139025.xml

TRS/ICFP_2010/41688.xml

TRS/ICFP_2010/149361.xml

TRS/ICFP_2010/27009.xml

TRS/ICFP_2010/187254.xml

TRS/ICFP_2010/85345.xml

TRS/ICFP_2010/27019.xml

TRS/ICFP_2010/58125.xml

TRS/ICFP_2010/41378.xml

TRS/ICFP_2010/25808.xml

TRS/ICFP_2010/107236.xml

TRS/ICFP_2010/26976.xml

TRS/ICFP_2010/26123.xml

TRS/ICFP_2010/96198.xml

TRS/ICFP_2010/40093.xml

TRS/ICFP_2010/96302.xml

TRS/ICFP_2010/136354.xml

TRS/ICFP_2010/231480.xml

TRS/ICFP_2010/4827.xml

TRS/ICFP_2010/25422.xml

TRS/ICFP_2010/157275.xml

TRS/ICFP_2010/133079.xml

TRS/ICFP_2010/140318.xml

TRS/ICFP_2010/142146.xml

TRS/ICFP_2010/153371.xml

TRS/ICFP_2010/26130.xml

TRS/ICFP_2010/140359.xml

TRS/ICFP_2010/4314.xml

TRS/ICFP_2010/96464.xml

TRS/ICFP_2010/88172.xml

TRS/ICFP_2010/64160.xml

TRS/ICFP_2010/50904.xml

TRS/ICFP_2010/157593.xml

TRS/ICFP_2010/213437.xml

TRS/ICFP_2010/4374.xml

TRS/ICFP_2010/84977.xml

TRS/ICFP_2010/51577.xml

TRS/ICFP_2010/85650.xml

TRS/ICFP_2010/48328.xml

TRS/ICFP_2010/4819.xml

TRS/ICFP_2010/3817.xml

TRS/ICFP_2010/97917.xml

TRS/ICFP_2010/26980.xml

TRS/ICFP_2010/4017.xml

TRS/ICFP_2010/3861.xml

TRS/ICFP_2010/167310.xml

TRS/ICFP_2010/212263.xml

TRS/ICFP_2010/3336.xml

TRS/ICFP_2010/160364.xml

TRS/ICFP_2010/26896.xml

TRS/ICFP_2010/4953.xml

TRS/ICFP_2010/231230.xml

TRS/ICFP_2010/160263.xml

TRS/ICFP_2010/150258.xml

TRS/ICFP_2010/3498.xml

TRS/ICFP_2010/98623.xml

TRS/ICFP_2010/188674.xml

TRS/ICFP_2010/132540.xml

TRS/ICFP_2010/167636.xml

TRS/ICFP_2010/140639.xml

TRS/ICFP_2010/26105.xml

TRS/ICFP_2010/43987.xml

TRS/ICFP_2010/139004.xml

TRS/ICFP_2010/162244.xml

TRS/ICFP_2010/138993.xml

TRS/ICFP_2010/149319.xml

TRS/ICFP_2010/149713.xml

TRS/ICFP_2010/39830.xml

TRS/ICFP_2010/160210.xml

TRS/ICFP_2010/247504.xml

TRS/ICFP_2010/167742.xml

TRS/ICFP_2010/139174.xml

TRS/ICFP_2010/161533.xml

TRS/ICFP_2010/26875.xml

TRS/ICFP_2010/136623.xml

TRS/ICFP_2010/139036.xml

TRS/ICFP_2010/3856.xml

TRS/ICFP_2010/137956.xml

TRS/ICFP_2010/3680.xml

TRS/ICFP_2010/133236.xml

TRS/ICFP_2010/26116.xml

TRS/ICFP_2010/95899.xml

TRS/ICFP_2010/135410.xml

TRS/ICFP_2010/138254.xml

TRS/ICFP_2010/160324.xml

TRS/ICFP_2010/186810.xml

TRS/ICFP_2010/42321.xml

TRS/ICFP_2010/4248.xml

TRS/ICFP_2010/157161.xml

TRS/ICFP_2010/158342.xml

TRS/ICFP_2010/40976.xml

TRS/ICFP_2010/249386.xml

TRS/ICFP_2010/135659.xml

TRS/ICFP_2010/84886.xml

TRS/ICFP_2010/26933.xml

TRS/ICFP_2010/91210.xml

TRS/ICFP_2010/25416.xml

TRS/ICFP_2010/26946.xml

TRS/ICFP_2010/25409.xml

TRS/ICFP_2010/167391.xml

TRS/ICFP_2010/128515.xml

TRS/ICFP_2010/96417.xml

TRS/ICFP_2010/132235.xml

TRS/ICFP_2010/26741.xml

TRS/ICFP_2010/27006.xml

TRS/ICFP_2010/166558.xml

TRS/ICFP_2010/26993.xml

TRS/ICFP_2010/138142.xml

TRS/ICFP_2010/124211.xml

TRS/ICFP_2010/132864.xml

TRS/ICFP_2010/4816.xml

TRS/ICFP_2010/27131.xml

TRS/ICFP_2010/259625.xml

TRS/ICFP_2010/139236.xml

TRS/ICFP_2010/213865.xml

TRS/ICFP_2010/26927.xml

TRS/ICFP_2010/135936.xml

TRS/ICFP_2010/42170.xml

TRS/ICFP_2010/86857.xml

TRS/ICFP_2010/3927.xml

TRS/ICFP_2010/26986.xml

TRS/ICFP_2010/25388.xml

TRS/ICFP_2010/212189.xml

TRS/ICFP_2010/160660.xml

TRS/ICFP_2010/58194.xml

TRS/ICFP_2010/231149.xml

TRS/ICFP_2010/3633.xml

TRS/ICFP_2010/185453.xml

TRS/ICFP_2010/149915.xml

TRS/ICFP_2010/139190.xml

TRS/ICFP_2010/26871.xml

TRS/ICFP_2010/4934.xml

TRS/ICFP_2010/26998.xml

TRS/ICFP_2010/28293.xml

TRS/ICFP_2010/231043.xml

TRS/ICFP_2010/186617.xml

TRS/ICFP_2010/4057.xml

TRS/ICFP_2010/160234.xml

TRS/ICFP_2010/26226.xml

TRS/ICFP_2010/26931.xml

TRS/ICFP_2010/136280.xml

TRS/ICFP_2010/136323.xml

TRS/ICFP_2010/96029.xml

TRS/ICFP_2010/213147.xml

TRS/ICFP_2010/5109.xml

TRS/ICFP_2010/180915.xml

TRS/ICFP_2010/54097.xml

TRS/ICFP_2010/96256.xml

TRS/ICFP_2010/96403.xml

TRS/ICFP_2010/159731.xml

TRS/ICFP_2010/26186.xml

TRS/ICFP_2010/3865.xml

TRS/ICFP_2010/138089.xml

TRS/ICFP_2010/136562.xml

TRS/ICFP_2010/4840.xml

TRS/ICFP_2010/96334.xml

TRS/ICFP_2010/161519.xml

TRS/ICFP_2010/211978.xml

TRS/ICFP_2010/136497.xml

TRS/ICFP_2010/95978.xml

TRS/ICFP_2010/264405.xml

TRS/ICFP_2010/167526.xml

TRS/ICFP_2010/231300.xml

TRS/ICFP_2010/139180.xml

TRS/ICFP_2010/4854.xml

TRS/ICFP_2010/25726.xml

TRS/ICFP_2010/157713.xml

TRS/ICFP_2010/85380.xml

TRS/ICFP_2010/124791.xml

TRS/ICFP_2010/86499.xml

TRS/ICFP_2010/137316.xml

TRS/ICFP_2010/130472.xml

TRS/ICFP_2010/212774.xml

TRS/ICFP_2010/137404.xml

TRS/ICFP_2010/39849.xml

TRS/ICFP_2010/27015.xml

TRS/ICFP_2010/214091.xml

TRS/ICFP_2010/188296.xml

TRS/ICFP_2010/249663.xml

TRS/ICFP_2010/157388.xml

TRS/ICFP_2010/86617.xml

TRS/ICFP_2010/88156.xml

TRS/ICFP_2010/248060.xml

TRS/ICFP_2010/26862.xml

TRS/ICFP_2010/249459.xml

TRS/ICFP_2010/153288.xml

TRS/ICFP_2010/26845.xml

TRS/ICFP_2010/26949.xml

TRS/ICFP_2010/131633.xml

TRS/ICFP_2010/211471.xml

TRS/ICFP_2010/3762.xml

TRS/ICFP_2010/188261.xml

TRS/ICFP_2010/160462.xml

TRS/ICFP_2010/160254.xml

TRS/ICFP_2010/57453.xml

TRS/ICFP_2010/26923.xml

TRS/ICFP_2010/135328.xml

TRS/ICFP_2010/85675.xml

TRS/ICFP_2010/4487.xml

TRS/ICFP_2010/27213.xml

TRS/ICFP_2010/153170.xml

TRS/ICFP_2010/184957.xml

TRS/ICFP_2010/26969.xml

TRS/ICFP_2010/96370.xml

TRS/ICFP_2010/139282.xml

TRS/ICFP_2010/85834.xml

TRS/ICFP_2010/4943.xml

TRS/ICFP_2010/142157.xml

TRS/ICFP_2010/213719.xml

TRS/ICFP_2010/165713.xml

TRS/ICFP_2010/137623.xml

TRS/ICFP_2010/211857.xml

TRS/ICFP_2010/152949.xml

TRS/ICFP_2010/86559.xml

TRS/ICFP_2010/86816.xml

TRS/ICFP_2010/27003.xml

TRS/ICFP_2010/44332.xml

TRS/ICFP_2010/86526.xml

TRS/ICFP_2010/140654.xml

TRS/ICFP_2010/85874.xml

TRS/ICFP_2010/3831.xml

TRS/ICFP_2010/85782.xml

TRS/ICFP_2010/128280.xml

TRS/ICFP_2010/27030.xml

TRS/ICFP_2010/148543.xml

TRS/ICFP_2010/214320.xml

TRS/ICFP_2010/57852.xml

TRS/ICFP_2010/96086.xml

TRS/ICFP_2010/214261.xml

TRS/ICFP_2010/142150.xml

TRS/ICFP_2010/166465.xml

TRS/ICFP_2010/162095.xml

TRS/ICFP_2010/26919.xml

TRS/ICFP_2010/45720.xml

TRS/ICFP_2010/96065.xml

TRS/ICFP_2010/107220.xml

TRS/ICFP_2010/4412.xml

TRS/ICFP_2010/134918.xml

TRS/ICFP_2010/3786.xml

TRS/ICFP_2010/152786.xml

TRS/ICFP_2010/167240.xml

TRS/ICFP_2010/128430.xml

TRS/ICFP_2010/25711.xml

TRS/ICFP_2010/130962.xml

TRS/ICFP_2010/86452.xml

TRS/ICFP_2010/139163.xml

TRS/ICFP_2010/5130.xml

TRS/ICFP_2010/138468.xml

TRS/ICFP_2010/3533.xml

TRS/ICFP_2010/26291.xml

TRS/ICFP_2010/26943.xml

TRS/ICFP_2010/24100.xml

TRS/ICFP_2010/3589.xml

TRS/ICFP_2010/56144.xml

TRS/ICFP_2010/4824.xml

TRS/ICFP_2010/4046.xml

TRS/ICFP_2010/85590.xml

TRS/ICFP_2010/127538.xml

TRS/ICFP_2010/131982.xml

TRS/ICFP_2010/3450.xml

TRS/ICFP_2010/3385.xml

TRS/ICFP_2010/28643.xml

TRS/ICFP_2010/149297.xml

TRS/ICFP_2010/137621.xml

TRS/ICFP_2010/27013.xml

TRS/ICFP_2010/149633.xml

TRS/ICFP_2010/133827.xml

TRS/ICFP_2010/161593.xml

TRS/ICFP_2010/132848.xml

TRS/ICFP_2010/123759.xml

TRS/ICFP_2010/85267.xml

TRS/ICFP_2010/139214.xml

TRS/ICFP_2010/149251.xml

TRS/ICFP_2010/212037.xml

TRS/ICFP_2010/133159.xml

TRS/ICFP_2010/3729.xml

TRS/ICFP_2010/4036.xml

TRS/ICFP_2010/140631.xml

TRS/ICFP_2010/4206.xml

TRS/ICFP_2010/213560.xml

TRS/ICFP_2010/153090.xml

TRS/ICFP_2010/138477.xml

TRS/ICFP_2010/161917.xml

TRS/ICFP_2010/3995.xml

TRS/ICFP_2010/136051.xml

TRS/ICFP_2010/26879.xml

TRS/ICFP_2010/43650.xml

TRS/ICFP_2010/135604.xml

TRS/ICFP_2010/28838.xml

TRS/ICFP_2010/247020.xml

TRS/ICFP_2010/88183.xml

TRS/ICFP_2010/136693.xml

TRS/ICFP_2010/91233.xml

TRS/ICFP_2010/150725.xml

TRS/ICFP_2010/86636.xml

TRS/ICFP_2010/137809.xml

TRS/ICFP_2010/230780.xml

TRS/ICFP_2010/45757.xml

TRS/ICFP_2010/135115.xml

TRS/ICFP_2010/128056.xml

TRS/ICFP_2010/212094.xml

TRS/ICFP_2010/3268.xml

TRS/ICFP_2010/212364.xml

TRS/ICFP_2010/139310.xml

TRS/ICFP_2010/3916.xml

TRS/ICFP_2010/25736.xml

TRS/ICFP_2010/3562.xml

TRS/ICFP_2010/135782.xml

TRS/ICFP_2010/212117.xml

TRS/ICFP_2010/5076.xml

TRS/ICFP_2010/152694.xml

TRS/ICFP_2010/133881.xml

TRS/ICFP_2010/162075.xml

TRS/ICFP_2010/149277.xml

TRS/ICFP_2010/186222.xml

TRS/ICFP_2010/43603.xml

TRS/ICFP_2010/4051.xml

TRS/ICFP_2010/166493.xml

TRS/ICFP_2010/133486.xml

TRS/ICFP_2010/4157.xml

TRS/ICFP_2010/149415.xml

TRS/ICFP_2010/136463.xml

TRS/ICFP_2010/152865.xml

TRS/ICFP_2010/136601.xml

TRS/ICFP_2010/96673.xml

TRS/ICFP_2010/212534.xml

TRS/ICFP_2010/26972.xml

TRS/ICFP_2010/124269.xml

TRS/ICFP_2010/26882.xml

TRS/ICFP_2010/48374.xml

TRS/ICFP_2010/138194.xml

TRS/ICFP_2010/97901.xml

TRS/ICFP_2010/130161.xml

TRS/ICFP_2010/26069.xml

TRS/ICFP_2010/188004.xml

TRS/ICFP_2010/214183.xml

TRS/ICFP_2010/25743.xml

TRS/ICFP_2010/4181.xml

TRS/ICFP_2010/150067.xml

TRS/ICFP_2010/150468.xml

TRS/ICFP_2010/26132.xml

TRS/ICFP_2010/25395.xml

TRS/ICFP_2010/96224.xml

TRS/ICFP_2010/212612.xml

TRS/ICFP_2010/43266.xml

TRS/ICFP_2010/85079.xml

TRS/ICFP_2010/85721.xml

TRS/ICFP_2010/57799.xml

TRS/ICFP_2010/26957.xml

TRS/ICFP_2010/4893.xml

TRS/ICFP_2010/157150.xml

TRS/ICFP_2010/53216.xml

TRS/ICFP_2010/98362.xml

TRS/ICFP_2010/96274.xml

TRS/ICFP_2010/4970.xml

TRS/ICFP_2010/96239.xml

TRS/ICFP_2010/213051.xml

TRS/ICFP_2010/96289.xml

TRS/ICFP_2010/231604.xml

TRS/ICFP_2010/157603.xml

TRS/ICFP_2010/96523.xml

TRS/ICFP_2010/139378.xml

TRS/ICFP_2010/165975.xml

TRS/ICFP_2010/85039.xml

TRS/ICFP_2010/166848.xml

TRS/ICFP_2010/160475.xml

TRS/ICFP_2010/40540.xml

TRS/ICFP_2010/140659.xml

TRS/ICFP_2010/48262.xml

TRS/ICFP_2010/128182.xml

TRS/ICFP_2010/63142.xml

TRS/ICFP_2010/97929.xml

TRS/ICFP_2010/231378.xml

TRS/ICFP_2010/185628.xml

TRS/ICFP_2010/187837.xml

TRS/ICFP_2010/135714.xml

TRS/ICFP_2010/128550.xml

TRS/ICFP_2010/165904.xml

TRS/ICFP_2010/132622.xml

TRS/ICFP_2010/27134.xml

TRS/ICFP_2010/4282.xml

TRS/ICFP_2010/81452.xml

TRS/ICFP_2010/136934.xml

TRS/ICFP_2010/3746.xml

TRS/ICFP_2010/42683.xml

TRS/ICFP_2010/57355.xml

TRS/ICFP_2010/132782.xml

TRS/ICFP_2010/186973.xml

TRS/ICFP_2010/4484.xml

TRS/ICFP_2010/27001.xml

TRS/ICFP_2010/263745.xml

TRS/ICFP_2010/212421.xml

TRS/ICFP_2010/262998.xml

TRS/ICFP_2010/136534.xml

TRS/ICFP_2010/68989.xml

TRS/ICFP_2010/48267.xml

TRS/ICFP_2010/86577.xml

TRS/ICFP_2010/150877.xml

TRS/ICFP_2010/213611.xml

TRS/ICFP_2010/95858.xml

TRS/ICFP_2010/132833.xml

TRS/ICFP_2010/186775.xml

TRS/ICFP_2010/97888.xml

TRS/ICFP_2010/161864.xml

TRS/ICFP_2010/212693.xml

TRS/ICFP_2010/27039.xml

TRS/ICFP_2010/150630.xml

TRS/ICFP_2010/212795.xml

TRS/ICFP_2010/162016.xml

TRS/ICFP_2010/41427.xml

TRS/ICFP_2010/26683.xml

TRS/ICFP_2010/96438.xml

TRS/ICFP_2010/27023.xml

TRS/ICFP_2010/132920.xml

TRS/ICFP_2010/138269.xml

TRS/ICFP_2010/153444.xml

TRS/ICFP_2010/211960.xml

TRS/ICFP_2010/165936.xml

TRS/ICFP_2010/214011.xml

TRS/ICFP_2010/132478.xml

TRS/ICFP_2010/26886.xml

TRS/ICFP_2010/26960.xml

TRS/Mixed_CTRS/quick.xml

TRS/Mixed_TRS/hydra.xml

TRS/Mixed_TRS/jones4.xml

TRS/Mixed_TRS/while.xml

TRS/Mixed_TRS/5.xml

TRS/Mixed_TRS/minsort.xml

TRS/Mixed_TRS/Ex1_Luc04b_GM.xml

TRS/Mixed_TRS/7.xml

TRS/Mixed_TRS/jones5.xml

TRS/Mixed_TRS/hydra-Zantema06.xml

TRS/Mixed_TRS/gcd_triple.xml

TRS/Mixed_TRS/jones1.xml

TRS/Mixed_TRS/beans.xml

TRS/Mixed_TRS/test1.xml

TRS/Mixed_TRS/jones6.xml

TRS/Mixed_TRS/1.xml

TRS/Mixed_TRS/perfect.xml

TRS/Mixed_TRS/3.xml

TRS/Mixed_TRS/perfect2.xml

TRS/Mixed_TRS/gcdMinMax.xml

TRS/Mixed_TRS/while2.xml

TRS/Mixed_TRS/6.xml

TRS/Mixed_TRS/gcd.xml

TRS/Mixed_TRS/2.xml

TRS/Mixed_TRS/4.xml

TRS/Mixed_TRS/motivation.xml

TRS/Mixed_TRS/jones2.xml

TRS/Strategy_removed_AG01/#4.30c.xml

TRS/AotoYamada_05/004.xml

TRS/AotoYamada_05/025.xml

TRS/AotoYamada_05/001.xml

TRS/AotoYamada_05/024.xml

TRS/AotoYamada_05/014.xml

TRS/AotoYamada_05/019.xml

TRS/AotoYamada_05/Ex5TermProof.xml

TRS/AotoYamada_05/027.xml

TRS/AotoYamada_05/010.xml

TRS/AotoYamada_05/022.xml

TRS/AotoYamada_05/Ex1SimplyTyped.xml

TRS/AotoYamada_05/028.xml

TRS/AotoYamada_05/006.xml

TRS/AotoYamada_05/009.xml

TRS/AotoYamada_05/002.xml

TRS/AotoYamada_05/012.xml

TRS/AotoYamada_05/007.xml

TRS/AotoYamada_05/023.xml

TRS/AotoYamada_05/021.xml

TRS/AotoYamada_05/015.xml

TRS/AotoYamada_05/003.xml

TRS/AotoYamada_05/020.xml

TRS/AotoYamada_05/011.xml

TRS/AotoYamada_05/017.xml

TRS/AotoYamada_05/013.xml

TRS/AotoYamada_05/005.xml

TRS/AotoYamada_05/016.xml

TRS/AotoYamada_05/026.xml

TRS/AG01/#3.51.xml

TRS/AG01/#3.53b.xml

TRS/AG01/#3.39.xml

TRS/AG01/#3.22.xml

TRS/AG01/#3.35.xml

TRS/AG01/#3.12.xml

TRS/AG01/#3.54.xml

TRS/AG01/#3.36.xml

TRS/AG01/#3.57.xml

TRS/AG01/#3.40.xml

TRS/AG01/#3.6a.xml

TRS/AG01/#3.4.xml

TRS/AG01/#3.56.xml

TRS/AG01/#3.42.xml

TRS/AG01/#3.5a.xml

TRS/AG01/#3.7.xml

TRS/AG01/#3.52.xml

TRS/AG01/#3.47.xml

TRS/AG01/#3.53a.xml

TRS/AG01/#3.24.xml

TRS/AG01/#3.8b.xml

TRS/AG01/#3.18.xml

TRS/AG01/#3.23.xml

TRS/AG01/#3.37.xml

TRS/AG01/#3.26.xml

TRS/AG01/#3.16.xml

TRS/AG01/#3.33.xml

TRS/AG01/#3.2.xml

TRS/AG01/#4.30c.xml

TRS/AG01/#3.41.xml

TRS/AG01/#3.13.xml

TRS/AG01/#3.5b.xml

TRS/AG01/#3.1.xml

TRS/AG01/#3.19.xml

TRS/AG01/#3.8a.xml

TRS/AG01/#3.48.xml

TRS/AG01/#3.38.xml

TRS/AG01/#3.17.xml

TRS/AG01/#3.29.xml

TRS/AG01/#3.6b.xml

TRS/AG01/#3.10.xml

TRS/AG01/#3.15.xml

TRS/AG01/#3.21.xml

TRS/AG01/#3.49.xml

TRS/AG01/#3.53.xml

TRS/AG01/#3.6.xml

TRS/AG01/#3.5.xml

TRS/AG01/#3.17a.xml

TRS/AG01/#3.55.xml

TRS/AG01/#3.31.xml

TRS/GTSSK07/cade09.xml

TRS/GTSSK07/cade03.xml

TRS/GTSSK07/cade07.xml

TRS/GTSSK07/cade08.xml

TRS/GTSSK07/cade17.xml

TRS/GTSSK07/cade13t.xml

TRS/GTSSK07/cade15.xml

TRS/GTSSK07/cade16.xml

TRS/GTSSK07/cade01.xml

TRS/GTSSK07/cade05t.xml

TRS/GTSSK07/cade06.xml

TRS/GTSSK07/cade10.xml

TRS/GTSSK07/cade04t.xml

TRS/GTSSK07/cade12t.xml

TRS/GTSSK07/cade11.xml

TRS/GTSSK07/cade14.xml

TRS/AG01_innermost/#4.37.xml

TRS/AG01_innermost/#4.3.xml

TRS/AG01_innermost/#4.23.xml

TRS/AG01_innermost/#4.32.xml

TRS/AG01_innermost/#4.4.xml

TRS/AG01_innermost/#4.20.xml

TRS/AG01_innermost/#4.27.xml

TRS/AG01_innermost/#4.7.xml

TRS/AG01_innermost/#4.2.xml

TRS/AG01_innermost/#4.31.xml

TRS/AG01_innermost/#4.13.xml

TRS/AG01_innermost/#4.30a.xml

TRS/AG01_innermost/#4.26.xml

TRS/AG01_innermost/#4.37a.xml

TRS/AG01_innermost/#4.21.xml

TRS/AG01_innermost/#4.25.xml

TRS/AG01_innermost/#4.22.xml

TRS/AG01_innermost/#4.30b.xml

TRS/AG01_innermost/#4.14.xml

TRS/AG01_innermost/#4.20a.xml

TRS/AG01_innermost/#4.19.xml

TRS/AG01_innermost/#4.12a.xml

TRS/AG01_innermost/#4.30.xml

TRS/AG01_innermost/#4.36.xml

TRS/AG01_innermost/#4.24.xml

TRS/AG01_innermost/#4.17.xml

TRS/AG01_innermost/#4.35.xml

TRS/AG01_innermost/#4.34.xml

TRS/AG01_innermost/#4.29.xml

TRS/AG01_innermost/#4.5.xml

TRS/AG01_innermost/#4.15.xml

TRS/AG01_innermost/#4.28.xml

TRS/AG01_innermost/#4.33.xml

TRS/AG01_innermost/#4.18.xml

TRS/AG01_innermost/#4.16.xml

TRS/HirokawaMiddeldorp_04/t001.xml

TRS/HirokawaMiddeldorp_04/t011.xml

TRS/HirokawaMiddeldorp_04/t004.xml

TRS/HirokawaMiddeldorp_04/t007.xml

TRS/HirokawaMiddeldorp_04/t009.xml

TRS/HirokawaMiddeldorp_04/n007.xml

TRS/HirokawaMiddeldorp_04/t002.xml

TRS/HirokawaMiddeldorp_04/t014.xml

TRS/HirokawaMiddeldorp_04/n004.xml

TRS/HirokawaMiddeldorp_04/n006.xml

TRS/HirokawaMiddeldorp_04/t008.xml

TRS/HirokawaMiddeldorp_04/n005.xml

TRS/HirokawaMiddeldorp_04/t012.xml

TRS/HirokawaMiddeldorp_04/n002.xml

TRS/HirokawaMiddeldorp_04/t013.xml

TRS/HirokawaMiddeldorp_04/t000.xml

TRS/HirokawaMiddeldorp_04/t003.xml

TRS/HirokawaMiddeldorp_04/t005.xml

TRS/HirokawaMiddeldorp_04/n003.xml

TRS/HirokawaMiddeldorp_04/t010.xml

TRS/HirokawaMiddeldorp_04/t006.xml

TRS/Waldmann_06/jwmatchb1.xml

TRS/Waldmann_06/jwno3.xml

TRS/Waldmann_06/jwteparla2.xml

TRS/Waldmann_06/jwcime1.xml

TRS/Waldmann_06/jwno7.xml

TRS/Waldmann_06/jwteparla1.xml

TRS/Waldmann_06/jwno5.xml

TRS/Waldmann_06/jwtpa2.xml

TRS/Waldmann_06/jwno8.xml

TRS/Waldmann_06/jwcime2.xml

TRS/Waldmann_06/jwno2.xml

TRS/Waldmann_06/jwaprove1.xml

TRS/Waldmann_06/jwmatchb2.xml

TRS/Waldmann_06/jwttt.xml

TRS/Waldmann_06/jwaprove2.xml

TRS/Waldmann_06/jwtpa1.xml

TRS/Bouchare_06/10.xml

TRS/Bouchare_06/17.xml

TRS/Bouchare_06/04.xml

TRS/Bouchare_06/16.xml

TRS/Bouchare_06/08.xml

TRS/Bouchare_06/11.xml

TRS/Bouchare_06/12.xml

TRS/Bouchare_06/03.xml

TRS/Bouchare_06/14.xml

TRS/Bouchare_06/13.xml

TRS/Bouchare_06/09.xml

TRS/Bouchare_06/15.xml

TRS/Bouchare_06/18.xml

TRS/Bouchare_06/02.xml

TRS/Bouchare_06/07.xml

TRS/Bouchare_06/06.xml

TRS/Bouchare_06/01.xml

TRS/Bouchare_06/05.xml

TRS/Secret_07_TRS/aprove05.xml

TRS/Secret_07_TRS/aprove03.xml

TRS/Secret_07_TRS/aprove07.xml

TRS/Secret_07_TRS/5.xml

TRS/Secret_07_TRS/aprove02.xml

TRS/Secret_07_TRS/secret1.xml

TRS/Secret_07_TRS/secret4.xml

TRS/Secret_07_TRS/7.xml

TRS/Secret_07_TRS/aprove04.xml

TRS/Secret_07_TRS/aprove06.xml

TRS/Secret_07_TRS/aprove09.xml

TRS/Secret_07_TRS/1.xml

TRS/Secret_07_TRS/3.xml

TRS/Secret_07_TRS/aprove01.xml

TRS/Secret_07_TRS/aprove08.xml

TRS/Secret_07_TRS/secret3.xml

TRS/Secret_07_TRS/aprove10.xml

TRS/Secret_07_TRS/2.xml

TRS/Secret_07_TRS/4.xml

TRS/Secret_07_TRS/secret2.xml

TRS/Secret_07_TRS/secret5.xml

TRS/MNZ_10/8.xml

TRS/MNZ_10/nvsr.xml

TRS/MNZ_10/5.xml

TRS/MNZ_10/labelled.xml

TRS/MNZ_10/7.xml

TRS/MNZ_10/0.xml

TRS/MNZ_10/1.xml

TRS/MNZ_10/3.xml

TRS/MNZ_10/6.xml

TRS/MNZ_10/2.xml

TRS/MNZ_10/4.xml

TRS/MNZ_10/9.xml

TRS/MNZ_10/nrvsq.xml

TRS/CiME_04/filliatre3.xml

TRS/CiME_04/big.xml

TRS/CiME_04/list-sum-prod-assoc.xml

TRS/CiME_04/append.xml

TRS/CiME_04/list-sum-prod-bin-assoc.xml

TRS/CiME_04/filliatre.xml

TRS/CiME_04/tree.xml

TRS/CiME_04/dpqs.xml

TRS/CiME_04/append-hard.xml

TRS/CiME_04/mucrl1.xml

TRS/CiME_04/maude2.xml

TRS/CiME_04/append-wrong.xml

TRS/CiME_04/fact-hard.xml

TRS/CiME_04/boolean_rings.xml

TRS/CiME_04/ternary-hard.xml

TRS/CiME_04/list-sum-prod-assoc-append.xml

TRS/CiME_04/lse.xml

TRS/CiME_04/ack_prolog.xml

TRS/CiME_04/list-sum-prod.xml

TRS/CiME_04/log2.xml

TRS/CiME_04/list-sum-prod-bin-assoc-distr-app.xml

TRS/CiME_04/intersect.xml

TRS/CiME_04/ternary.xml

TRS/CiME_04/list-sum-prod-bin.xml

TRS/CiME_04/filliatre2.xml

TRS/Applicative_AG01_innermost/#4.3.xml

TRS/Applicative_AG01_innermost/#4.7.xml

TRS/Applicative_AG01_innermost/#4.2.xml

TRS/Applicative_AG01_innermost/#4.8.xml

TRS/Applicative_AG01_innermost/#4.13.xml

TRS/Applicative_AG01_innermost/#4.26.xml

TRS/Applicative_AG01_innermost/#4.22.xml

TRS/Applicative_AG01_innermost/#4.19.xml

TRS/Applicative_AG01_innermost/#4.36.xml

TRS/Applicative_AG01_innermost/#4.10.xml

TRS/Applicative_AG01_innermost/#4.24.xml

TRS/Applicative_AG01_innermost/#4.17.xml

TRS/Applicative_AG01_innermost/#4.34.xml

TRS/Applicative_AG01_innermost/#4.5.xml

TRS/Applicative_AG01_innermost/#4.15.xml

TRS/Applicative_AG01_innermost/#4.28.xml

TRS/Zantema_06/10.xml

TRS/Zantema_06/17.xml

TRS/Zantema_06/04.xml

TRS/Zantema_06/16.xml

TRS/Zantema_06/08.xml

TRS/Zantema_06/beans6.xml

TRS/Zantema_06/beans2.xml

TRS/Zantema_06/loop1.xml

TRS/Zantema_06/11.xml

TRS/Zantema_06/12.xml

TRS/Zantema_06/03.xml

TRS/Zantema_06/14.xml

TRS/Zantema_06/beans7.xml

TRS/Zantema_06/13.xml

TRS/Zantema_06/09.xml

TRS/Zantema_06/15.xml

TRS/Zantema_06/18.xml

TRS/Zantema_06/loop2.xml

TRS/Zantema_06/beans5.xml

TRS/Zantema_06/beans1.xml

TRS/Zantema_06/02.xml

TRS/Zantema_06/07.xml

TRS/Zantema_06/beans3.xml

TRS/Zantema_06/while2.xml

TRS/Zantema_06/abc.xml

TRS/Zantema_06/while1.xml

TRS/Zantema_06/06.xml

TRS/Zantema_06/01.xml

TRS/Zantema_06/05.xml

TRS/Zantema_06/beans4.xml

TRS/Secret_05_SRS/aprove4.xml

TRS/Secret_05_SRS/aprove1.xml

TRS/Secret_05_SRS/aprove3.xml

TRS/Secret_05_SRS/jambox1.xml

TRS/Secret_05_SRS/torpa3.xml

TRS/Secret_05_SRS/matchbox2.xml

TRS/Secret_05_SRS/jambox3.xml

TRS/Secret_05_SRS/torpa1.xml

TRS/Secret_05_SRS/jambox5.xml

TRS/Secret_05_SRS/aprove5.xml

TRS/Secret_05_SRS/torpa4.xml

TRS/Secret_05_SRS/jambox4.xml

TRS/Secret_05_SRS/jambox2.xml

TRS/Secret_05_SRS/torpa2.xml

TRS/Secret_05_SRS/matchbox1.xml

TRS/Secret_05_SRS/aprove2.xml

TRS/Mixed_SRS/turing_copy.xml

TRS/Mixed_SRS/04.xml

TRS/Mixed_SRS/08.xml

TRS/Mixed_SRS/01-oppelt08.xml

TRS/Mixed_SRS/03.xml

TRS/Mixed_SRS/03-oppelt08.xml

TRS/Mixed_SRS/08-oppelt08.xml

TRS/Mixed_SRS/07-oppelt08.xml

TRS/Mixed_SRS/06-oppelt08.xml

TRS/Mixed_SRS/turing_add.xml

TRS/Mixed_SRS/09.xml

TRS/Mixed_SRS/1.xml

TRS/Mixed_SRS/05-oppelt08.xml

TRS/Mixed_SRS/02-oppelt08.xml

TRS/Mixed_SRS/3.xml

TRS/Mixed_SRS/turing_mult.xml

TRS/Mixed_SRS/02.xml

TRS/Mixed_SRS/07.xml

TRS/Mixed_SRS/s6.xml

TRS/Mixed_SRS/touzet.xml

TRS/Mixed_SRS/2.xml

TRS/Mixed_SRS/4.xml

TRS/Mixed_SRS/06.xml

TRS/Mixed_SRS/01.xml

TRS/Mixed_SRS/05.xml

TRS/Mixed_SRS/04-oppelt08.xml

TRS/Mixed_outermost/ex2.xml

TRS/Mixed_outermost/ex5.xml

TRS/Mixed_outermost/patterns1.xml

TRS/Mixed_outermost/ex1.xml

TRS/Mixed_outermost/non-lin2.xml

TRS/Mixed_outermost/ex6.xml

TRS/Mixed_outermost/afbg.xml

TRS/Mixed_outermost/ex3.xml

TRS/Mixed_outermost/patterns2.xml

TRS/Mixed_outermost/odd.xml

TRS/Mixed_outermost/non-lin3.xml

TRS/Mixed_outermost/non-lin1.xml

TRS/Mixed_outermost/even.xml

TRS/Mixed_outermost/ex4.xml

TRS/Mixed_outermost/gfb.xml

TRS/Secret_06_TRS/reverse.xml

TRS/Secret_06_TRS/10.xml

TRS/Secret_06_TRS/gen-15.xml

TRS/Secret_06_TRS/8.xml

TRS/Secret_06_TRS/gen-25.xml

TRS/Secret_06_TRS/times.xml

TRS/Secret_06_TRS/tpa06.xml

TRS/Secret_06_TRS/gen-28.xml

TRS/Secret_06_TRS/gen-17.xml

TRS/Secret_06_TRS/division.xml

TRS/Secret_06_TRS/gen-18.xml

TRS/Secret_06_TRS/tpa01.xml

TRS/Secret_06_TRS/double.xml

TRS/Secret_06_TRS/5.xml

TRS/Secret_06_TRS/addList.xml

TRS/Secret_06_TRS/tpa10.xml

TRS/Secret_06_TRS/gen-14.xml

TRS/Secret_06_TRS/tpa05.xml

TRS/Secret_06_TRS/gen-9.xml

TRS/Secret_06_TRS/divExp.xml

TRS/Secret_06_TRS/tpa02.xml

TRS/Secret_06_TRS/7.xml

TRS/Secret_06_TRS/gen-1.xml

TRS/Secret_06_TRS/tpa07.xml

TRS/Secret_06_TRS/gen-10.xml

TRS/Secret_06_TRS/sumList.xml

TRS/Secret_06_TRS/tpa03.xml

TRS/Secret_06_TRS/cime1.xml

TRS/Secret_06_TRS/3.xml

TRS/Secret_06_TRS/tpa08.xml

TRS/Secret_06_TRS/nrOfNodes.xml

TRS/Secret_06_TRS/tpa09.xml

TRS/Secret_06_TRS/6.xml

TRS/Secret_06_TRS/tpa04.xml

TRS/Secret_06_TRS/2.xml

TRS/Secret_06_TRS/4.xml

TRS/Secret_06_TRS/9.xml

TRS/Secret_06_TRS/toList.xml

TRS/Secret_06_TRS/logarithm.xml

TRS/Secret_06_TRS/gen-22.xml

TRS/AProVE_10/downfrom.xml

TRS/AProVE_10/scnp.xml

TRS/AProVE_10/ex2.xml

TRS/AProVE_10/ex5.xml

TRS/AProVE_10/ex1.xml

TRS/AProVE_10/isList.xml

TRS/AProVE_10/double.xml

TRS/AProVE_10/Zantema06-03-modified.xml

TRS/AProVE_10/ex3.xml

TRS/AProVE_10/halfdouble.xml

TRS/AProVE_10/isNat.xml

TRS/AProVE_10/andIsNat.xml

TRS/AProVE_10/ex4.xml

TRS/AProVE_10/challenge_fab.xml

TRS/Endrullis_06/pair3hard.xml

TRS/Endrullis_06/linear1.xml

TRS/Endrullis_06/quadruple1.xml

TRS/Endrullis_06/quadruple2.xml

TRS/Endrullis_06/direct.xml

TRS/Endrullis_06/pair3rotate.xml

TRS/Endrullis_06/labeling.xml

TRS/Endrullis_06/linear2.xml

TRS/Endrullis_06/pair2simple2.xml

TRS/Endrullis_06/pair3swap.xml

TRS/Endrullis_06/pair2hard.xml

TRS/Endrullis_06/pair2simple1.xml

TRS/Secret_07_SRS/dj.xml

TRS/Secret_07_SRS/num-527.xml

TRS/Secret_07_SRS/num-514.xml

TRS/Secret_07_SRS/x07.xml

TRS/Secret_07_SRS/x09.xml

TRS/Secret_07_SRS/num-530.xml

TRS/Secret_07_SRS/num-539.xml

TRS/Secret_07_SRS/x10.xml

TRS/Secret_07_SRS/x02.xml

TRS/Secret_07_SRS/x08.xml

TRS/Secret_07_SRS/x06.xml

TRS/Secret_07_SRS/x01.xml

TRS/Secret_07_SRS/num-521.xml

TRS/Secret_07_SRS/num-525.xml

TRS/Secret_07_SRS/num-515.xml

TRS/Secret_07_SRS/x04.xml

TRS/Secret_07_SRS/num-518.xml

TRS/Secret_07_SRS/num-520.xml

TRS/Secret_07_SRS/x03.xml

TRS/Secret_07_SRS/num-519.xml

TRS/Secret_07_SRS/x05.xml

TRS/TCT_09/ma3.xml

TRS/TCT_09/shuffle.xml

TRS/TCT_09/addmult.xml

TRS/TCT_09/revappend.xml

TRS/TCT_09/append.xml

TRS/TCT_09/dexpdp2.xml

TRS/TCT_09/nonmultrec.xml

TRS/TCT_09/ma6.xml

TRS/TCT_09/ackhofbauernonsimp.xml

TRS/TCT_09/z86.xml

TRS/TCT_09/ackantiinn2.xml

TRS/TCT_09/ma7.xml

TRS/TCT_09/ma9.xml

TRS/TCT_09/supexpdg.xml

TRS/TCT_09/add.xml

TRS/TCT_09/ma1.xml

TRS/TCT_09/insertsort.xml

TRS/TCT_09/ackhofbauer.xml

TRS/TCT_09/supexpur.xml

TRS/TCT_09/ackantiinn.xml

TRS/TCT_09/dexpdp.xml

TRS/TCT_09/ma8.xml

TRS/TCT_09/mergesort.xml

TRS/TCT_09/ma4.xml

TRS/TCT_09/qbf.xml

TRS/TCT_09/expantiinn.xml

TRS/TCT_09/lcs.xml

TRS/AProVE_07/thiemann11.xml

TRS/AProVE_07/wiehe03.xml

TRS/AProVE_07/thiemann22.xml

TRS/AProVE_07/thiemann12.xml

TRS/AProVE_07/thiemann33.xml

TRS/AProVE_07/otto06.xml

TRS/AProVE_07/thiemann04.xml

TRS/AProVE_07/wiehe06.xml

TRS/AProVE_07/thiemann16.xml

TRS/AProVE_07/thiemann17.xml

TRS/AProVE_07/otto01.xml

TRS/AProVE_07/otto04.xml

TRS/AProVE_07/thiemann25.xml

TRS/AProVE_07/thiemann26.xml

TRS/AProVE_07/thiemann39.xml

TRS/AProVE_07/thiemann38.xml

TRS/AProVE_07/wiehe07.xml

TRS/AProVE_07/thiemann24.xml

TRS/AProVE_07/thiemann07.xml

TRS/AProVE_07/kabasci06.xml

TRS/AProVE_07/thiemann32.xml

TRS/AProVE_07/kabasci01.xml

TRS/AProVE_07/otto13.xml

TRS/AProVE_07/thiemann20.xml

TRS/AProVE_07/thiemann27.xml

TRS/AProVE_07/kabasci04.xml

TRS/AProVE_07/thiemann15.xml

TRS/AProVE_07/thiemann35.xml

TRS/AProVE_07/otto07.xml

TRS/AProVE_07/kabasci05.xml

TRS/AProVE_07/otto12.xml

TRS/AProVE_07/thiemann01.xml

TRS/AProVE_07/thiemann03.xml

TRS/AProVE_07/wiehe09.xml

TRS/AProVE_07/thiemann10.xml

TRS/AProVE_07/thiemann34.xml

TRS/AProVE_07/wiehe11.xml

TRS/AProVE_07/otto09.xml

TRS/AProVE_07/thiemann08.xml

TRS/AProVE_07/wiehe01.xml

TRS/AProVE_07/thiemann29.xml

TRS/AProVE_07/wiehe02.xml

TRS/AProVE_07/thiemann02.xml

TRS/AProVE_07/thiemann05.xml

TRS/AProVE_07/otto10.xml

TRS/AProVE_07/otto02.xml

TRS/AProVE_07/thiemann09.xml

TRS/AProVE_07/thiemann06.xml

TRS/AProVE_07/otto11.xml

TRS/AProVE_07/thiemann19.xml

TRS/AProVE_07/thiemann23.xml

TRS/AProVE_07/wiehe12.xml

TRS/AProVE_07/thiemann37.xml

TRS/AProVE_07/otto08.xml

TRS/AProVE_07/otto03.xml

TRS/AProVE_07/thiemann40.xml

TRS/AProVE_07/thiemann41.xml

TRS/AProVE_07/thiemann31.xml

TRS/AProVE_07/wiehe08.xml

TRS/AProVE_07/thiemann13.xml

TRS/AProVE_07/thiemann36.xml

TRS/AProVE_07/thiemann21.xml

TRS/AProVE_07/kabasci02.xml

TRS/AProVE_07/thiemann28.xml

TRS/AProVE_07/thiemann18.xml

TRS/AProVE_07/wiehe05.xml

TRS/AProVE_07/thiemann14.xml

TRS/AProVE_07/thiemann30.xml

TRS/AProVE_07/otto05.xml

TRS/AProVE_07/kabasci03.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-30.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-66.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-226.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-4.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-94.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-70.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-410.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-243.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-134.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-356.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-95.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-248.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-88.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-497.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-44.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-237.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-72.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-23.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-195.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-409.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-361.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-200.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-273.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-417.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-32.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-480.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-223.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-283.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-494.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-100.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-559.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-86.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-287.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-129.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-113.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-368.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-285.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-249.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-7.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-522.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-543.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-220.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-178.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-104.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-213.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-495.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-477.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-18.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-255.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-126.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-222.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-399.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-122.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-485.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-526.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-549.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-267.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-215.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-263.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-180.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-412.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-181.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-105.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-272.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-346.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-340.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-373.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-19.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-328.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-507.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-367.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-149.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-299.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-297.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-3.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-294.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-330.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-123.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-369.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-13.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-20.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-48.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-550.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-51.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-194.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-479.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-82.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-45.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-19.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-492.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-296.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-207.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-418.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-15.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-309.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-232.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-564.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-284.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-536.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-11.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-339.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-76.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-191.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-403.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-541.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-448.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-453.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-355.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-107.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-265.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-434.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-21.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-378.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-430.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-548.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-337.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-360.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-455.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-465.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-366.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-351.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-5.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-460.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-274.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-298.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-31.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-271.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-441.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-14.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-186.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-168.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-502.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-83.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-99.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-1.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-275.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-289.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-482.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-67.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-199.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-10.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-112.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-110.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-165.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-473.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-288.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-470.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-57.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-217.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-545.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-91.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-431.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-362.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-90.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-429.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-341.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-408.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-17.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-386.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-301.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-281.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-436.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-9.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-190.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-241.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-491.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-85.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-16.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-92.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-532.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-35.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-209.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-74.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-163.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-159.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-395.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-566.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-474.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-247.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-547.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-225.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-446.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-406.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-503.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-556.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-487.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-211.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-224.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-303.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-438.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-383.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-198.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-489.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-170.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-535.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-152.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-304.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-179.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-415.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-511.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-343.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-3.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-239.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-109.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-98.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-396.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-203.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-439.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-8.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-59.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-236.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-11.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-52.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-160.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-206.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-13.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-345.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-354.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-454.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-452.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-443.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-101.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-389.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-227.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-16.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-176.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-353.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-221.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-506.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-450.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-12.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-6.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-61.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-40.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-133.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-111.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-219.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-546.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-476.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-164.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-499.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-451.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-291.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-335.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-233.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-14.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-401.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-15.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-300.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-384.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-565.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-472.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-327.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-374.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-128.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-204.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-121.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-508.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-363.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-177.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-437.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-174.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-127.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-568.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-202.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-377.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-257.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-435.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-475.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-71.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-414.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-108.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-385.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-231.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-400.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-10.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-158.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-468.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-461.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-456.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-391.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-125.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-64.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-4.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-392.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-106.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-338.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-551.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-260.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-498.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-146.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-359.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-347.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-293.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-348.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-17.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-238.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-135.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-22.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-552.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-462.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-467.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-22.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-402.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-279.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-282.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-560.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-561.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-493.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-540.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-352.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-382.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-201.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-558.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-20.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-210.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-140.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-131.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-563.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-286.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-553.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-7.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-376.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-413.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-124.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-416.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-41.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-375.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-484.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-292.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-21.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-427.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-132.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-2.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-120.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-469.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-350.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-1.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-65.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-47.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-488.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-49.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-478.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-114.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-270.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-84.xml

TRS/Gebhardt_06/10.xml

TRS/Gebhardt_06/17.xml

TRS/Gebhardt_06/04.xml

TRS/Gebhardt_06/16.xml

TRS/Gebhardt_06/08.xml

TRS/Gebhardt_06/11.xml

TRS/Gebhardt_06/19.xml

TRS/Gebhardt_06/12.xml

TRS/Gebhardt_06/03.xml

TRS/Gebhardt_06/14.xml

TRS/Gebhardt_06/13.xml

TRS/Gebhardt_06/09.xml

TRS/Gebhardt_06/15.xml

TRS/Gebhardt_06/18.xml

TRS/Gebhardt_06/20.xml

TRS/Gebhardt_06/02.xml

TRS/Gebhardt_06/07.xml

TRS/Gebhardt_06/06.xml

TRS/Gebhardt_06/01.xml

TRS/Gebhardt_06/05.xml

TRS/SK90/4.60.xml

TRS/SK90/4.37.xml

TRS/SK90/4.38.xml

TRS/SK90/2.16.xml

TRS/SK90/2.44.xml

TRS/SK90/4.29.xml

TRS/SK90/2.11.xml

TRS/SK90/4.10.xml

TRS/SK90/2.17.xml

TRS/SK90/2.01.xml

TRS/SK90/4.48.xml

TRS/SK90/2.61.xml

TRS/SK90/4.53.xml

TRS/SK90/2.27.xml

TRS/SK90/4.57.xml

TRS/SK90/2.40.xml

TRS/SK90/2.09.xml

TRS/SK90/4.05.xml

TRS/SK90/4.06.xml

TRS/SK90/2.53.xml

TRS/SK90/4.16.xml

TRS/SK90/2.21.xml

TRS/SK90/4.25.xml

TRS/SK90/2.47.xml

TRS/SK90/4.42.xml

TRS/SK90/4.04.xml

TRS/SK90/2.41.xml

TRS/SK90/2.02.xml

TRS/SK90/4.47.xml

TRS/SK90/4.32.xml

TRS/SK90/4.11.xml

TRS/SK90/2.45.xml

TRS/SK90/2.33.xml

TRS/SK90/2.03.xml

TRS/SK90/4.33.xml

TRS/SK90/4.17.xml

TRS/SK90/2.51.xml

TRS/SK90/2.12.xml

TRS/SK90/4.45.xml

TRS/SK90/4.31.xml

TRS/SK90/4.43.xml

TRS/SK90/2.15.xml

TRS/SK90/2.25.xml

TRS/SK90/2.24.xml

TRS/SK90/4.26.xml

TRS/SK90/4.40.xml

TRS/SK90/4.59.xml

TRS/SK90/2.38.xml

TRS/SK90/2.18.xml

TRS/SK90/2.14.xml

TRS/SK90/4.18.xml

TRS/SK90/2.46.xml

TRS/SK90/4.23.xml

TRS/SK90/4.28.xml

TRS/SK90/2.58.xml

TRS/SK90/4.21.xml

TRS/SK90/2.60.xml

TRS/SK90/2.50.xml

TRS/SK90/4.34.xml

TRS/SK90/4.13.xml

TRS/SK90/2.06.xml

TRS/SK90/2.22.xml

TRS/SK90/2.36.xml

TRS/SK90/4.52.xml

TRS/SK90/2.37.xml

TRS/SK90/4.07.xml

TRS/SK90/2.59.xml

TRS/SK90/2.35.xml

TRS/SK90/2.20.xml

TRS/SK90/4.12.xml

TRS/SK90/2.28.xml

TRS/SK90/4.54.xml

TRS/SK90/4.56.xml

TRS/SK90/4.41.xml

TRS/SK90/2.32.xml

TRS/SK90/2.31.xml

TRS/SK90/4.39.xml

TRS/SK90/2.56.xml

TRS/SK90/2.04.xml

TRS/SK90/2.48.xml

TRS/SK90/2.13.xml

TRS/SK90/4.44.xml

TRS/SK90/2.54.xml

TRS/SK90/2.10.xml

TRS/SK90/4.49.xml

TRS/SK90/4.20.xml

TRS/SK90/2.55.xml

TRS/SK90/4.22.xml

TRS/SK90/4.61.xml

TRS/SK90/2.42.xml

TRS/SK90/2.26.xml

TRS/SK90/4.19.xml

TRS/SK90/2.19.xml

TRS/SK90/2.34.xml

TRS/SK90/4.15.xml

TRS/SK90/4.51.xml

TRS/SK90/2.57.xml

TRS/SK90/4.03.xml

TRS/SK90/2.23.xml

TRS/SK90/2.07.xml

TRS/SK90/4.35.xml

TRS/SK90/4.01.xml

TRS/SK90/2.08.xml

TRS/SK90/4.24.xml

TRS/SK90/2.39.xml

TRS/SK90/2.49.xml

TRS/SK90/4.14.xml

TRS/SK90/2.43.xml

TRS/SK90/4.09.xml

TRS/SK90/2.05.xml

TRS/SK90/4.08.xml

TRS/SK90/4.30.xml

TRS/SK90/2.30.xml

TRS/SK90/4.46.xml

TRS/SK90/4.02.xml

TRS/SK90/2.29.xml

TRS/SK90/2.52.xml

TRS/SK90/4.50.xml

TRS/SK90/4.36.xml

TRS/AProVE_04/improved_usable2.xml

TRS/AProVE_04/AAECC-ring.xml

TRS/AProVE_04/IJCAR_26.xml

TRS/AProVE_04/Liveness6.3.xml

TRS/AProVE_04/forward_instantiation2.xml

TRS/AProVE_04/Liveness6.2.xml

TRS/AProVE_04/fac.xml

TRS/AProVE_04/AAECC.xml

TRS/AProVE_04/IJCAR_12.xml

TRS/AProVE_04/rta2.xml

TRS/AProVE_04/LPAR_intlist.xml

TRS/AProVE_04/IJCAR_18.xml

TRS/AProVE_04/Liveness6.4.xml

TRS/AProVE_04/forward_instantiation.xml

TRS/AProVE_04/Liveness_WRS.xml

TRS/AProVE_04/IJCAR_26a.xml

TRS/AProVE_04/rta3.xml

TRS/AProVE_04/JFP_Ex31.xml

TRS/AProVE_04/rta1.xml

TRS/AProVE_04/JFP_Ex51.xml

TRS/AProVE_04/improved_usable.xml

TRS/AProVE_04/IJCAR_1.xml

TRS/AProVE_04/Liveness6.1.xml

TRS/AProVE_04/Liveness8.xml

TRS/Applicative_05/Ex2_6_1Composition.xml

TRS/Applicative_05/Ex8Polymorphic.xml

TRS/Applicative_05/TreeLevels.xml

TRS/Applicative_05/TakeDropWhile.xml

TRS/Applicative_05/TreeMap.xml

TRS/Applicative_05/TreeSize.xml

TRS/Applicative_05/Ex4MapList.xml

TRS/Applicative_05/TypeEx3.xml

TRS/Applicative_05/Ex6Folding.xml

TRS/Applicative_05/Ex7Sorting.xml

TRS/Applicative_05/TypeEx1.xml

TRS/Applicative_05/termMonTypes.xml

TRS/Applicative_05/Ex10Functional.xml

TRS/Applicative_05/Ex2_8_1ConstSubstFix.xml

TRS/Applicative_05/Ex6Recursor.xml

TRS/Applicative_05/Ex7_9.xml

TRS/Applicative_05/TreeHeight.xml

TRS/Applicative_05/mapDivMinus.xml

TRS/Applicative_05/BTreeMember.xml

TRS/Applicative_05/Ex6_11.xml

TRS/Applicative_05/Ex5Sorting.xml

TRS/Applicative_05/Ex2PrimRec.xml

TRS/Applicative_05/Ex9Maps.xml

TRS/Applicative_05/TypeEx5.xml

TRS/Applicative_05/mapDivMinusHard.xml

TRS/Applicative_05/Hamming.xml

TRS/Applicative_05/Ex7OrdinalRec.xml

TRS/Applicative_05/ReverseLastInit.xml

TRS/Applicative_05/Ex5Folding.xml

TRS/Applicative_05/Ex3Lists.xml

TRS/Applicative_05/nonTermF.xml

TRS/Applicative_05/TreeFlatten.xml

TRS/Zantema_05/jw50.xml

TRS/Zantema_05/jw14.xml

TRS/Zantema_05/jw26.xml

TRS/Zantema_05/z10.xml

TRS/Zantema_05/jw01.xml

TRS/Zantema_05/jw24.xml

TRS/Zantema_05/z16.xml

TRS/Zantema_05/z08.xml

TRS/Zantema_05/z09.xml

TRS/Zantema_05/jw28.xml

TRS/Zantema_05/z12.xml

TRS/Zantema_05/jw30.xml

TRS/Zantema_05/jw23.xml

TRS/Zantema_05/jw20.xml

TRS/Zantema_05/z05.xml

TRS/Zantema_05/jw19.xml

TRS/Zantema_05/z11.xml

TRS/Zantema_05/jw43.xml

TRS/Zantema_05/jw09.xml

TRS/Zantema_05/jw16.xml

TRS/Zantema_05/z14.xml

TRS/Zantema_05/z21.xml

TRS/Zantema_05/jw38.xml

TRS/Zantema_05/jw47.xml

TRS/Zantema_05/jw44.xml

TRS/Zantema_05/jw02.xml

TRS/Zantema_05/z27.xml

TRS/Zantema_05/jw42.xml

TRS/Zantema_05/jw39.xml

TRS/Zantema_05/z28.xml

TRS/Zantema_05/jw33.xml

TRS/Zantema_05/jw31.xml

TRS/Zantema_05/z18.xml

TRS/Zantema_05/jw40.xml

TRS/Zantema_05/jw04.xml

TRS/Zantema_05/jw13.xml

TRS/Zantema_05/jw41.xml

TRS/Zantema_05/z04.xml

TRS/Zantema_05/z19.xml

TRS/Zantema_05/jw36.xml

TRS/Zantema_05/jw11.xml

TRS/Zantema_05/z25.xml

TRS/Zantema_05/jw18.xml

TRS/Zantema_05/z01.xml

TRS/Zantema_05/jw17.xml

TRS/Zantema_05/jw35.xml

TRS/Zantema_05/z26.xml

TRS/Zantema_05/jw34.xml

TRS/Zantema_05/z17.xml

TRS/Zantema_05/jw15.xml

TRS/Zantema_05/jw08.xml

TRS/Zantema_05/jw22.xml

TRS/Zantema_05/jw32.xml

TRS/Zantema_05/z23.xml

TRS/Zantema_05/z22.xml

TRS/Zantema_05/z02.xml

TRS/Zantema_05/z03.xml

TRS/Zantema_05/jw25.xml

TRS/Zantema_05/jw27.xml

TRS/Zantema_05/jw03.xml

TRS/Zantema_05/z15.xml

TRS/Zantema_05/jw05.xml

TRS/Zantema_05/z20.xml

TRS/Zantema_05/z24.xml

TRS/Zantema_05/z13.xml

TRS/Zantema_05/jw07.xml

TRS/Zantema_05/jw06.xml

TRS/Zantema_05/z30.xml

TRS/Zantema_05/z06.xml

TRS/Zantema_05/jw12.xml

TRS/Zantema_05/jw37.xml

TRS/Zantema_05/z07.xml

TRS/Zantema_05/z29.xml

TRS/Zantema_05/jw21.xml

TRS/Zantema_05/jw29.xml

TRS/Beerendonk_07/10.xml

TRS/Beerendonk_07/17.xml

TRS/Beerendonk_07/8.xml

TRS/Beerendonk_07/16.xml

TRS/Beerendonk_07/24.xml

TRS/Beerendonk_07/5.xml

TRS/Beerendonk_07/11.xml

TRS/Beerendonk_07/19.xml

TRS/Beerendonk_07/12.xml

TRS/Beerendonk_07/14.xml

TRS/Beerendonk_07/7.xml

TRS/Beerendonk_07/13.xml

TRS/Beerendonk_07/23.xml

TRS/Beerendonk_07/15.xml

TRS/Beerendonk_07/18.xml

TRS/Beerendonk_07/1.xml

TRS/Beerendonk_07/20.xml

TRS/Beerendonk_07/3.xml

TRS/Beerendonk_07/21.xml

TRS/Beerendonk_07/6.xml

TRS/Beerendonk_07/2.xml

TRS/Beerendonk_07/4.xml

TRS/Beerendonk_07/9.xml

TRS/Beerendonk_07/22.xml

TRS/Transformed_outermost_08/ex5.8.xml

TRS/Transformed_outermost_08/cariboo_ex2.xml

TRS/Transformed_outermost_08/morse.xml

TRS/Transformed_outermost_08/f30.xml

TRS/Transformed_outermost_08/ex5.7.xml

TRS/Transformed_outermost_08/ex5.5.xml

TRS/Transformed_outermost_08/cariboo_ex3.xml

TRS/Transformed_outermost_08/f20.xml

TRS/Transformed_outermost_08/f40.xml

TRS/Transformed_outermost_08/f4.xml

TRS/Transformed_outermost_08/ex5.6.xml

TRS/Transformed_outermost_08/ex5.3.xml

TRS/Transformed_outermost_08/ex5.4.xml

TRS/Transformed_outermost_08/cariboo_ex1.xml

TRS/Zantema_04/z090.xml

TRS/Zantema_04/z124.xml

TRS/Zantema_04/z014.xml

TRS/Zantema_04/z092.xml

TRS/Zantema_04/z089.xml

TRS/Zantema_04/z071.xml

TRS/Zantema_04/z020.xml

TRS/Zantema_04/z081.xml

TRS/Zantema_04/z012.xml

TRS/Zantema_04/z096.xml

TRS/Zantema_04/z120.xml

TRS/Zantema_04/z006.xml

TRS/Zantema_04/z047.xml

TRS/Zantema_04/z114.xml

TRS/Zantema_04/z021.xml

TRS/Zantema_04/z109.xml

TRS/Zantema_04/z018.xml

TRS/Zantema_04/z046.xml

TRS/Zantema_04/z066.xml

TRS/Zantema_04/z087.xml

TRS/Zantema_04/z036.xml

TRS/Zantema_04/z013.xml

TRS/Zantema_04/z041.xml

TRS/Zantema_04/syracuse.xml

TRS/Zantema_04/z091.xml

TRS/Zantema_04/z035.xml

TRS/Zantema_04/z083.xml

TRS/Zantema_04/z025.xml

TRS/Zantema_04/z085.xml

TRS/Zantema_04/z048.xml

TRS/Zantema_04/z064.xml

TRS/Zantema_04/z088.xml

TRS/Zantema_04/z050.xml

TRS/Zantema_04/z082.xml

TRS/Zantema_04/z111.xml

TRS/Zantema_04/z040.xml

TRS/Zantema_04/z108.xml

TRS/Zantema_04/z033.xml

TRS/Zantema_04/z031.xml

TRS/Zantema_04/z003.xml

TRS/Zantema_04/z039.xml

TRS/Zantema_04/z107.xml

TRS/Zantema_04/z045.xml

TRS/Zantema_04/z023.xml

TRS/Zantema_04/z029.xml

TRS/Zantema_04/z119.xml

TRS/Zantema_04/z113.xml

TRS/Zantema_04/z030.xml

TRS/Zantema_04/z127.xml

TRS/Zantema_04/z002.xml

TRS/Zantema_04/z104.xml

TRS/Zantema_04/z034.xml

TRS/Zantema_04/z027.xml

TRS/Zantema_04/z042.xml

TRS/Zantema_04/z061.xml

TRS/Zantema_04/z007.xml

TRS/Zantema_04/z001.xml

TRS/Zantema_04/z077.xml

TRS/Zantema_04/z128.xml

TRS/Zantema_04/z101.xml

TRS/Zantema_04/z038.xml

TRS/Zantema_04/z117.xml

TRS/Zantema_04/z049.xml

TRS/Zantema_04/z053.xml

TRS/Zantema_04/z037.xml

TRS/Zantema_04/z004.xml

TRS/Zantema_04/z024.xml

TRS/Zantema_04/z026.xml

TRS/Zantema_04/z123.xml

TRS/Zantema_04/z043.xml

TRS/Zantema_04/z063.xml

TRS/Zantema_04/z056.xml

TRS/Zantema_04/z058.xml

TRS/Zantema_04/z009.xml

TRS/Zantema_04/z044.xml

TRS/Zantema_04/z010.xml

TRS/Zantema_04/z005.xml

TRS/Zantema_04/z072.xml

TRS/Zantema_04/z017.xml

TRS/Zantema_04/z032.xml

TRS/Zantema_04/z110.xml

TRS/Zantema_04/z028.xml

TRS/Zantema_04/z102.xml

TRS/Zantema_04/z098.xml

TRS/Zantema_04/z121.xml

TRS/Zantema_04/z106.xml

TRS/Zantema_04/z097.xml

TRS/Zantema_04/z075.xml

TRS/Zantema_04/z115.xml

TRS/Zantema_04/z065.xml

TRS/Zantema_04/z069.xml

TRS/Zantema_04/z079.xml

TRS/Zantema_04/z008.xml

TRS/Zantema_04/z055.xml

TRS/Zantema_04/z051.xml

TRS/Zantema_04/z059.xml

TRS/Zantema_04/z095.xml

TRS/Zantema_04/z100.xml

TRS/Zantema_04/z093.xml

TRS/Zantema_04/z022.xml

TRS/Zantema_04/z062.xml

TRS/Zantema_04/z116.xml

TRS/Zantema_04/z094.xml

TRS/Zantema_04/z019.xml

TRS/Zantema_04/z060.xml

TRS/Zantema_04/z125.xml

TRS/Zantema_04/z074.xml

TRS/Zantema_04/z126.xml

TRS/Zantema_04/z070.xml

TRS/Zantema_04/z011.xml

TRS/Zantema_04/z078.xml

TRS/Zantema_04/z118.xml

TRS/Zantema_04/z068.xml

TRS/Zantema_04/z122.xml

TRS/Zantema_04/z103.xml

TRS/Zantema_04/z015.xml

TRS/Zantema_04/z112.xml

TRS/Zantema_04/z052.xml

TRS/Zantema_04/z067.xml

TRS/Zantema_04/z054.xml

TRS/Zantema_04/z105.xml

TRS/Zantema_04/z076.xml

TRS/Zantema_04/z084.xml

TRS/Zantema_04/z057.xml

TRS/Zantema_04/z073.xml

TRS/Mixed_HO_10/reverse.xml

TRS/Mixed_HO_10/prefixsum.xml

TRS/Mixed_HO_10/loopy.xml

TRS/Mixed_HO_10/app.xml

TRS/Mixed_HO_10/curry.xml

TRS/Mixed_HO_10/lambda3.xml

TRS/Mixed_HO_10/noabs.xml

TRS/Mixed_HO_10/findzero.xml

TRS/Mixed_HO_10/iterative.xml

TRS/Mixed_HO_10/length.xml

TRS/Mixed_HO_10/hrsdif2.xml

TRS/Mixed_HO_10/curry1.xml

TRS/Mixed_HO_10/inlamb.xml

TRS/Mixed_HO_10/process.xml

TRS/Mixed_HO_10/if.xml

TRS/Mixed_HO_10/map.xml

TRS/Mixed_HO_10/sort.xml

TRS/Mixed_HO_10/foldl.xml

TRS/Mixed_HO_10/deriv.xml

TRS/Mixed_HO_10/foobar.xml

TRS/Mixed_HO_10/apply.xml

TRS/Mixed_HO_10/prenex.xml

TRS/Mixed_HO_10/lambda1.xml

TRS/Mixed_HO_10/extrec.xml

TRS/Mixed_HO_10/counterex2.xml

TRS/Mixed_HO_10/qsort.xml

TRS/Mixed_HO_10/from.xml

TRS/Mixed_HO_10/applicative.xml

TRS/Mixed_HO_10/hrsdif1.xml

TRS/Mixed_HO_10/uncurry.xml

TRS/Mixed_HO_10/ordrec.xml

TRS/Mixed_HO_10/plode.xml

TRS/Mixed_HO_10/zipWith.xml

TRS/Mixed_HO_10/eval.xml

TRS/Mixed_HO_10/rec.xml

TRS/Mixed_HO_10/filter.xml

TRS/Mixed_HO_10/onearg.xml

TRS/Mixed_HO_10/lambda2.xml

TRS/Mixed_HO_10/sdu.xml

TRS/Mixed_HO_10/counterex1.xml

TRS/Secret_06_SRS/10.xml

TRS/Secret_06_SRS/secr7.xml

TRS/Secret_06_SRS/multum4.xml

TRS/Secret_06_SRS/aprove05.xml

TRS/Secret_06_SRS/8.xml

TRS/Secret_06_SRS/aprove03.xml

TRS/Secret_06_SRS/aprove07.xml

TRS/Secret_06_SRS/secr9.xml

TRS/Secret_06_SRS/multum6.xml

TRS/Secret_06_SRS/secr10.xml

TRS/Secret_06_SRS/5.xml

TRS/Secret_06_SRS/aprove02.xml

TRS/Secret_06_SRS/3-matchbox.xml

TRS/Secret_06_SRS/secr6.xml

TRS/Secret_06_SRS/multum3.xml

TRS/Secret_06_SRS/secr5.xml

TRS/Secret_06_SRS/7.xml

TRS/Secret_06_SRS/5-matchbox.xml

TRS/Secret_06_SRS/secr1.xml

TRS/Secret_06_SRS/aprove04.xml

TRS/Secret_06_SRS/aprove06.xml

TRS/Secret_06_SRS/multum1.xml

TRS/Secret_06_SRS/2-matchbox.xml

TRS/Secret_06_SRS/aprove09.xml

TRS/Secret_06_SRS/1.xml

TRS/Secret_06_SRS/1-matchbox.xml

TRS/Secret_06_SRS/secr4.xml

TRS/Secret_06_SRS/3.xml

TRS/Secret_06_SRS/aprove01.xml

TRS/Secret_06_SRS/aprove08.xml

TRS/Secret_06_SRS/6.xml

TRS/Secret_06_SRS/secr8.xml

TRS/Secret_06_SRS/multum2.xml

TRS/Secret_06_SRS/2.xml

TRS/Secret_06_SRS/9.xml

TRS/Secret_06_SRS/multum5.xml

TRS/Secret_06_SRS/secr2.xml

TRS/Secret_06_SRS/aprove00.xml

TRS/Secret_06_SRS/secr3.xml

TRS/Trafo_06/dup13.xml

TRS/Trafo_06/dup17.xml

TRS/Trafo_06/dup10.xml

TRS/Trafo_06/un16.xml

TRS/Trafo_06/un09.xml

TRS/Trafo_06/un06.xml

TRS/Trafo_06/un04.xml

TRS/Trafo_06/hom03.xml

TRS/Trafo_06/dup14.xml

TRS/Trafo_06/un07.xml

TRS/Trafo_06/un15.xml

TRS/Trafo_06/hom02.xml

TRS/Trafo_06/un08.xml

TRS/Trafo_06/un02.xml

TRS/Trafo_06/dup08.xml

TRS/Trafo_06/hom01.xml

TRS/Trafo_06/dup07.xml

TRS/Trafo_06/un14.xml

TRS/Trafo_06/dup09.xml

TRS/Trafo_06/dup06.xml

TRS/Trafo_06/un17.xml

TRS/Trafo_06/un10.xml

TRS/Trafo_06/dup15.xml

TRS/Trafo_06/dup12.xml

TRS/Trafo_06/dup01.xml

TRS/Trafo_06/un12.xml

TRS/Trafo_06/dup05.xml

TRS/Trafo_06/un18.xml

TRS/Trafo_06/un13.xml

TRS/Trafo_06/un05.xml

TRS/Trafo_06/dup11.xml

TRS/Trafo_06/un11.xml

TRS/Trafo_06/dup16.xml

TRS/Waldmann_06_SRS/uni-2.xml

TRS/Waldmann_06_SRS/uni-1.xml

TRS/Waldmann_06_SRS/sym-1.xml

TRS/Waldmann_06_SRS/sym-6.xml

TRS/Waldmann_06_SRS/uni-7.xml

TRS/Waldmann_06_SRS/jw3.xml

TRS/Waldmann_06_SRS/sym-2.xml

TRS/Waldmann_06_SRS/uni-5.xml

TRS/Waldmann_06_SRS/uni-4.xml

TRS/Waldmann_06_SRS/jw5.xml

TRS/Waldmann_06_SRS/uni-3.xml

TRS/Waldmann_06_SRS/pi.xml

TRS/Waldmann_06_SRS/sym-4.xml

TRS/Waldmann_06_SRS/jw1.xml

TRS/Waldmann_06_SRS/sym-5.xml

TRS/Waldmann_06_SRS/jw4.xml

TRS/Waldmann_06_SRS/uni-6.xml

TRS/Waldmann_06_SRS/e.xml

TRS/Waldmann_06_SRS/z086-variant.xml

TRS/Applicative_first_order_05/hydra.xml

TRS/Applicative_first_order_05/17.xml

TRS/Applicative_first_order_05/08.xml

TRS/Applicative_first_order_05/#3.22.xml

TRS/Applicative_first_order_05/#3.36.xml

TRS/Applicative_first_order_05/#3.57.xml

TRS/Applicative_first_order_05/#3.40.xml

TRS/Applicative_first_order_05/minsort.xml

TRS/Applicative_first_order_05/11.xml

TRS/Applicative_first_order_05/12.xml

TRS/Applicative_first_order_05/#3.52.xml

TRS/Applicative_first_order_05/#3.45.xml

TRS/Applicative_first_order_05/#3.25.xml

TRS/Applicative_first_order_05/#3.27.xml

TRS/Applicative_first_order_05/#3.18.xml

TRS/Applicative_first_order_05/13.xml

TRS/Applicative_first_order_05/18.xml

TRS/Applicative_first_order_05/#3.16.xml

TRS/Applicative_first_order_05/perfect.xml

TRS/Applicative_first_order_05/#3.2.xml

TRS/Applicative_first_order_05/33.xml

TRS/Applicative_first_order_05/#3.13.xml

TRS/Applicative_first_order_05/30.xml

TRS/Applicative_first_order_05/perfect2.xml

TRS/Applicative_first_order_05/#3.48.xml

TRS/Applicative_first_order_05/#3.38.xml

TRS/Applicative_first_order_05/#3.8.xml

TRS/Applicative_first_order_05/#3.32.xml

TRS/Applicative_first_order_05/02.xml

TRS/Applicative_first_order_05/21.xml

TRS/Applicative_first_order_05/#3.10.xml

TRS/Applicative_first_order_05/31.xml

TRS/Applicative_first_order_05/06.xml

TRS/Applicative_first_order_05/01.xml

TRS/Applicative_first_order_05/#3.6.xml

TRS/Applicative_first_order_05/motivation.xml

TRS/Applicative_first_order_05/29.xml

TRS/Applicative_first_order_05/#3.55.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_FR.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_complete-noand_L.xml

TRS/Strategy_outermost_added_08/#4.3.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02_Z.xml

TRS/Strategy_outermost_added_08/PALINDROME_nokinds_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex8_BLR02_L.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_noand_GM.xml

TRS/Strategy_outermost_added_08/ExAppendixB_AEL03.xml

TRS/Strategy_outermost_added_08/test75.xml

TRS/Strategy_outermost_added_08/Ex4_7_37_Bor03_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_GM.xml

TRS/Strategy_outermost_added_08/Ex6_9_Luc02c_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_complete_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_Z.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_FR.xml

TRS/Strategy_outermost_added_08/OvConsOS_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex3_2_Luc97_L.xml

TRS/Strategy_outermost_added_08/MYNAT_complete_L.xml

TRS/Strategy_outermost_added_08/PEANO_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/#4.4.xml

TRS/Strategy_outermost_added_08/PALINDROME_nosorts_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex4_Zan97.xml

TRS/Strategy_outermost_added_08/Ex7_BLR02.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_FR.xml

TRS/Strategy_outermost_added_08/Ex3_3_25_Bor03_Z.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_Z.xml

TRS/Strategy_outermost_added_08/Ex1_2_Luc02c.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_iGM.xml

TRS/Strategy_outermost_added_08/PALINDROME_complete_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_FR.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_FR.xml

TRS/Strategy_outermost_added_08/Ex4_7_15_Bor03.xml

TRS/Strategy_outermost_added_08/#4.7.xml

TRS/Strategy_outermost_added_08/Ex9_BLR02.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex1_GM03_Z.xml

TRS/Strategy_outermost_added_08/MYNAT_complete-noand_L.xml

TRS/Strategy_outermost_added_08/ExConc_Zan97.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nokinds_L.xml

TRS/Strategy_outermost_added_08/#4.2.xml

TRS/Strategy_outermost_added_08/Ex4_7_77_Bor03_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_Z.xml

TRS/Strategy_outermost_added_08/test10.xml

TRS/Strategy_outermost_added_08/#4.13.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97_FR.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a.xml

TRS/Strategy_outermost_added_08/PEANO_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02_L.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97_L.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_Z.xml

TRS/Strategy_outermost_added_08/muladd.xml

TRS/Strategy_outermost_added_08/jwno1.xml

TRS/Strategy_outermost_added_08/Ex5_Zan97_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_Z.xml

TRS/Strategy_outermost_added_08/Ex5_Zan97.xml

TRS/Strategy_outermost_added_08/Ex4_Zan97_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete_L.xml

TRS/Strategy_outermost_added_08/Ex15_Luc98.xml

TRS/Strategy_outermost_added_08/jwno6.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_GM.xml

TRS/Strategy_outermost_added_08/Ex1_2_AEL03_L.xml

TRS/Strategy_outermost_added_08/PEANO_complete_L.xml

TRS/Strategy_outermost_added_08/Ex4_7_77_Bor03.xml

TRS/Strategy_outermost_added_08/Ex5_7_Luc97.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b_Z.xml

TRS/Strategy_outermost_added_08/Ex3_12_Luc96a_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01.xml

TRS/Strategy_outermost_added_08/PEANO_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_L.xml

TRS/Strategy_outermost_added_08/test9.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_GM.xml

TRS/Strategy_outermost_added_08/Ex6_Luc98.xml

TRS/Strategy_outermost_added_08/MYNAT_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/MYNAT_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex4_7_56_Bor03_L.xml

TRS/Strategy_outermost_added_08/MYNAT_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_GM.xml

TRS/Strategy_outermost_added_08/Ex26_Luc03b.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_L.xml

TRS/Strategy_outermost_added_08/#4.14.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b_FR.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_FR.xml

TRS/Strategy_outermost_added_08/jwno4.xml

TRS/Strategy_outermost_added_08/Ex15_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex49_GM04_L.xml

TRS/Strategy_outermost_added_08/Ex1_2_Luc02c_L.xml

TRS/Strategy_outermost_added_08/ExAppendixB_AEL03_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97.xml

TRS/Strategy_outermost_added_08/#4.12a.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02.xml

TRS/Strategy_outermost_added_08/ExConc_Zan97_Z.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_FR.xml

TRS/Strategy_outermost_added_08/OvConsOS_complete_L.xml

TRS/Strategy_outermost_added_08/Ex15_Luc98_L.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_FR.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02.xml

TRS/Strategy_outermost_added_08/Ex2_Luc03b.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex5_7_Luc97_L.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a_L.xml

TRS/Strategy_outermost_added_08/Ex3_3_25_Bor03.xml

TRS/Strategy_outermost_added_08/toyama.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_iGM.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex3_2_Luc97.xml

TRS/Strategy_outermost_added_08/Ex1_GM03.xml

TRS/Strategy_outermost_added_08/Ex6_GM04.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/n001.xml

TRS/Strategy_outermost_added_08/Ex4_7_56_Bor03.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_L.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_FR.xml

TRS/Strategy_outermost_added_08/Ex24_GM04_GM.xml

TRS/Strategy_outermost_added_08/gkg.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_Z.xml

TRS/Strategy_outermost_added_08/#4.17.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_L.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b.xml

TRS/Strategy_outermost_added_08/Ex6_9_Luc02c.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_Z.xml

TRS/Strategy_outermost_added_08/PEANO_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_Z.xml

TRS/Strategy_outermost_added_08/jwno9.xml

TRS/Strategy_outermost_added_08/Ex16_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97_L.xml

TRS/Strategy_outermost_added_08/PEANO_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex8_BLR02.xml

TRS/Strategy_outermost_added_08/test77.xml

TRS/Strategy_outermost_added_08/Ex1_Luc02b.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_Z.xml

TRS/Strategy_outermost_added_08/Ex6_GM04_FR.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_GM.xml

TRS/Strategy_outermost_added_08/MYNAT_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_iGM.xml

TRS/Strategy_outermost_added_08/ExSec4_2_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/Ex7_BLR02_L.xml

TRS/Strategy_outermost_added_08/Ex24_GM04_L.xml

TRS/Strategy_outermost_added_08/Ex3_12_Luc96a.xml

TRS/Strategy_outermost_added_08/#4.15.xml

TRS/Strategy_outermost_added_08/Ex1_GM03_L.xml

TRS/Strategy_outermost_added_08/Ex1_2_AEL03.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_FR.xml

TRS/Strategy_outermost_added_08/Ex24_GM04.xml

TRS/Strategy_outermost_added_08/ExSec11_1_Luc02a.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_GM.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex1_Luc02b_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_noand_GM.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_FR.xml

TRS/Strategy_outermost_added_08/#4.18.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex9_Luc06_FR.xml

TRS/Strategy_outermost_added_08/#4.16.xml

TRS/Strategy_outermost_added_08/PALINDROME_complete-noand_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97_Z.xml

TRS/Strategy_outermost_added_08/Ex1_GM99.xml

TRS/Strategy_outermost_added_08/Ex4_7_37_Bor03.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99_L.xml

TRS/Strategy_outermost_added_08/test76.xml

TRS/Strategy_outermost_added_08/PALINDROME_nokinds-noand_L.xml

TRS/AProVE_09_Inductive/qsortlast.xml

TRS/AProVE_09_Inductive/minsort.xml

TRS/AProVE_09_Inductive/zerolist.xml

TRS/AProVE_09_Inductive/mod.xml

TRS/AProVE_09_Inductive/div.xml

TRS/AProVE_09_Inductive/gcdhard.xml

TRS/AProVE_09_Inductive/divhard.xml

TRS/AProVE_09_Inductive/qsort.xml

TRS/AProVE_09_Inductive/gcd2.xml

TRS/AProVE_09_Inductive/qsortmiddle.xml

TRS/AProVE_09_Inductive/maxsortcondition.xml

TRS/AProVE_09_Inductive/log.xml

TRS/AProVE_09_Inductive/gcd.xml

TRS/AProVE_09_Inductive/maxsort.xml

TRS/AProVE_08/id_inc.xml

TRS/AProVE_08/parting03_minsort.xml

TRS/AProVE_08/parting05_maxsort.xml

TRS/AProVE_08/round_nonterm.xml

TRS/AProVE_08/log.xml

TRS/AProVE_08/parting04_maxsort_h.xml

TRS/AProVE_08/parting01_reverse.xml

TRS/AProVE_08/thiemann40_modified.xml

TRS/AProVE_08/round.xml

TRS/AProVE_08/parting02_doublelist.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-5.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-6.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-19.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-1.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-14.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-21.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-3.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-1.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-18.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-7.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-10.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-17.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-2.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-4.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-15.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-3.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-13.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-16.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-4.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-20.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-2.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-11.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-8.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-9.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-12.xml

TRS/Various_04/10.xml

TRS/Various_04/04.xml

TRS/Various_04/08.xml

TRS/Various_04/24.xml

TRS/Various_04/11.xml

TRS/Various_04/19.xml

TRS/Various_04/12.xml

TRS/Various_04/03.xml

TRS/Various_04/14.xml

TRS/Various_04/27.xml

TRS/Various_04/13.xml

TRS/Various_04/23.xml

TRS/Various_04/26.xml

TRS/Various_04/09.xml

TRS/Various_04/15.xml

TRS/Various_04/25.xml

TRS/Various_04/18.xml

TRS/Various_04/02.xml

TRS/Various_04/21.xml

TRS/Various_04/07.xml

TRS/Various_04/06.xml

TRS/Various_04/22.xml

TRS/Various_04/05.xml

TRS/Mixed_innermost/test75.xml

TRS/Mixed_innermost/innermost2.xml

TRS/Mixed_innermost/innermost1.xml

TRS/Mixed_innermost/wiehe13.xml

TRS/Mixed_innermost/test10.xml

TRS/Mixed_innermost/muladd.xml

TRS/Mixed_innermost/cade12.xml

TRS/Mixed_innermost/cade13.xml

TRS/Mixed_innermost/test9.xml

TRS/Mixed_innermost/bn111.xml

TRS/Mixed_innermost/tricky1.xml

TRS/Mixed_innermost/test830.xml

TRS/Mixed_innermost/toyama.xml

TRS/Mixed_innermost/innermost3.xml

TRS/Mixed_innermost/n001.xml

TRS/Mixed_innermost/gkg.xml

TRS/Mixed_innermost/test833.xml

TRS/Mixed_innermost/innermost4.xml

TRS/Mixed_innermost/cade04.xml

TRS/Mixed_innermost/test77.xml

TRS/Mixed_innermost/innermost5.xml

TRS/Mixed_innermost/cade05.xml

TRS/Mixed_innermost/wiehe14.xml

TRS/Mixed_innermost/test76.xml

TRS/AProVE_06/div_notCeTermin.xml

TRS/AProVE_06/sizeChange.xml

TRS/AProVE_06/identity.xml

TRS/AProVE_06/nonterm.xml

TRS/AProVE_06/quot.xml

TRS/AProVE_06/tower.xml

TRS/AProVE_06/tower_sizeChange.xml

TRS/AProVE_06/quicksort.xml

TRS/AProVE_06/factorial1.xml

TRS/AProVE_06/mapHard.xml

TRS/AProVE_06/modulo.xml

TRS/AProVE_06/factorial2.xml

TRS/AProVE_06/div_notTermin.xml

TRS/AProVE_06/logarithm.xml

TRS/CSR_04/Ex14_Luc06.xml

TRS/CSR_04/ExIntrod_GM04.xml

TRS/CSR_04/ExAppendixB_AEL03.xml

TRS/CSR_04/ExSec4_2_DLMMU04.xml

TRS/CSR_04/Ex49_GM04.xml

TRS/CSR_04/Ex4_Zan97.xml

TRS/CSR_04/Ex7_BLR02.xml

TRS/CSR_04/Ex25_Luc06.xml

TRS/CSR_04/Ex1_2_Luc02c.xml

TRS/CSR_04/Ex4_7_15_Bor03.xml

TRS/CSR_04/Ex24_Luc06.xml

TRS/CSR_04/Ex9_BLR02.xml

TRS/CSR_04/ExConc_Zan97.xml

TRS/CSR_04/ExProp7_Luc06.xml

TRS/CSR_04/Ex1_GL02a.xml

TRS/CSR_04/Ex5_Zan97.xml

TRS/CSR_04/Ex15_Luc98.xml

TRS/CSR_04/Ex9_Luc06.xml

TRS/CSR_04/Ex4_7_77_Bor03.xml

TRS/CSR_04/Ex5_7_Luc97.xml

TRS/CSR_04/ExIntrod_GM01.xml

TRS/CSR_04/Ex5_DLMMU04.xml

TRS/CSR_04/Ex6_Luc98.xml

TRS/CSR_04/Ex16_Luc06.xml

TRS/CSR_04/Ex15_Luc06.xml

TRS/CSR_04/Ex26_Luc03b.xml

TRS/CSR_04/Ex4_DLMMU04.xml

TRS/CSR_04/ExIntrod_GM99.xml

TRS/CSR_04/ExIntrod_Zan97.xml

TRS/CSR_04/Ex14_AEGL02.xml

TRS/CSR_04/Ex23_Luc06.xml

TRS/CSR_04/Ex6_15_AEL02.xml

TRS/CSR_04/Ex2_Luc03b.xml

TRS/CSR_04/Ex2_Luc02a.xml

TRS/CSR_04/Ex3_3_25_Bor03.xml

TRS/CSR_04/Ex3_2_Luc97.xml

TRS/CSR_04/Ex1_GM03.xml

TRS/CSR_04/Ex6_GM04.xml

TRS/CSR_04/Ex4_7_56_Bor03.xml

TRS/CSR_04/Ex1_Zan97.xml

TRS/CSR_04/Ex4_4_Luc96b.xml

TRS/CSR_04/Ex9_Luc04.xml

TRS/CSR_04/Ex6_9_Luc02c.xml

TRS/CSR_04/ExSec11_1_Luc02a-TRCSR.xml

TRS/CSR_04/Ex8_BLR02.xml

TRS/CSR_04/Ex1_Luc02b.xml

TRS/CSR_04/Ex3_12_Luc96a.xml

TRS/CSR_04/Ex1_2_AEL03.xml

TRS/CSR_04/Ex24_GM04.xml

TRS/CSR_04/ExSec11_1_Luc02a.xml

TRS/CSR_04/Ex1_Luc04b.xml

TRS/CSR_04/Ex1_GM99.xml

TRS/CSR_04/Ex4_7_37_Bor03.xml

TRS/Der95/17.xml

TRS/Der95/04.xml

TRS/Der95/32.xml

TRS/Der95/08.xml

TRS/Der95/11.xml

TRS/Der95/12.xml

TRS/Der95/03.xml

TRS/Der95/28.xml

TRS/Der95/27.xml

TRS/Der95/13.xml

TRS/Der95/09.xml

TRS/Der95/18.xml

TRS/Der95/20.xml

TRS/Der95/33.xml

TRS/Der95/30.xml

TRS/Der95/02.xml

TRS/Der95/21.xml

TRS/Der95/07.xml

TRS/Der95/31.xml

TRS/Der95/06.xml

TRS/Der95/01.xml

TRS/Secret_05_TRS/aprove4.xml

TRS/Secret_05_TRS/aprove1.xml

TRS/Secret_05_TRS/teparla1.xml

TRS/Secret_05_TRS/aprove3.xml

TRS/Secret_05_TRS/teparla3.xml

TRS/Secret_05_TRS/tpa5.xml

TRS/Secret_05_TRS/tpa1.xml

TRS/Secret_05_TRS/tpa4.xml

TRS/Secret_05_TRS/cime3.xml

TRS/Secret_05_TRS/ttt1.xml

TRS/Secret_05_TRS/cime4.xml

TRS/Secret_05_TRS/matchbox2.xml

TRS/Secret_05_TRS/tpa3.xml

TRS/Secret_05_TRS/tpa2.xml

TRS/Secret_05_TRS/cime2.xml

TRS/Secret_05_TRS/teparla2.xml

TRS/Secret_05_TRS/cime1.xml

TRS/Secret_05_TRS/ttt2.xml

TRS/Secret_05_TRS/aprove5.xml

TRS/Secret_05_TRS/matchbox1.xml

TRS/Secret_05_TRS/cime5.xml

TRS/Secret_05_TRS/aprove2.xml

TRS/Rubio_04/polo2.xml

TRS/Rubio_04/bintrees.xml

TRS/Rubio_04/mfp95.xml

TRS/Rubio_04/wst99.xml

TRS/Rubio_04/division.xml

TRS/Rubio_04/mfp90b.xml

TRS/Rubio_04/gmnp.xml

TRS/Rubio_04/quick.xml

TRS/Rubio_04/p266.xml

TRS/Rubio_04/lescanne.xml

TRS/Rubio_04/ma96.xml

TRS/Rubio_04/aoto.xml

TRS/Rubio_04/elimdupl.xml

TRS/Rubio_04/selsort.xml

TRS/Rubio_04/prov.xml

TRS/Rubio_04/revlist.xml

TRS/Rubio_04/gm.xml

TRS/Rubio_04/nestrec.xml

TRS/Rubio_04/enno.xml

TRS/Rubio_04/quotminus.xml

TRS/Rubio_04/test4.xml

TRS/Rubio_04/gcd.xml

TRS/Rubio_04/bn129.xml

TRS/Rubio_04/logarquot.xml

TRS/Rubio_04/bn122.xml

TRS/Rubio_04/koen.xml

TRS/Rubio_04/lindau.xml

TRS/Rubio_04/test829.xml

TRS/Zantema_08/yoyo_3.xml

TRS/Zantema_08/f_5_1.xml

TRS/Zantema_08/g_2_const.xml

TRS/Zantema_08/ex2.xml

TRS/Zantema_08/ex5.xml

TRS/Zantema_08/bintree.xml

TRS/Zantema_08/cariboo_nl_3.xml

TRS/Zantema_08/assoc_f_rhs.xml

TRS/Zantema_08/ex1.xml

TRS/Zantema_08/morse.xml

TRS/Zantema_08/ex8.xml

TRS/Zantema_08/f_2_2.xml

TRS/Zantema_08/cariboo_add3.xml

TRS/Zantema_08/ex6.xml

TRS/Zantema_08/countter.xml

TRS/Zantema_08/ex7.xml

TRS/Zantema_08/from_three.xml

TRS/Zantema_08/cariboo_add2a.xml

TRS/Zantema_08/ex3.xml

TRS/Zantema_08/toyama_stop.xml

TRS/Zantema_08/yoyo_3b.xml

TRS/Zantema_08/outermost_gr.xml

TRS/Zantema_08/ex0.xml

TRS/Zantema_08/cariboo_add2.xml

TRS/Zantema_08/yoyo_3a.xml

TRS/Zantema_08/cariboo_nl_5.xml

TRS/Zantema_08/dupl_rhs.xml

TRS/Zantema_08/cariboo_len3.xml

TRS/Zantema_08/ffg.xml

TRS/Zantema_08/cariboo_nl_2.xml

TRS/Zantema_08/ffb_SL.xml

TRS/Zantema_08/f_5_2.xml

TRS/Zantema_08/from_one.xml

TRS/Zantema_08/from_one_a.xml

TRS/Zantema_08/cariboo_nl_1.xml

TRS/Zantema_08/yoyo_2.xml

TRS/Zantema_08/f_5.xml

TRS/Zantema_08/f_2_1.xml

TRS/Zantema_08/ex4.xml

TRS/Zantema_08/cariboo_add1.xml

TRS/Zantema_08/cariboo_nl_6.xml

TRS/Zantema_08/g_2_f_var.xml

TRS/Zantema_08/countbin.xml

TRS/Zantema_08/fg.xml

TRS/Zantema_08/cariboo_nl_4.xml

TRS/Zantema_08/ex9.xml

TRS/Zantema_08/inn_out.xml

TRS/Zantema_08/toyama_stop2.xml

TRS/Zantema_08/assoc_c_rhs.xml

TRS/Maude_06/LengthOfFiniteLists_nokinds-noand.xml

TRS/Maude_06/MYNAT_nokinds.xml

TRS/Maude_06/LISTUTILITIES_complete-noand.xml

TRS/Maude_06/LengthOfFiniteLists_nosorts.xml

TRS/Maude_06/MYNAT_nosorts.xml

TRS/Maude_06/PALINDROME_complete-noand.xml

TRS/Maude_06/OvConsOS_nosorts.xml

TRS/Maude_06/MYNAT_complete-noand.xml

TRS/Maude_06/MYNAT_nosorts-noand.xml

TRS/Maude_06/MYNAT_nokinds-peanoSimple.xml

TRS/Maude_06/LengthOfFiniteLists_complete.xml

TRS/Maude_06/LISTUTILITIES_complete.xml

TRS/Maude_06/PALINDROME_nosorts.xml

TRS/Maude_06/LengthOfFiniteLists_nosorts-noand.xml

TRS/Maude_06/MYNAT_nokinds-noand.xml

TRS/Maude_06/MYNAT_nokinds-noand-peanoSimple.xml

TRS/Maude_06/MYNAT_complete.xml

TRS/Maude_06/LISTUTILITIES_nokinds.xml

TRS/Maude_06/MYNAT_complete-peanoSimple.xml

TRS/Maude_06/OvConsOS_nosorts-noand.xml

TRS/Maude_06/OvConsOS_complete.xml

TRS/Maude_06/LengthOfFiniteLists_nokinds.xml

TRS/Maude_06/OvConsOS_nokinds-noand.xml

TRS/Maude_06/LengthOfFiniteLists_complete-noand.xml

TRS/Maude_06/LISTUTILITIES_nosorts.xml

TRS/Maude_06/LISTUTILITIES_nosorts-noand.xml

TRS/Maude_06/MYNAT_complete-noand-peanoSimple.xml

TRS/Maude_06/PALINDROME_nokinds.xml

TRS/Maude_06/csrdiv.xml

TRS/Maude_06/LISTUTILITIES_nokinds-noand.xml

TRS/Maude_06/PALINDROME_complete.xml

TRS/Maude_06/MYNAT_nosorts-peanoSimple.xml

TRS/Maude_06/OvConsOS_nokinds.xml

TRS/Maude_06/PALINDROME_nokinds-noand.xml

TRS/Maude_06/MYNAT_nosorts-noand-peanoSimple.xml

TRS/Maude_06/OvConsOS_complete-noand.xml

TRS/Maude_06/emmes.xml

TRS/Maude_06/PALINDROME_nosorts-noand.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_C.xml

TRS/Transformed_CSR_04/Ex1_Zan97_C.xml

TRS/Transformed_CSR_04/PEANO_complete_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_iGM.xml

TRS/Transformed_CSR_04/Ex4_Zan97_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex6_Luc98_L.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_iGM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_C.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_L.xml

TRS/Transformed_CSR_04/Ex8_BLR02_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_Z.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_L.xml

TRS/Transformed_CSR_04/Ex1_GM03_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_L.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_L.xml

TRS/Transformed_CSR_04/Ex49_GM04_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_L.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_iGM.xml

TRS/Transformed_CSR_04/Ex4_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex18_Luc06_Z.xml

TRS/Transformed_CSR_04/Ex9_BLR02_iGM.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/PEANO_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc98_Z.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_L.xml

TRS/Transformed_CSR_04/Ex25_Luc06_L.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_L.xml

TRS/Transformed_CSR_04/Ex9_Luc04_C.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_Z.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts-noand_L.xml

TRS/Transformed_CSR_04/Ex9_BLR02_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_FR.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_iGM.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_L.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_L.xml

TRS/Transformed_CSR_04/Ex1_Zan97_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex6_Luc98_Z.xml

TRS/Transformed_CSR_04/Ex16_Luc06_iGM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_L.xml

TRS/Transformed_CSR_04/Ex4_Zan97_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex23_Luc06_L.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_Z.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_FR.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_iGM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_C.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex7_BLR02_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_Z.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_noand_GM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_Z.xml

TRS/Transformed_CSR_04/PALINDROME_complete_L.xml

TRS/Transformed_CSR_04/Ex1_GL02a_iGM.xml

TRS/Transformed_CSR_04/MYNAT_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex9_Luc04_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_GM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_GM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex5_Zan97_Z.xml

TRS/Transformed_CSR_04/Ex6_GM04_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_C.xml

TRS/Transformed_CSR_04/Ex6_Luc98_FR.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_FR.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_Z.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex9_Luc06_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_L.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_C.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex49_GM04_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex49_GM04_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_Z.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_L.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_C.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_L.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_C.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_GM.xml

TRS/Transformed_CSR_04/MYNAT_complete_GM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_FR.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_GM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_GM.xml

TRS/Transformed_CSR_04/Ex7_BLR02_Z.xml

TRS/Transformed_CSR_04/Ex1_GM99_C.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_L.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex6_Luc98_iGM.xml

TRS/Transformed_CSR_04/Ex23_Luc06_Z.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_L.xml

TRS/Transformed_CSR_04/Ex7_BLR02_iGM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_C.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_iGM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_FR.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_Z.xml

TRS/Transformed_CSR_04/Ex1_GL02a_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_FR.xml

TRS/Transformed_CSR_04/Ex5_Zan97_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/ExConc_Zan97_L.xml

TRS/Transformed_CSR_04/Ex23_Luc06_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_GM.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_FR.xml

TRS/Transformed_CSR_04/Ex23_Luc06_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex4_Zan97_L.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_L.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_L.xml

TRS/Transformed_CSR_04/Ex7_BLR02_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_C.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_GM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_iGM.xml

TRS/Transformed_CSR_04/Ex5_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_L.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_C.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex18_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_L.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_FR.xml

TRS/Transformed_CSR_04/PEANO_nokinds_iGM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_GM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_C.xml

TRS/Transformed_CSR_04/Ex6_Luc98_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_iGM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_C.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_GM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_C.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_FR.xml

TRS/Transformed_CSR_04/PEANO_complete_L.xml

TRS/Transformed_CSR_04/Ex25_Luc06_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_iGM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_FR.xml

TRS/Transformed_CSR_04/MYNAT_complete_Z.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_Z.xml

TRS/Transformed_CSR_04/ExConc_Zan97_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex15_Luc98_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PALINDROME_complete-noand_FR.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_L.xml

TRS/Transformed_CSR_04/PEANO_nosorts_C.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_L.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_C.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_GM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_L.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_Z.xml

TRS/Transformed_CSR_04/PEANO_nokinds_C.xml

TRS/Transformed_CSR_04/Ex1_GM99_GM.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_C.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_FR.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_GM.xml

TRS/Transformed_CSR_04/PEANO_complete_GM.xml

TRS/Transformed_CSR_04/Ex8_BLR02_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_L.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_GM.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_Z.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_L.xml

TRS/Transformed_CSR_04/Ex1_Zan97_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_complete_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_C.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_L.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_C.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_L.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex6_GM04_GM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_C.xml

TRS/Transformed_CSR_04/Ex1_GM03_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_L.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex5_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_Z.xml

TRS/Transformed_CSR_04/Ex4_Zan97_GM.xml

TRS/Transformed_CSR_04/PEANO_complete_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc06_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_L.xml

TRS/Transformed_CSR_04/Ex8_BLR02_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_FR.xml

TRS/Transformed_CSR_04/Ex49_GM04_FR.xml

TRS/Transformed_CSR_04/MYNAT_complete_C.xml

TRS/Transformed_CSR_04/Ex15_Luc06_FR.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_iGM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc98_C.xml

TRS/Transformed_CSR_04/Ex25_Luc06_Z.xml

TRS/Transformed_CSR_04/Ex16_Luc06_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_C.xml

TRS/Transformed_CSR_04/Ex49_GM04_L.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_iGM.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_L.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_Z.xml

TRS/Transformed_CSR_04/Ex16_Luc06_C.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_L.xml

TRS/Transformed_CSR_04/Ex18_Luc06_iGM.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_FR.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_C.xml

TRS/Transformed_CSR_04/Ex15_Luc06_Z.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex4_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex24_GM04_C.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex15_Luc98_GM.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_C.xml

TRS/Transformed_CSR_04/Ex8_BLR02_FR.xml

TRS/Transformed_CSR_04/OvConsOS_complete_L.xml

TRS/Transformed_CSR_04/Ex15_Luc98_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_C.xml

TRS/Transformed_CSR_04/Ex8_BLR02_GM.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_Z.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_Z.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete_Z.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_GM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_FR.xml

TRS/Transformed_CSR_04/PEANO_nokinds_FR.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_FR.xml

TRS/Transformed_CSR_04/OvConsOS_complete_iGM.xml

TRS/Transformed_CSR_04/Ex23_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_FR.xml

TRS/Transformed_CSR_04/Ex7_BLR02_GM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_L.xml

TRS/Transformed_CSR_04/MYNAT_complete_FR.xml

TRS/Transformed_CSR_04/Ex9_Luc06_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_C.xml

TRS/Transformed_CSR_04/Ex6_GM04_L.xml

TRS/Transformed_CSR_04/Ex24_GM04_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds-noand_L.xml

TRS/Transformed_CSR_04/Ex1_GM99_iGM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex24_GM04_Z.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_C.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_C.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_iGM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts-noand_L.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_Z.xml

TRS/Transformed_CSR_04/Ex24_GM04_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_FR.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_Z.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_iGM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_C.xml

TRS/Transformed_CSR_04/Ex15_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_complete_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_Z.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_L.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_iGM.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_L.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_L.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_C.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_L.xml

TRS/Transformed_CSR_04/Ex23_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex16_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_GM.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_C.xml

TRS/Transformed_CSR_04/Ex9_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_Z.xml

TRS/Transformed_CSR_04/Ex9_Luc04_GM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts-noand_L.xml

TRS/Transformed_CSR_04/PALINDROME_complete_GM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_L.xml

TRS/Transformed_CSR_04/Ex24_Luc06_iGM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_L.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_iGM.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_iGM.xml

TRS/Transformed_CSR_04/Ex7_BLR02_L.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_iGM.xml

TRS/Transformed_CSR_04/Ex15_Luc98_iGM.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_FR.xml

TRS/Transformed_CSR_04/Ex5_Zan97_iGM.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_Z.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex1_GM03_L.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_L.xml

TRS/Transformed_CSR_04/Ex24_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_iGM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_L.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete-noand_L.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_iGM.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_GM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_C.xml

TRS/Transformed_CSR_04/Ex14_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_iGM.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_L.xml

TRS/Transformed_CSR_04/Ex1_GL02a_C.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_iGM.xml

TRS/Transformed_CSR_04/Ex24_Luc06_C.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_C.xml

TRS/Transformed_CSR_04/Ex24_GM04_FR.xml

TRS/Transformed_CSR_04/Ex8_BLR02_Z.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_iGM.xml

TRS/Transformed_CSR_04/Ex49_GM04_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_Z.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/PALINDROME_complete_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex5_Zan97_C.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_iGM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_GM.xml

TRS/Transformed_CSR_04/Ex6_GM04_C.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_noand_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_FR.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_C.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_iGM.xml

TRS/Transformed_CSR_04/PEANO_complete_Z.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_iGM.xml

TRS/Transformed_CSR_04/Ex1_GM03_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_iGM.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_FR.xml

TRS/Transformed_CSR_04/Ex6_Luc98_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_Z.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_iGM.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_iGM.xml

TRS/Transformed_CSR_04/Ex1_GM03_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_L.xml

TRS/Transformed_CSR_04/Ex15_Luc06_C.xml

TRS/Transformed_CSR_04/PALINDROME_complete_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_iGM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex1_GL02a_FR.xml

File:RC-8.0.txt

2011-03-01T15:04:21Z

Zini: RC testbed for TPDB 8.0

TRS/ICFP_2010/211639.xml

TRS/ICFP_2010/28464.xml

TRS/ICFP_2010/213281.xml

TRS/ICFP_2010/27235.xml

TRS/ICFP_2010/40708.xml

TRS/ICFP_2010/230819.xml

TRS/ICFP_2010/54622.xml

TRS/ICFP_2010/54532.xml

TRS/ICFP_2010/247254.xml

TRS/ICFP_2010/25192.xml

TRS/ICFP_2010/27280.xml

TRS/ICFP_2010/230948.xml

TRS/ICFP_2010/247992.xml

TRS/ICFP_2010/212480.xml

TRS/ICFP_2010/26103.xml

TRS/ICFP_2010/25731.xml

TRS/ICFP_2010/158152.xml

TRS/ICFP_2010/264370.xml

TRS/ICFP_2010/247906.xml

TRS/ICFP_2010/246924.xml

TRS/ICFP_2010/58301.xml

TRS/ICFP_2010/26123.xml

TRS/ICFP_2010/40093.xml

TRS/ICFP_2010/231480.xml

TRS/ICFP_2010/26130.xml

TRS/ICFP_2010/213437.xml

TRS/ICFP_2010/231230.xml

TRS/ICFP_2010/160263.xml

TRS/ICFP_2010/247504.xml

TRS/ICFP_2010/249386.xml

TRS/ICFP_2010/27131.xml

TRS/ICFP_2010/58194.xml

TRS/ICFP_2010/231149.xml

TRS/ICFP_2010/28293.xml

TRS/ICFP_2010/231043.xml

TRS/ICFP_2010/26226.xml

TRS/ICFP_2010/26186.xml

TRS/ICFP_2010/264405.xml

TRS/ICFP_2010/231300.xml

TRS/ICFP_2010/214091.xml

TRS/ICFP_2010/249663.xml

TRS/ICFP_2010/157388.xml

TRS/ICFP_2010/248060.xml

TRS/ICFP_2010/249459.xml

TRS/ICFP_2010/211471.xml

TRS/ICFP_2010/27213.xml

TRS/ICFP_2010/211857.xml

TRS/ICFP_2010/27030.xml

TRS/ICFP_2010/45720.xml

TRS/ICFP_2010/26291.xml

TRS/ICFP_2010/28643.xml

TRS/ICFP_2010/213560.xml

TRS/ICFP_2010/28838.xml

TRS/ICFP_2010/247020.xml

TRS/ICFP_2010/230780.xml

TRS/ICFP_2010/45757.xml

TRS/ICFP_2010/212094.xml

TRS/ICFP_2010/212117.xml

TRS/ICFP_2010/26069.xml

TRS/ICFP_2010/212612.xml

TRS/ICFP_2010/231604.xml

TRS/ICFP_2010/48262.xml

TRS/ICFP_2010/231378.xml

TRS/ICFP_2010/27134.xml

TRS/ICFP_2010/57355.xml

TRS/ICFP_2010/212421.xml

TRS/ICFP_2010/213611.xml

TRS/ICFP_2010/212693.xml

TRS/ICFP_2010/26683.xml

TRS/ICFP_2010/211960.xml

TRS/ICFP_2010/214011.xml

TRS/Mixed_CTRS/quick.xml

TRS/Mixed_TRS/hydra.xml

TRS/Mixed_TRS/jones4.xml

TRS/Mixed_TRS/while.xml

TRS/Mixed_TRS/minsort.xml

TRS/Mixed_TRS/Ex1_Luc04b_GM.xml

TRS/Mixed_TRS/jones5.xml

TRS/Mixed_TRS/hydra-Zantema06.xml

TRS/Mixed_TRS/gcd_triple.xml

TRS/Mixed_TRS/jones1.xml

TRS/Mixed_TRS/test1.xml

TRS/Mixed_TRS/jones6.xml

TRS/Mixed_TRS/perfect.xml

TRS/Mixed_TRS/perfect2.xml

TRS/Mixed_TRS/gcdMinMax.xml

TRS/Mixed_TRS/gcd.xml

TRS/Mixed_TRS/jones2.xml

TRS/Strategy_removed_AG01/#4.30c.xml

TRS/AG01/#3.51.xml

TRS/AG01/#3.53b.xml

TRS/AG01/#3.39.xml

TRS/AG01/#3.22.xml

TRS/AG01/#3.35.xml

TRS/AG01/#3.12.xml

TRS/AG01/#3.54.xml

TRS/AG01/#3.36.xml

TRS/AG01/#3.57.xml

TRS/AG01/#3.40.xml

TRS/AG01/#3.6a.xml

TRS/AG01/#3.4.xml

TRS/AG01/#3.56.xml

TRS/AG01/#3.42.xml

TRS/AG01/#3.5a.xml

TRS/AG01/#3.7.xml

TRS/AG01/#3.52.xml

TRS/AG01/#3.47.xml

TRS/AG01/#3.53a.xml

TRS/AG01/#3.24.xml

TRS/AG01/#3.8b.xml

TRS/AG01/#3.18.xml

TRS/AG01/#3.23.xml

TRS/AG01/#3.37.xml

TRS/AG01/#3.26.xml

TRS/AG01/#3.16.xml

TRS/AG01/#3.33.xml

TRS/AG01/#3.2.xml

TRS/AG01/#4.30c.xml

TRS/AG01/#3.41.xml

TRS/AG01/#3.13.xml

TRS/AG01/#3.5b.xml

TRS/AG01/#3.1.xml

TRS/AG01/#3.19.xml

TRS/AG01/#3.8a.xml

TRS/AG01/#3.48.xml

TRS/AG01/#3.38.xml

TRS/AG01/#3.17.xml

TRS/AG01/#3.29.xml

TRS/AG01/#3.6b.xml

TRS/AG01/#3.10.xml

TRS/AG01/#3.15.xml

TRS/AG01/#3.49.xml

TRS/AG01/#3.53.xml

TRS/AG01/#3.6.xml

TRS/AG01/#3.5.xml

TRS/AG01/#3.17a.xml

TRS/AG01/#3.55.xml

TRS/AG01/#3.31.xml

TRS/GTSSK07/cade09.xml

TRS/GTSSK07/cade03.xml

TRS/GTSSK07/cade07.xml

TRS/GTSSK07/cade08.xml

TRS/GTSSK07/cade17.xml

TRS/GTSSK07/cade13t.xml

TRS/GTSSK07/cade15.xml

TRS/GTSSK07/cade16.xml

TRS/GTSSK07/cade01.xml

TRS/GTSSK07/cade05t.xml

TRS/GTSSK07/cade06.xml

TRS/GTSSK07/cade10.xml

TRS/GTSSK07/cade04t.xml

TRS/GTSSK07/cade12t.xml

TRS/GTSSK07/cade11.xml

TRS/GTSSK07/cade14.xml

TRS/AG01_innermost/#4.37.xml

TRS/AG01_innermost/#4.23.xml

TRS/AG01_innermost/#4.32.xml

TRS/AG01_innermost/#4.27.xml

TRS/AG01_innermost/#4.7.xml

TRS/AG01_innermost/#4.2.xml

TRS/AG01_innermost/#4.31.xml

TRS/AG01_innermost/#4.30a.xml

TRS/AG01_innermost/#4.26.xml

TRS/AG01_innermost/#4.37a.xml

TRS/AG01_innermost/#4.25.xml

TRS/AG01_innermost/#4.22.xml

TRS/AG01_innermost/#4.30b.xml

TRS/AG01_innermost/#4.14.xml

TRS/AG01_innermost/#4.20a.xml

TRS/AG01_innermost/#4.19.xml

TRS/AG01_innermost/#4.30.xml

TRS/AG01_innermost/#4.36.xml

TRS/AG01_innermost/#4.24.xml

TRS/AG01_innermost/#4.17.xml

TRS/AG01_innermost/#4.35.xml

TRS/AG01_innermost/#4.34.xml

TRS/AG01_innermost/#4.29.xml

TRS/AG01_innermost/#4.28.xml

TRS/AG01_innermost/#4.33.xml

TRS/AG01_innermost/#4.16.xml

TRS/HirokawaMiddeldorp_04/t001.xml

TRS/HirokawaMiddeldorp_04/t011.xml

TRS/HirokawaMiddeldorp_04/t004.xml

TRS/HirokawaMiddeldorp_04/t009.xml

TRS/HirokawaMiddeldorp_04/n007.xml

TRS/HirokawaMiddeldorp_04/t002.xml

TRS/HirokawaMiddeldorp_04/t014.xml

TRS/HirokawaMiddeldorp_04/n004.xml

TRS/HirokawaMiddeldorp_04/n006.xml

TRS/HirokawaMiddeldorp_04/n005.xml

TRS/HirokawaMiddeldorp_04/t012.xml

TRS/HirokawaMiddeldorp_04/n002.xml

TRS/HirokawaMiddeldorp_04/t013.xml

TRS/HirokawaMiddeldorp_04/t003.xml

TRS/HirokawaMiddeldorp_04/n003.xml

TRS/Waldmann_06/jwmatchb1.xml

TRS/Waldmann_06/jwmatchb2.xml

TRS/Bouchare_06/12.xml

TRS/Secret_07_TRS/aprove05.xml

TRS/Secret_07_TRS/aprove03.xml

TRS/Secret_07_TRS/aprove07.xml

TRS/Secret_07_TRS/aprove02.xml

TRS/Secret_07_TRS/secret1.xml

TRS/Secret_07_TRS/secret4.xml

TRS/Secret_07_TRS/aprove04.xml

TRS/Secret_07_TRS/aprove06.xml

TRS/Secret_07_TRS/aprove09.xml

TRS/Secret_07_TRS/3.xml

TRS/Secret_07_TRS/aprove01.xml

TRS/Secret_07_TRS/aprove08.xml

TRS/Secret_07_TRS/secret3.xml

TRS/Secret_07_TRS/aprove10.xml

TRS/Secret_07_TRS/secret5.xml

TRS/MNZ_10/labelled.xml

TRS/MNZ_10/nrvsq.xml

TRS/CiME_04/filliatre3.xml

TRS/CiME_04/big.xml

TRS/CiME_04/list-sum-prod-assoc.xml

TRS/CiME_04/append.xml

TRS/CiME_04/list-sum-prod-bin-assoc.xml

TRS/CiME_04/filliatre.xml

TRS/CiME_04/tree.xml

TRS/CiME_04/dpqs.xml

TRS/CiME_04/append-hard.xml

TRS/CiME_04/mucrl1.xml

TRS/CiME_04/maude2.xml

TRS/CiME_04/append-wrong.xml

TRS/CiME_04/fact-hard.xml

TRS/CiME_04/ternary-hard.xml

TRS/CiME_04/list-sum-prod-assoc-append.xml

TRS/CiME_04/lse.xml

TRS/CiME_04/ack_prolog.xml

TRS/CiME_04/list-sum-prod.xml

TRS/CiME_04/log2.xml

TRS/CiME_04/list-sum-prod-bin-assoc-distr-app.xml

TRS/CiME_04/intersect.xml

TRS/CiME_04/ternary.xml

TRS/CiME_04/list-sum-prod-bin.xml

TRS/CiME_04/filliatre2.xml

TRS/Zantema_06/10.xml

TRS/Zantema_06/04.xml

TRS/Zantema_06/08.xml

TRS/Zantema_06/beans6.xml

TRS/Zantema_06/beans2.xml

TRS/Zantema_06/loop1.xml

TRS/Zantema_06/03.xml

TRS/Zantema_06/09.xml

TRS/Zantema_06/15.xml

TRS/Zantema_06/beans1.xml

TRS/Zantema_06/02.xml

TRS/Zantema_06/07.xml

TRS/Zantema_06/beans3.xml

TRS/Zantema_06/while2.xml

TRS/Zantema_06/while1.xml

TRS/Zantema_06/06.xml

TRS/Zantema_06/01.xml

TRS/Zantema_06/05.xml

TRS/Secret_05_SRS/aprove1.xml

TRS/Secret_05_SRS/aprove3.xml

TRS/Secret_05_SRS/jambox1.xml

TRS/Secret_05_SRS/torpa3.xml

TRS/Secret_05_SRS/matchbox2.xml

TRS/Secret_05_SRS/jambox3.xml

TRS/Secret_05_SRS/torpa1.xml

TRS/Secret_05_SRS/jambox5.xml

TRS/Secret_05_SRS/aprove5.xml

TRS/Secret_05_SRS/torpa4.xml

TRS/Secret_05_SRS/aprove2.xml

TRS/Mixed_SRS/turing_copy.xml

TRS/Mixed_SRS/01-oppelt08.xml

TRS/Mixed_SRS/08-oppelt08.xml

TRS/Mixed_SRS/07-oppelt08.xml

TRS/Mixed_SRS/06-oppelt08.xml

TRS/Mixed_SRS/turing_add.xml

TRS/Mixed_SRS/1.xml

TRS/Mixed_SRS/turing_mult.xml

TRS/Mixed_SRS/07.xml

TRS/Mixed_outermost/ex2.xml

TRS/Mixed_outermost/ex5.xml

TRS/Mixed_outermost/patterns1.xml

TRS/Mixed_outermost/ex1.xml

TRS/Mixed_outermost/non-lin2.xml

TRS/Mixed_outermost/ex6.xml

TRS/Mixed_outermost/afbg.xml

TRS/Mixed_outermost/ex3.xml

TRS/Mixed_outermost/patterns2.xml

TRS/Mixed_outermost/odd.xml

TRS/Mixed_outermost/non-lin3.xml

TRS/Mixed_outermost/non-lin1.xml

TRS/Mixed_outermost/even.xml

TRS/Mixed_outermost/ex4.xml

TRS/Mixed_outermost/gfb.xml

TRS/Secret_06_TRS/reverse.xml

TRS/Secret_06_TRS/10.xml

TRS/Secret_06_TRS/times.xml

TRS/Secret_06_TRS/tpa06.xml

TRS/Secret_06_TRS/gen-28.xml

TRS/Secret_06_TRS/gen-17.xml

TRS/Secret_06_TRS/division.xml

TRS/Secret_06_TRS/double.xml

TRS/Secret_06_TRS/addList.xml

TRS/Secret_06_TRS/tpa10.xml

TRS/Secret_06_TRS/tpa05.xml

TRS/Secret_06_TRS/divExp.xml

TRS/Secret_06_TRS/gen-1.xml

TRS/Secret_06_TRS/tpa07.xml

TRS/Secret_06_TRS/sumList.xml

TRS/Secret_06_TRS/tpa08.xml

TRS/Secret_06_TRS/nrOfNodes.xml

TRS/Secret_06_TRS/tpa09.xml

TRS/Secret_06_TRS/6.xml

TRS/Secret_06_TRS/tpa04.xml

TRS/Secret_06_TRS/4.xml

TRS/Secret_06_TRS/toList.xml

TRS/Secret_06_TRS/logarithm.xml

TRS/AProVE_10/downfrom.xml

TRS/AProVE_10/scnp.xml

TRS/AProVE_10/ex2.xml

TRS/AProVE_10/ex5.xml

TRS/AProVE_10/ex1.xml

TRS/AProVE_10/isList.xml

TRS/AProVE_10/double.xml

TRS/AProVE_10/Zantema06-03-modified.xml

TRS/AProVE_10/ex3.xml

TRS/AProVE_10/halfdouble.xml

TRS/AProVE_10/isNat.xml

TRS/AProVE_10/andIsNat.xml

TRS/AProVE_10/ex4.xml

TRS/AProVE_10/challenge_fab.xml

TRS/Endrullis_06/direct.xml

TRS/Secret_07_SRS/num-527.xml

TRS/Secret_07_SRS/num-514.xml

TRS/Secret_07_SRS/num-530.xml

TRS/Secret_07_SRS/num-539.xml

TRS/Secret_07_SRS/x10.xml

TRS/Secret_07_SRS/x02.xml

TRS/Secret_07_SRS/x01.xml

TRS/Secret_07_SRS/num-521.xml

TRS/Secret_07_SRS/num-525.xml

TRS/Secret_07_SRS/num-515.xml

TRS/Secret_07_SRS/num-518.xml

TRS/Secret_07_SRS/num-520.xml

TRS/Secret_07_SRS/x03.xml

TRS/Secret_07_SRS/num-519.xml

TRS/Secret_07_SRS/x05.xml

TRS/TCT_09/ma3.xml

TRS/TCT_09/shuffle.xml

TRS/TCT_09/addmult.xml

TRS/TCT_09/revappend.xml

TRS/TCT_09/append.xml

TRS/TCT_09/dexpdp2.xml

TRS/TCT_09/nonmultrec.xml

TRS/TCT_09/ma6.xml

TRS/TCT_09/ackantiinn2.xml

TRS/TCT_09/ma7.xml

TRS/TCT_09/ma9.xml

TRS/TCT_09/supexpdg.xml

TRS/TCT_09/add.xml

TRS/TCT_09/ma1.xml

TRS/TCT_09/insertsort.xml

TRS/TCT_09/supexpur.xml

TRS/TCT_09/ackantiinn.xml

TRS/TCT_09/dexpdp.xml

TRS/TCT_09/ma8.xml

TRS/TCT_09/mergesort.xml

TRS/TCT_09/ma4.xml

TRS/TCT_09/qbf.xml

TRS/TCT_09/expantiinn.xml

TRS/TCT_09/lcs.xml

TRS/AProVE_07/thiemann11.xml

TRS/AProVE_07/wiehe03.xml

TRS/AProVE_07/thiemann22.xml

TRS/AProVE_07/thiemann12.xml

TRS/AProVE_07/thiemann33.xml

TRS/AProVE_07/otto06.xml

TRS/AProVE_07/thiemann04.xml

TRS/AProVE_07/wiehe06.xml

TRS/AProVE_07/thiemann16.xml

TRS/AProVE_07/thiemann17.xml

TRS/AProVE_07/otto01.xml

TRS/AProVE_07/otto04.xml

TRS/AProVE_07/thiemann25.xml

TRS/AProVE_07/thiemann26.xml

TRS/AProVE_07/thiemann38.xml

TRS/AProVE_07/wiehe07.xml

TRS/AProVE_07/thiemann24.xml

TRS/AProVE_07/thiemann07.xml

TRS/AProVE_07/thiemann32.xml

TRS/AProVE_07/kabasci01.xml

TRS/AProVE_07/otto13.xml

TRS/AProVE_07/thiemann20.xml

TRS/AProVE_07/thiemann27.xml

TRS/AProVE_07/kabasci04.xml

TRS/AProVE_07/thiemann15.xml

TRS/AProVE_07/otto07.xml

TRS/AProVE_07/kabasci05.xml

TRS/AProVE_07/otto12.xml

TRS/AProVE_07/thiemann01.xml

TRS/AProVE_07/thiemann03.xml

TRS/AProVE_07/wiehe09.xml

TRS/AProVE_07/thiemann10.xml

TRS/AProVE_07/thiemann34.xml

TRS/AProVE_07/wiehe11.xml

TRS/AProVE_07/otto09.xml

TRS/AProVE_07/thiemann08.xml

TRS/AProVE_07/wiehe01.xml

TRS/AProVE_07/thiemann29.xml

TRS/AProVE_07/wiehe02.xml

TRS/AProVE_07/thiemann02.xml

TRS/AProVE_07/thiemann05.xml

TRS/AProVE_07/otto10.xml

TRS/AProVE_07/otto02.xml

TRS/AProVE_07/thiemann09.xml

TRS/AProVE_07/thiemann06.xml

TRS/AProVE_07/otto11.xml

TRS/AProVE_07/thiemann19.xml

TRS/AProVE_07/thiemann23.xml

TRS/AProVE_07/wiehe12.xml

TRS/AProVE_07/thiemann37.xml

TRS/AProVE_07/otto08.xml

TRS/AProVE_07/otto03.xml

TRS/AProVE_07/thiemann40.xml

TRS/AProVE_07/thiemann41.xml

TRS/AProVE_07/thiemann31.xml

TRS/AProVE_07/wiehe08.xml

TRS/AProVE_07/thiemann13.xml

TRS/AProVE_07/thiemann36.xml

TRS/AProVE_07/thiemann21.xml

TRS/AProVE_07/kabasci02.xml

TRS/AProVE_07/thiemann28.xml

TRS/AProVE_07/thiemann18.xml

TRS/AProVE_07/wiehe05.xml

TRS/AProVE_07/thiemann14.xml

TRS/AProVE_07/thiemann30.xml

TRS/AProVE_07/otto05.xml

TRS/AProVE_07/kabasci03.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-30.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-66.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-410.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-243.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-356.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-248.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-88.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-497.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-237.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-72.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-409.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-361.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-32.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-480.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-559.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-86.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-129.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-113.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-368.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-249.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-522.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-543.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-104.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-477.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-18.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-126.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-222.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-122.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-485.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-549.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-267.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-263.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-105.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-272.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-346.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-340.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-373.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-328.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-367.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-299.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-297.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-294.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-330.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-123.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-369.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-13.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-48.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-550.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-492.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-296.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-309.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-232.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-564.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-536.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-11.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-339.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-403.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-541.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-448.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-355.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-107.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-434.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-378.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-430.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-548.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-337.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-360.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-465.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-366.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-274.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-298.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-271.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-441.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-502.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-83.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-275.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-289.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-482.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-67.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-199.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-112.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-110.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-473.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-57.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-217.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-545.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-91.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-431.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-362.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-429.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-341.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-408.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-17.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-386.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-301.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-436.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-9.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-491.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-85.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-92.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-532.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-35.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-395.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-566.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-247.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-547.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-446.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-406.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-556.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-487.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-211.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-224.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-303.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-438.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-383.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-198.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-489.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-170.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-535.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-304.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-179.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-511.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-109.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-98.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-396.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-439.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-8.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-59.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-236.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-13.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-345.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-354.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-443.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-227.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-16.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-353.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-506.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-450.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-6.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-40.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-133.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-111.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-546.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-476.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-451.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-291.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-335.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-233.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-14.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-401.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-15.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-300.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-384.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-565.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-472.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-327.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-374.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-128.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-121.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-508.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-363.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-437.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-174.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-127.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-377.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-435.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-71.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-108.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-385.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-231.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-400.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-10.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-158.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-456.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-391.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-125.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-64.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-4.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-106.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-338.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-551.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-260.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-359.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-347.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-293.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-348.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-17.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-238.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-552.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-22.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-402.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-560.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-561.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-540.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-382.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-558.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-131.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-563.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-286.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-553.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-7.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-376.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-124.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-41.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-375.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-292.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-21.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-132.xml

TRS/Waldmann_07_size12/size-12-alpha-2-num-2.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-120.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-469.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-65.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-47.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-488.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-49.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-114.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-270.xml

TRS/Waldmann_07_size12/size-12-alpha-3-num-84.xml

TRS/SK90/4.60.xml

TRS/SK90/4.38.xml

TRS/SK90/2.16.xml

TRS/SK90/2.44.xml

TRS/SK90/4.29.xml

TRS/SK90/2.11.xml

TRS/SK90/4.10.xml

TRS/SK90/2.17.xml

TRS/SK90/4.48.xml

TRS/SK90/2.61.xml

TRS/SK90/4.53.xml

TRS/SK90/2.27.xml

TRS/SK90/4.57.xml

TRS/SK90/2.40.xml

TRS/SK90/2.09.xml

TRS/SK90/4.05.xml

TRS/SK90/4.06.xml

TRS/SK90/2.53.xml

TRS/SK90/4.16.xml

TRS/SK90/2.21.xml

TRS/SK90/4.25.xml

TRS/SK90/2.47.xml

TRS/SK90/4.42.xml

TRS/SK90/2.41.xml

TRS/SK90/2.02.xml

TRS/SK90/4.47.xml

TRS/SK90/2.45.xml

TRS/SK90/2.03.xml

TRS/SK90/4.17.xml

TRS/SK90/2.51.xml

TRS/SK90/2.12.xml

TRS/SK90/4.45.xml

TRS/SK90/4.31.xml

TRS/SK90/4.43.xml

TRS/SK90/2.15.xml

TRS/SK90/2.25.xml

TRS/SK90/2.24.xml

TRS/SK90/4.26.xml

TRS/SK90/4.59.xml

TRS/SK90/2.38.xml

TRS/SK90/2.18.xml

TRS/SK90/2.14.xml

TRS/SK90/4.18.xml

TRS/SK90/4.28.xml

TRS/SK90/2.50.xml

TRS/SK90/4.34.xml

TRS/SK90/4.13.xml

TRS/SK90/2.22.xml

TRS/SK90/2.36.xml

TRS/SK90/2.37.xml

TRS/SK90/4.07.xml

TRS/SK90/2.59.xml

TRS/SK90/2.20.xml

TRS/SK90/4.12.xml

TRS/SK90/2.28.xml

TRS/SK90/4.54.xml

TRS/SK90/2.31.xml

TRS/SK90/2.48.xml

TRS/SK90/2.13.xml

TRS/SK90/2.54.xml

TRS/SK90/2.55.xml

TRS/SK90/4.22.xml

TRS/SK90/4.61.xml

TRS/SK90/2.42.xml

TRS/SK90/2.26.xml

TRS/SK90/2.19.xml

TRS/SK90/4.51.xml

TRS/SK90/2.23.xml

TRS/SK90/2.07.xml

TRS/SK90/4.35.xml

TRS/SK90/4.24.xml

TRS/SK90/2.39.xml

TRS/SK90/2.49.xml

TRS/SK90/2.43.xml

TRS/SK90/4.09.xml

TRS/SK90/4.30.xml

TRS/SK90/2.30.xml

TRS/SK90/2.29.xml

TRS/SK90/2.52.xml

TRS/AProVE_04/AAECC-ring.xml

TRS/AProVE_04/IJCAR_26.xml

TRS/AProVE_04/Liveness6.3.xml

TRS/AProVE_04/Liveness6.2.xml

TRS/AProVE_04/fac.xml

TRS/AProVE_04/AAECC.xml

TRS/AProVE_04/IJCAR_12.xml

TRS/AProVE_04/rta2.xml

TRS/AProVE_04/LPAR_intlist.xml

TRS/AProVE_04/IJCAR_18.xml

TRS/AProVE_04/Liveness6.4.xml

TRS/AProVE_04/Liveness_WRS.xml

TRS/AProVE_04/IJCAR_26a.xml

TRS/AProVE_04/rta3.xml

TRS/AProVE_04/JFP_Ex31.xml

TRS/AProVE_04/rta1.xml

TRS/AProVE_04/JFP_Ex51.xml

TRS/AProVE_04/IJCAR_1.xml

TRS/AProVE_04/Liveness6.1.xml

TRS/AProVE_04/Liveness8.xml

TRS/Zantema_05/z10.xml

TRS/Zantema_05/z16.xml

TRS/Zantema_05/z12.xml

TRS/Zantema_05/z14.xml

TRS/Zantema_05/z27.xml

TRS/Zantema_05/z28.xml

TRS/Zantema_05/z18.xml

TRS/Zantema_05/z26.xml

TRS/Zantema_05/z17.xml

TRS/Zantema_05/z23.xml

TRS/Zantema_05/z15.xml

TRS/Zantema_05/z24.xml

TRS/Zantema_05/z13.xml

TRS/Beerendonk_07/10.xml

TRS/Beerendonk_07/17.xml

TRS/Beerendonk_07/8.xml

TRS/Beerendonk_07/16.xml

TRS/Beerendonk_07/24.xml

TRS/Beerendonk_07/5.xml

TRS/Beerendonk_07/11.xml

TRS/Beerendonk_07/19.xml

TRS/Beerendonk_07/12.xml

TRS/Beerendonk_07/14.xml

TRS/Beerendonk_07/7.xml

TRS/Beerendonk_07/13.xml

TRS/Beerendonk_07/23.xml

TRS/Beerendonk_07/15.xml

TRS/Beerendonk_07/18.xml

TRS/Beerendonk_07/1.xml

TRS/Beerendonk_07/20.xml

TRS/Beerendonk_07/3.xml

TRS/Beerendonk_07/21.xml

TRS/Beerendonk_07/6.xml

TRS/Beerendonk_07/2.xml

TRS/Beerendonk_07/4.xml

TRS/Beerendonk_07/9.xml

TRS/Beerendonk_07/22.xml

TRS/Transformed_outermost_08/ex5.8.xml

TRS/Transformed_outermost_08/cariboo_ex2.xml

TRS/Transformed_outermost_08/morse.xml

TRS/Transformed_outermost_08/f30.xml

TRS/Transformed_outermost_08/ex5.7.xml

TRS/Transformed_outermost_08/ex5.5.xml

TRS/Transformed_outermost_08/cariboo_ex3.xml

TRS/Transformed_outermost_08/f20.xml

TRS/Transformed_outermost_08/f40.xml

TRS/Transformed_outermost_08/f4.xml

TRS/Transformed_outermost_08/ex5.6.xml

TRS/Transformed_outermost_08/ex5.3.xml

TRS/Transformed_outermost_08/ex5.4.xml

TRS/Transformed_outermost_08/cariboo_ex1.xml

TRS/Zantema_04/z090.xml

TRS/Zantema_04/z124.xml

TRS/Zantema_04/z014.xml

TRS/Zantema_04/z092.xml

TRS/Zantema_04/z020.xml

TRS/Zantema_04/z081.xml

TRS/Zantema_04/z120.xml

TRS/Zantema_04/z047.xml

TRS/Zantema_04/z114.xml

TRS/Zantema_04/z018.xml

TRS/Zantema_04/z046.xml

TRS/Zantema_04/z013.xml

TRS/Zantema_04/syracuse.xml

TRS/Zantema_04/z091.xml

TRS/Zantema_04/z083.xml

TRS/Zantema_04/z082.xml

TRS/Zantema_04/z111.xml

TRS/Zantema_04/z003.xml

TRS/Zantema_04/z107.xml

TRS/Zantema_04/z045.xml

TRS/Zantema_04/z002.xml

TRS/Zantema_04/z042.xml

TRS/Zantema_04/z077.xml

TRS/Zantema_04/z117.xml

TRS/Zantema_04/z004.xml

TRS/Zantema_04/z026.xml

TRS/Zantema_04/z123.xml

TRS/Zantema_04/z043.xml

TRS/Zantema_04/z009.xml

TRS/Zantema_04/z044.xml

TRS/Zantema_04/z010.xml

TRS/Zantema_04/z005.xml

TRS/Zantema_04/z072.xml

TRS/Zantema_04/z017.xml

TRS/Zantema_04/z106.xml

TRS/Zantema_04/z075.xml

TRS/Zantema_04/z065.xml

TRS/Zantema_04/z079.xml

TRS/Zantema_04/z008.xml

TRS/Zantema_04/z100.xml

TRS/Zantema_04/z094.xml

TRS/Zantema_04/z125.xml

TRS/Zantema_04/z074.xml

TRS/Zantema_04/z078.xml

TRS/Zantema_04/z118.xml

TRS/Zantema_04/z103.xml

TRS/Zantema_04/z105.xml

TRS/Zantema_04/z076.xml

TRS/Zantema_04/z073.xml

TRS/Secret_06_SRS/10.xml

TRS/Secret_06_SRS/aprove05.xml

TRS/Secret_06_SRS/aprove03.xml

TRS/Secret_06_SRS/aprove07.xml

TRS/Secret_06_SRS/aprove02.xml

TRS/Secret_06_SRS/secr5.xml

TRS/Secret_06_SRS/7.xml

TRS/Secret_06_SRS/5-matchbox.xml

TRS/Secret_06_SRS/aprove04.xml

TRS/Secret_06_SRS/aprove06.xml

TRS/Secret_06_SRS/aprove09.xml

TRS/Secret_06_SRS/1-matchbox.xml

TRS/Secret_06_SRS/secr4.xml

TRS/Secret_06_SRS/aprove01.xml

TRS/Secret_06_SRS/aprove08.xml

TRS/Secret_06_SRS/secr8.xml

TRS/Secret_06_SRS/9.xml

TRS/Secret_06_SRS/aprove00.xml

TRS/Secret_06_SRS/secr3.xml

TRS/Waldmann_06_SRS/jw3.xml

TRS/Waldmann_06_SRS/pi.xml

TRS/Waldmann_06_SRS/e.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_FR.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_complete-noand_L.xml

TRS/Strategy_outermost_added_08/#4.3.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02_Z.xml

TRS/Strategy_outermost_added_08/PALINDROME_nokinds_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex8_BLR02_L.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_noand_GM.xml

TRS/Strategy_outermost_added_08/ExAppendixB_AEL03.xml

TRS/Strategy_outermost_added_08/test75.xml

TRS/Strategy_outermost_added_08/Ex4_7_37_Bor03_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_GM.xml

TRS/Strategy_outermost_added_08/Ex6_9_Luc02c_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_complete_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_Z.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_FR.xml

TRS/Strategy_outermost_added_08/OvConsOS_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex3_2_Luc97_L.xml

TRS/Strategy_outermost_added_08/MYNAT_complete_L.xml

TRS/Strategy_outermost_added_08/PEANO_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/#4.4.xml

TRS/Strategy_outermost_added_08/PALINDROME_nosorts_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex4_Zan97.xml

TRS/Strategy_outermost_added_08/Ex7_BLR02.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_FR.xml

TRS/Strategy_outermost_added_08/Ex3_3_25_Bor03_Z.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_Z.xml

TRS/Strategy_outermost_added_08/Ex1_2_Luc02c.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_iGM.xml

TRS/Strategy_outermost_added_08/PALINDROME_complete_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_FR.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_FR.xml

TRS/Strategy_outermost_added_08/Ex4_7_15_Bor03.xml

TRS/Strategy_outermost_added_08/#4.7.xml

TRS/Strategy_outermost_added_08/Ex9_BLR02.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex1_GM03_Z.xml

TRS/Strategy_outermost_added_08/MYNAT_complete-noand_L.xml

TRS/Strategy_outermost_added_08/ExConc_Zan97.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nokinds_L.xml

TRS/Strategy_outermost_added_08/#4.2.xml

TRS/Strategy_outermost_added_08/Ex4_7_77_Bor03_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_Z.xml

TRS/Strategy_outermost_added_08/test10.xml

TRS/Strategy_outermost_added_08/#4.13.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97_FR.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a.xml

TRS/Strategy_outermost_added_08/PEANO_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02_L.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97_L.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_Z.xml

TRS/Strategy_outermost_added_08/muladd.xml

TRS/Strategy_outermost_added_08/jwno1.xml

TRS/Strategy_outermost_added_08/Ex5_Zan97_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_Z.xml

TRS/Strategy_outermost_added_08/Ex5_Zan97.xml

TRS/Strategy_outermost_added_08/Ex4_Zan97_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete_L.xml

TRS/Strategy_outermost_added_08/Ex15_Luc98.xml

TRS/Strategy_outermost_added_08/jwno6.xml

TRS/Strategy_outermost_added_08/Ex1_Luc04b_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_GM.xml

TRS/Strategy_outermost_added_08/Ex1_2_AEL03_L.xml

TRS/Strategy_outermost_added_08/PEANO_complete_L.xml

TRS/Strategy_outermost_added_08/Ex4_7_77_Bor03.xml

TRS/Strategy_outermost_added_08/Ex5_7_Luc97.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b_Z.xml

TRS/Strategy_outermost_added_08/Ex3_12_Luc96a_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01.xml

TRS/Strategy_outermost_added_08/PEANO_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_L.xml

TRS/Strategy_outermost_added_08/test9.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_GM.xml

TRS/Strategy_outermost_added_08/Ex6_Luc98.xml

TRS/Strategy_outermost_added_08/MYNAT_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/MYNAT_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex4_7_56_Bor03_L.xml

TRS/Strategy_outermost_added_08/MYNAT_nosorts_L.xml

TRS/Strategy_outermost_added_08/Ex14_Luc06_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_GM.xml

TRS/Strategy_outermost_added_08/Ex26_Luc03b.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_L.xml

TRS/Strategy_outermost_added_08/#4.14.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b_FR.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts_FR.xml

TRS/Strategy_outermost_added_08/jwno4.xml

TRS/Strategy_outermost_added_08/Ex15_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex49_GM04_L.xml

TRS/Strategy_outermost_added_08/Ex1_2_Luc02c_L.xml

TRS/Strategy_outermost_added_08/ExAppendixB_AEL03_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97.xml

TRS/Strategy_outermost_added_08/#4.12a.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02.xml

TRS/Strategy_outermost_added_08/ExConc_Zan97_Z.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_FR.xml

TRS/Strategy_outermost_added_08/OvConsOS_complete_L.xml

TRS/Strategy_outermost_added_08/Ex15_Luc98_L.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_FR.xml

TRS/Strategy_outermost_added_08/Ex6_15_AEL02.xml

TRS/Strategy_outermost_added_08/Ex2_Luc03b.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex5_7_Luc97_L.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a_L.xml

TRS/Strategy_outermost_added_08/Ex3_3_25_Bor03.xml

TRS/Strategy_outermost_added_08/toyama.xml

TRS/Strategy_outermost_added_08/OvConsOS_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_iGM.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex3_2_Luc97.xml

TRS/Strategy_outermost_added_08/Ex1_GM03.xml

TRS/Strategy_outermost_added_08/Ex6_GM04.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/n001.xml

TRS/Strategy_outermost_added_08/Ex4_7_56_Bor03.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_L.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_FR.xml

TRS/Strategy_outermost_added_08/Ex24_GM04_GM.xml

TRS/Strategy_outermost_added_08/gkg.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM04_Z.xml

TRS/Strategy_outermost_added_08/#4.17.xml

TRS/Strategy_outermost_added_08/Ex1_GM99_L.xml

TRS/Strategy_outermost_added_08/Ex1_Zan97.xml

TRS/Strategy_outermost_added_08/Ex4_4_Luc96b.xml

TRS/Strategy_outermost_added_08/Ex6_9_Luc02c.xml

TRS/Strategy_outermost_added_08/Ex14_AEGL02_Z.xml

TRS/Strategy_outermost_added_08/PEANO_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM01_Z.xml

TRS/Strategy_outermost_added_08/jwno9.xml

TRS/Strategy_outermost_added_08/Ex16_Luc06_L.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97_L.xml

TRS/Strategy_outermost_added_08/PEANO_nokinds_L.xml

TRS/Strategy_outermost_added_08/Ex8_BLR02.xml

TRS/Strategy_outermost_added_08/test77.xml

TRS/Strategy_outermost_added_08/Ex1_Luc02b.xml

TRS/Strategy_outermost_added_08/Ex5_DLMMU04_Z.xml

TRS/Strategy_outermost_added_08/Ex6_GM04_FR.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_GM.xml

TRS/Strategy_outermost_added_08/MYNAT_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nosorts-noand_L.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_iGM.xml

TRS/Strategy_outermost_added_08/ExSec4_2_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/Ex7_BLR02_L.xml

TRS/Strategy_outermost_added_08/Ex24_GM04_L.xml

TRS/Strategy_outermost_added_08/Ex3_12_Luc96a.xml

TRS/Strategy_outermost_added_08/#4.15.xml

TRS/Strategy_outermost_added_08/Ex1_GM03_L.xml

TRS/Strategy_outermost_added_08/Ex1_2_AEL03.xml

TRS/Strategy_outermost_added_08/Ex9_Luc04_FR.xml

TRS/Strategy_outermost_added_08/Ex24_GM04.xml

TRS/Strategy_outermost_added_08/ExSec11_1_Luc02a.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_GM.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_complete-noand_L.xml

TRS/Strategy_outermost_added_08/Ex1_GL02a_Z.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nosorts-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex1_Luc02b_L.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts_noand_GM.xml

TRS/Strategy_outermost_added_08/Ex4_DLMMU04_L.xml

TRS/Strategy_outermost_added_08/LISTUTILITIES_nokinds-noand_L.xml

TRS/Strategy_outermost_added_08/LengthOfFiniteLists_nokinds_FR.xml

TRS/Strategy_outermost_added_08/#4.18.xml

TRS/Strategy_outermost_added_08/OvConsOS_nosorts-noand_FR.xml

TRS/Strategy_outermost_added_08/Ex9_Luc06_FR.xml

TRS/Strategy_outermost_added_08/#4.16.xml

TRS/Strategy_outermost_added_08/PALINDROME_complete-noand_L.xml

TRS/Strategy_outermost_added_08/ExIntrod_Zan97_Z.xml

TRS/Strategy_outermost_added_08/Ex1_GM99.xml

TRS/Strategy_outermost_added_08/Ex4_7_37_Bor03.xml

TRS/Strategy_outermost_added_08/Ex24_Luc06_FR.xml

TRS/Strategy_outermost_added_08/ExIntrod_GM99_L.xml

TRS/Strategy_outermost_added_08/test76.xml

TRS/Strategy_outermost_added_08/PALINDROME_nokinds-noand_L.xml

TRS/AProVE_09_Inductive/qsortlast.xml

TRS/AProVE_09_Inductive/minsort.xml

TRS/AProVE_09_Inductive/zerolist.xml

TRS/AProVE_09_Inductive/mod.xml

TRS/AProVE_09_Inductive/div.xml

TRS/AProVE_09_Inductive/gcdhard.xml

TRS/AProVE_09_Inductive/divhard.xml

TRS/AProVE_09_Inductive/qsort.xml

TRS/AProVE_09_Inductive/gcd2.xml

TRS/AProVE_09_Inductive/qsortmiddle.xml

TRS/AProVE_09_Inductive/maxsortcondition.xml

TRS/AProVE_09_Inductive/log.xml

TRS/AProVE_09_Inductive/gcd.xml

TRS/AProVE_09_Inductive/maxsort.xml

TRS/AProVE_08/id_inc.xml

TRS/AProVE_08/parting03_minsort.xml

TRS/AProVE_08/parting05_maxsort.xml

TRS/AProVE_08/round_nonterm.xml

TRS/AProVE_08/log.xml

TRS/AProVE_08/parting04_maxsort_h.xml

TRS/AProVE_08/parting01_reverse.xml

TRS/AProVE_08/thiemann40_modified.xml

TRS/AProVE_08/round.xml

TRS/AProVE_08/parting02_doublelist.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-5.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-6.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-1.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-14.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-1.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-7.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-10.xml

TRS/Waldmann_07_size11/size-11-alpha-2-num-2.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-4.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-15.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-16.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-2.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-11.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-8.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-9.xml

TRS/Waldmann_07_size11/size-11-alpha-3-num-12.xml

TRS/Various_04/10.xml

TRS/Various_04/04.xml

TRS/Various_04/08.xml

TRS/Various_04/24.xml

TRS/Various_04/11.xml

TRS/Various_04/12.xml

TRS/Various_04/14.xml

TRS/Various_04/13.xml

TRS/Various_04/23.xml

TRS/Various_04/15.xml

TRS/Various_04/18.xml

TRS/Various_04/22.xml

TRS/Mixed_innermost/wiehe13.xml

TRS/Mixed_innermost/test10.xml

TRS/Mixed_innermost/muladd.xml

TRS/Mixed_innermost/cade12.xml

TRS/Mixed_innermost/cade13.xml

TRS/Mixed_innermost/tricky1.xml

TRS/Mixed_innermost/test830.xml

TRS/Mixed_innermost/innermost4.xml

TRS/Mixed_innermost/cade04.xml

TRS/Mixed_innermost/test77.xml

TRS/Mixed_innermost/innermost5.xml

TRS/Mixed_innermost/cade05.xml

TRS/Mixed_innermost/wiehe14.xml

TRS/Mixed_innermost/test76.xml

TRS/AProVE_06/div_notCeTermin.xml

TRS/AProVE_06/sizeChange.xml

TRS/AProVE_06/identity.xml

TRS/AProVE_06/nonterm.xml

TRS/AProVE_06/quot.xml

TRS/AProVE_06/tower.xml

TRS/AProVE_06/tower_sizeChange.xml

TRS/AProVE_06/quicksort.xml

TRS/AProVE_06/factorial1.xml

TRS/AProVE_06/modulo.xml

TRS/AProVE_06/factorial2.xml

TRS/AProVE_06/div_notTermin.xml

TRS/AProVE_06/logarithm.xml

TRS/CSR_04/Ex14_Luc06.xml

TRS/CSR_04/ExIntrod_GM04.xml

TRS/CSR_04/ExAppendixB_AEL03.xml

TRS/CSR_04/ExSec4_2_DLMMU04.xml

TRS/CSR_04/Ex49_GM04.xml

TRS/CSR_04/Ex4_Zan97.xml

TRS/CSR_04/Ex7_BLR02.xml

TRS/CSR_04/Ex25_Luc06.xml

TRS/CSR_04/Ex1_2_Luc02c.xml

TRS/CSR_04/Ex4_7_15_Bor03.xml

TRS/CSR_04/Ex24_Luc06.xml

TRS/CSR_04/Ex9_BLR02.xml

TRS/CSR_04/ExConc_Zan97.xml

TRS/CSR_04/ExProp7_Luc06.xml

TRS/CSR_04/Ex1_GL02a.xml

TRS/CSR_04/Ex5_Zan97.xml

TRS/CSR_04/Ex15_Luc98.xml

TRS/CSR_04/Ex9_Luc06.xml

TRS/CSR_04/Ex4_7_77_Bor03.xml

TRS/CSR_04/Ex5_7_Luc97.xml

TRS/CSR_04/ExIntrod_GM01.xml

TRS/CSR_04/Ex5_DLMMU04.xml

TRS/CSR_04/Ex6_Luc98.xml

TRS/CSR_04/Ex16_Luc06.xml

TRS/CSR_04/Ex15_Luc06.xml

TRS/CSR_04/Ex26_Luc03b.xml

TRS/CSR_04/Ex4_DLMMU04.xml

TRS/CSR_04/ExIntrod_GM99.xml

TRS/CSR_04/ExIntrod_Zan97.xml

TRS/CSR_04/Ex14_AEGL02.xml

TRS/CSR_04/Ex23_Luc06.xml

TRS/CSR_04/Ex6_15_AEL02.xml

TRS/CSR_04/Ex2_Luc03b.xml

TRS/CSR_04/Ex2_Luc02a.xml

TRS/CSR_04/Ex3_3_25_Bor03.xml

TRS/CSR_04/Ex3_2_Luc97.xml

TRS/CSR_04/Ex1_GM03.xml

TRS/CSR_04/Ex6_GM04.xml

TRS/CSR_04/Ex4_7_56_Bor03.xml

TRS/CSR_04/Ex1_Zan97.xml

TRS/CSR_04/Ex4_4_Luc96b.xml

TRS/CSR_04/Ex9_Luc04.xml

TRS/CSR_04/Ex6_9_Luc02c.xml

TRS/CSR_04/ExSec11_1_Luc02a-TRCSR.xml

TRS/CSR_04/Ex8_BLR02.xml

TRS/CSR_04/Ex1_Luc02b.xml

TRS/CSR_04/Ex3_12_Luc96a.xml

TRS/CSR_04/Ex1_2_AEL03.xml

TRS/CSR_04/Ex24_GM04.xml

TRS/CSR_04/ExSec11_1_Luc02a.xml

TRS/CSR_04/Ex1_Luc04b.xml

TRS/CSR_04/Ex1_GM99.xml

TRS/CSR_04/Ex4_7_37_Bor03.xml

TRS/Der95/32.xml

TRS/Der95/08.xml

TRS/Der95/11.xml

TRS/Der95/12.xml

TRS/Der95/27.xml

TRS/Der95/18.xml

TRS/Der95/20.xml

TRS/Der95/33.xml

TRS/Der95/21.xml

TRS/Der95/07.xml

TRS/Der95/31.xml

TRS/Der95/06.xml

TRS/Secret_05_TRS/aprove4.xml

TRS/Secret_05_TRS/aprove3.xml

TRS/Secret_05_TRS/tpa5.xml

TRS/Secret_05_TRS/tpa1.xml

TRS/Secret_05_TRS/tpa4.xml

TRS/Secret_05_TRS/cime3.xml

TRS/Secret_05_TRS/ttt1.xml

TRS/Secret_05_TRS/cime4.xml

TRS/Secret_05_TRS/tpa3.xml

TRS/Secret_05_TRS/tpa2.xml

TRS/Secret_05_TRS/cime2.xml

TRS/Secret_05_TRS/ttt2.xml

TRS/Secret_05_TRS/aprove5.xml

TRS/Secret_05_TRS/cime5.xml

TRS/Secret_05_TRS/aprove2.xml

TRS/Rubio_04/polo2.xml

TRS/Rubio_04/bintrees.xml

TRS/Rubio_04/mfp95.xml

TRS/Rubio_04/wst99.xml

TRS/Rubio_04/division.xml

TRS/Rubio_04/gmnp.xml

TRS/Rubio_04/quick.xml

TRS/Rubio_04/p266.xml

TRS/Rubio_04/ma96.xml

TRS/Rubio_04/elimdupl.xml

TRS/Rubio_04/selsort.xml

TRS/Rubio_04/prov.xml

TRS/Rubio_04/revlist.xml

TRS/Rubio_04/gm.xml

TRS/Rubio_04/nestrec.xml

TRS/Rubio_04/enno.xml

TRS/Rubio_04/quotminus.xml

TRS/Rubio_04/test4.xml

TRS/Rubio_04/gcd.xml

TRS/Rubio_04/logarquot.xml

TRS/Rubio_04/bn122.xml

TRS/Rubio_04/koen.xml

TRS/Rubio_04/test829.xml

TRS/Zantema_08/yoyo_3.xml

TRS/Zantema_08/f_5_1.xml

TRS/Zantema_08/g_2_const.xml

TRS/Zantema_08/ex2.xml

TRS/Zantema_08/ex5.xml

TRS/Zantema_08/bintree.xml

TRS/Zantema_08/cariboo_nl_3.xml

TRS/Zantema_08/assoc_f_rhs.xml

TRS/Zantema_08/ex1.xml

TRS/Zantema_08/morse.xml

TRS/Zantema_08/ex8.xml

TRS/Zantema_08/f_2_2.xml

TRS/Zantema_08/cariboo_add3.xml

TRS/Zantema_08/ex6.xml

TRS/Zantema_08/countter.xml

TRS/Zantema_08/ex7.xml

TRS/Zantema_08/from_three.xml

TRS/Zantema_08/cariboo_add2a.xml

TRS/Zantema_08/ex3.xml

TRS/Zantema_08/toyama_stop.xml

TRS/Zantema_08/yoyo_3b.xml

TRS/Zantema_08/outermost_gr.xml

TRS/Zantema_08/ex0.xml

TRS/Zantema_08/cariboo_add2.xml

TRS/Zantema_08/yoyo_3a.xml

TRS/Zantema_08/cariboo_nl_5.xml

TRS/Zantema_08/dupl_rhs.xml

TRS/Zantema_08/cariboo_len3.xml

TRS/Zantema_08/ffg.xml

TRS/Zantema_08/cariboo_nl_2.xml

TRS/Zantema_08/ffb_SL.xml

TRS/Zantema_08/f_5_2.xml

TRS/Zantema_08/from_one.xml

TRS/Zantema_08/from_one_a.xml

TRS/Zantema_08/cariboo_nl_1.xml

TRS/Zantema_08/yoyo_2.xml

TRS/Zantema_08/f_5.xml

TRS/Zantema_08/f_2_1.xml

TRS/Zantema_08/ex4.xml

TRS/Zantema_08/cariboo_add1.xml

TRS/Zantema_08/cariboo_nl_6.xml

TRS/Zantema_08/g_2_f_var.xml

TRS/Zantema_08/countbin.xml

TRS/Zantema_08/fg.xml

TRS/Zantema_08/cariboo_nl_4.xml

TRS/Zantema_08/ex9.xml

TRS/Zantema_08/inn_out.xml

TRS/Zantema_08/toyama_stop2.xml

TRS/Zantema_08/assoc_c_rhs.xml

TRS/Maude_06/LengthOfFiniteLists_nokinds-noand.xml

TRS/Maude_06/MYNAT_nokinds.xml

TRS/Maude_06/LISTUTILITIES_complete-noand.xml

TRS/Maude_06/LengthOfFiniteLists_nosorts.xml

TRS/Maude_06/MYNAT_nosorts.xml

TRS/Maude_06/PALINDROME_complete-noand.xml

TRS/Maude_06/OvConsOS_nosorts.xml

TRS/Maude_06/MYNAT_complete-noand.xml

TRS/Maude_06/MYNAT_nosorts-noand.xml

TRS/Maude_06/MYNAT_nokinds-peanoSimple.xml

TRS/Maude_06/LengthOfFiniteLists_complete.xml

TRS/Maude_06/LISTUTILITIES_complete.xml

TRS/Maude_06/PALINDROME_nosorts.xml

TRS/Maude_06/LengthOfFiniteLists_nosorts-noand.xml

TRS/Maude_06/MYNAT_nokinds-noand.xml

TRS/Maude_06/MYNAT_nokinds-noand-peanoSimple.xml

TRS/Maude_06/MYNAT_complete.xml

TRS/Maude_06/LISTUTILITIES_nokinds.xml

TRS/Maude_06/MYNAT_complete-peanoSimple.xml

TRS/Maude_06/OvConsOS_nosorts-noand.xml

TRS/Maude_06/OvConsOS_complete.xml

TRS/Maude_06/LengthOfFiniteLists_nokinds.xml

TRS/Maude_06/OvConsOS_nokinds-noand.xml

TRS/Maude_06/LengthOfFiniteLists_complete-noand.xml

TRS/Maude_06/LISTUTILITIES_nosorts.xml

TRS/Maude_06/LISTUTILITIES_nosorts-noand.xml

TRS/Maude_06/MYNAT_complete-noand-peanoSimple.xml

TRS/Maude_06/PALINDROME_nokinds.xml

TRS/Maude_06/csrdiv.xml

TRS/Maude_06/LISTUTILITIES_nokinds-noand.xml

TRS/Maude_06/PALINDROME_complete.xml

TRS/Maude_06/MYNAT_nosorts-peanoSimple.xml

TRS/Maude_06/OvConsOS_nokinds.xml

TRS/Maude_06/PALINDROME_nokinds-noand.xml

TRS/Maude_06/MYNAT_nosorts-noand-peanoSimple.xml

TRS/Maude_06/OvConsOS_complete-noand.xml

TRS/Maude_06/emmes.xml

TRS/Maude_06/PALINDROME_nosorts-noand.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_C.xml

TRS/Transformed_CSR_04/Ex1_Zan97_C.xml

TRS/Transformed_CSR_04/PEANO_complete_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_Z.xml

TRS/Transformed_CSR_04/Ex4_Zan97_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex6_Luc98_L.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_C.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_L.xml

TRS/Transformed_CSR_04/Ex8_BLR02_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_Z.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_L.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_L.xml

TRS/Transformed_CSR_04/Ex49_GM04_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_L.xml

TRS/Transformed_CSR_04/Ex4_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex18_Luc06_Z.xml

TRS/Transformed_CSR_04/PEANO_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc98_Z.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_L.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_L.xml

TRS/Transformed_CSR_04/Ex9_Luc04_C.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_C.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_Z.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts-noand_L.xml

TRS/Transformed_CSR_04/Ex9_BLR02_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_FR.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_L.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_L.xml

TRS/Transformed_CSR_04/Ex1_Zan97_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex25_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex6_Luc98_Z.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_L.xml

TRS/Transformed_CSR_04/Ex4_Zan97_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_Z.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_FR.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_C.xml

TRS/Transformed_CSR_04/Ex7_BLR02_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_Z.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_complete_noand_GM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_Z.xml

TRS/Transformed_CSR_04/PALINDROME_complete_L.xml

TRS/Transformed_CSR_04/MYNAT_complete_noand_C.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_FR.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_GM.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_GM.xml

TRS/Transformed_CSR_04/Ex5_Zan97_Z.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_C.xml

TRS/Transformed_CSR_04/Ex6_Luc98_FR.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_FR.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_Z.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_C.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_L.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM04_C.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_C.xml

TRS/Transformed_CSR_04/Ex49_GM04_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_Z.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_L.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_C.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_L.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_C.xml

TRS/Transformed_CSR_04/PALINDROME_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_GM.xml

TRS/Transformed_CSR_04/MYNAT_complete_GM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_FR.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_GM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_GM.xml

TRS/Transformed_CSR_04/Ex7_BLR02_Z.xml

TRS/Transformed_CSR_04/Ex1_GM99_C.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_L.xml

TRS/Transformed_CSR_04/Ex23_Luc06_Z.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_L.xml

TRS/Transformed_CSR_04/Ex9_BLR02_C.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_GM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_FR.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_Z.xml

TRS/Transformed_CSR_04/Ex1_GL02a_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_FR.xml

TRS/Transformed_CSR_04/Ex5_Zan97_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_GM.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_C.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_FR.xml

TRS/Transformed_CSR_04/Ex23_Luc06_C.xml

TRS/Transformed_CSR_04/Ex4_Zan97_L.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_L.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_L.xml

TRS/Transformed_CSR_04/Ex7_BLR02_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_C.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_GM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/Ex5_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc04b_L.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_C.xml

TRS/Transformed_CSR_04/Ex14_Luc06_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_C.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex18_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_L.xml

TRS/Transformed_CSR_04/PEANO_nosorts_GM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_C.xml

TRS/Transformed_CSR_04/Ex6_Luc98_GM.xml

TRS/Transformed_CSR_04/Ex14_Luc06_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_C.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_GM.xml

TRS/Transformed_CSR_04/ExConc_Zan97_C.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_FR.xml

TRS/Transformed_CSR_04/PEANO_complete_L.xml

TRS/Transformed_CSR_04/Ex25_Luc06_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/Ex25_Luc06_FR.xml

TRS/Transformed_CSR_04/MYNAT_complete_Z.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_Z.xml

TRS/Transformed_CSR_04/ExConc_Zan97_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex15_Luc98_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_GM.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PALINDROME_complete-noand_FR.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_L.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_L.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_L.xml

TRS/Transformed_CSR_04/PEANO_nosorts_C.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_noand_C.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_L.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_C.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_GM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_L.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_FR.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_Z.xml

TRS/Transformed_CSR_04/PEANO_nokinds_C.xml

TRS/Transformed_CSR_04/Ex1_GM99_GM.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_C.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_FR.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_GM.xml

TRS/Transformed_CSR_04/PEANO_complete_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/Ex14_AEGL02_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_noand_C.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_L.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_GM.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_Z.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_L.xml

TRS/Transformed_CSR_04/PALINDROME_complete_C.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_C.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_L.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_C.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_L.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_GM.xml

TRS/Transformed_CSR_04/Ex6_GM04_GM.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_C.xml

TRS/Transformed_CSR_04/Ex1_GM03_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_L.xml

TRS/Transformed_CSR_04/OvConsOS_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex5_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex5_DLMMU04_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_Z.xml

TRS/Transformed_CSR_04/Ex4_Zan97_GM.xml

TRS/Transformed_CSR_04/PEANO_complete_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc06_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM01_L.xml

TRS/Transformed_CSR_04/Ex8_BLR02_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_FR.xml

TRS/Transformed_CSR_04/Ex49_GM04_FR.xml

TRS/Transformed_CSR_04/MYNAT_complete_C.xml

TRS/Transformed_CSR_04/Ex15_Luc06_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex15_Luc98_C.xml

TRS/Transformed_CSR_04/Ex25_Luc06_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_C.xml

TRS/Transformed_CSR_04/Ex49_GM04_L.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex9_BLR02_L.xml

TRS/Transformed_CSR_04/Ex3_3_25_Bor03_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_Z.xml

TRS/Transformed_CSR_04/Ex16_Luc06_C.xml

TRS/Transformed_CSR_04/Ex1_2_Luc02c_L.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_FR.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts_noand_C.xml

TRS/Transformed_CSR_04/Ex15_Luc06_Z.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex24_GM04_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex15_Luc98_GM.xml

TRS/Transformed_CSR_04/Ex4_7_15_Bor03_C.xml

TRS/Transformed_CSR_04/Ex8_BLR02_FR.xml

TRS/Transformed_CSR_04/OvConsOS_complete_L.xml

TRS/Transformed_CSR_04/Ex15_Luc98_L.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_C.xml

TRS/Transformed_CSR_04/Ex8_BLR02_GM.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/Ex2_Luc02a_Z.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_Z.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_FR.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete_Z.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_GM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_FR.xml

TRS/Transformed_CSR_04/PEANO_nokinds_FR.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_FR.xml

TRS/Transformed_CSR_04/Ex23_Luc06_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_FR.xml

TRS/Transformed_CSR_04/Ex7_BLR02_GM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_L.xml

TRS/Transformed_CSR_04/MYNAT_complete_FR.xml

TRS/Transformed_CSR_04/Ex9_Luc06_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_C.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_FR.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_GM.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_C.xml

TRS/Transformed_CSR_04/OvConsOS_nokinds-noand_L.xml

TRS/Transformed_CSR_04/ExConc_Zan97_GM.xml

TRS/Transformed_CSR_04/Ex24_GM04_Z.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_C.xml

TRS/Transformed_CSR_04/OvConsOS_complete_noand_C.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nosorts-noand_L.xml

TRS/Transformed_CSR_04/OvConsOS_complete_FR.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_C.xml

TRS/Transformed_CSR_04/MYNAT_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/PEANO_complete-noand_Z.xml

TRS/Transformed_CSR_04/PALINDROME_nokinds_Z.xml

TRS/Transformed_CSR_04/Ex24_GM04_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_FR.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_GM.xml

TRS/Transformed_CSR_04/OvConsOS_complete_Z.xml

TRS/Transformed_CSR_04/Ex5_7_Luc97_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/PEANO_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex4_7_37_Bor03_C.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_Z.xml

TRS/Transformed_CSR_04/PEANO_nokinds-noand_L.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_L.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_L.xml

TRS/Transformed_CSR_04/Ex26_Luc03b_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/Ex3_2_Luc97_C.xml

TRS/Transformed_CSR_04/ExProp7_Luc06_C.xml

TRS/Transformed_CSR_04/PEANO_nokinds_L.xml

TRS/Transformed_CSR_04/Ex23_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex16_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex4_7_77_Bor03_GM.xml

TRS/Transformed_CSR_04/Ex3_12_Luc96a_GM.xml

TRS/Transformed_CSR_04/ExAppendixB_AEL03_C.xml

TRS/Transformed_CSR_04/Ex9_Luc06_GM.xml

TRS/Transformed_CSR_04/Ex4_4_Luc96b_C.xml

TRS/Transformed_CSR_04/ExSec11_1_Luc02a_Z.xml

TRS/Transformed_CSR_04/Ex9_Luc04_GM.xml

TRS/Transformed_CSR_04/MYNAT_nosorts-noand_L.xml

TRS/Transformed_CSR_04/PALINDROME_complete_GM.xml

TRS/Transformed_CSR_04/Ex6_15_AEL02_C.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts-noand_L.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_L.xml

TRS/Transformed_CSR_04/Ex7_BLR02_L.xml

TRS/Transformed_CSR_04/ExSec4_2_DLMMU04_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_GM.xml

TRS/Transformed_CSR_04/Ex1_2_AEL03_FR.xml

TRS/Transformed_CSR_04/Ex4_7_56_Bor03_GM.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_Z.xml

TRS/Transformed_CSR_04/ExIntrod_Zan97_FR.xml

TRS/Transformed_CSR_04/Ex1_GM03_L.xml

TRS/Transformed_CSR_04/Ex2_Luc03b_L.xml

TRS/Transformed_CSR_04/Ex24_Luc06_GM.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_L.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_C.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete-noand_L.xml

TRS/Transformed_CSR_04/PEANO_complete_noand_GM.xml

TRS/Transformed_CSR_04/Ex18_Luc06_C.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_L.xml

TRS/Transformed_CSR_04/Ex1_GL02a_C.xml

TRS/Transformed_CSR_04/Ex1_Luc02b_C.xml

TRS/Transformed_CSR_04/Ex24_Luc06_C.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/Ex4_DLMMU04_L.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_C.xml

TRS/Transformed_CSR_04/Ex24_GM04_FR.xml

TRS/Transformed_CSR_04/Ex8_BLR02_Z.xml

TRS/Transformed_CSR_04/Ex49_GM04_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_Z.xml

TRS/Transformed_CSR_04/MYNAT_nokinds-noand_Z.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds-noand_L.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_noand_C.xml

TRS/Transformed_CSR_04/Ex5_Zan97_C.xml

TRS/Transformed_CSR_04/PALINDROME_nosorts_noand_GM.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_GM.xml

TRS/Transformed_CSR_04/Ex6_GM04_C.xml

TRS/Transformed_CSR_04/OvConsOS_nosorts_noand_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_FR.xml

TRS/Transformed_CSR_04/LengthOfFiniteLists_complete_noand_C.xml

TRS/Transformed_CSR_04/PEANO_complete_Z.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_FR.xml

TRS/Transformed_CSR_04/PALINDROME_complete-noand_Z.xml

TRS/Transformed_CSR_04/Ex1_GM03_FR.xml

TRS/Transformed_CSR_04/MYNAT_complete-noand_FR.xml

TRS/Transformed_CSR_04/Ex6_Luc98_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_complete_Z.xml

TRS/Transformed_CSR_04/Ex1_GM03_GM.xml

TRS/Transformed_CSR_04/ExIntrod_GM99_L.xml

TRS/Transformed_CSR_04/Ex15_Luc06_C.xml

TRS/Transformed_CSR_04/PALINDROME_complete_FR.xml

TRS/Transformed_CSR_04/MYNAT_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex6_9_Luc02c_GM.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nokinds_noand_C.xml

TRS/Transformed_CSR_04/LISTUTILITIES_nosorts_FR.xml

TRS/Transformed_CSR_04/Ex1_GL02a_FR.xml

Complexity:Techniques

2010-04-15T03:53:11Z

Zini: Created page with 'This page is for listing all techniques applied by the participants of the complexity competitions. '''Be aware:''' the lists are still preliminary. == Derivational Complexity…'

This page is for listing all techniques applied by the participants of the complexity competitions.

'''Be aware:''' the lists are still preliminary.

== Derivational Complexity ==

{| class="wikitable center" border="1" style="text-align:left"
|-
! width="350"|Method
! 2008
! 2009
|-
| Arctic Interpretation
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| [[Tools:CaT]]
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:CaT]], [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:Matchbox]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| [[Tools:Matchbox]]
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Rewriting Right Hand Sides
| [[Tools:CaT]]
| [[Tools:TCT]]
|-
| Root Labeling
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|}

== Runtime Complexity ==

{| class="wikitable center" border="1" style="text-align:left"
|-
! width="350"|Method
! 2008
! 2009
|-
| Arctic Interpretation
| ---
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| ---
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| ---
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Polynomial Path Orders
| [[Tools:TCT]]
| [[Tools:TCT]]
|-
| Rewriting Right Hand Sides
| ---
| ---
|-
| Root Labeling
| ---
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Weak Dependency Pairs
| [[Tools:TCT]]
| [[Tools:TCT]]
|}

Complexity:Rules

2010-04-15T03:44:53Z

Zini: initial content, from page Complexity

The purpose of this page is to provide a place for ongoing discussions
on the rules, and to describe the current rules itself.

== Discussion ==
=== Lower Bounds ===
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.

(JW: I don't like the looks of an answer starting "YES" and indicating non-termination. See "BOUNDS" proposal below.)

=== Scoring (proposals) ===
* as for the upper bound the lower bound certificate should be ranked and both ranks could be compared lexicographically (with the upper bound as the primary criterion)

* JW prefers: don't define some artificial total order on the bounds. The natural partial ordering is given by the inclusion relation on the sets of functions that are described by the bounds. This inclusion can be computed from
<PRE>
(low1, up1) "is better than" (low2, up2) iff low1 >= low2 and up1 <= up2
</PRE>Then for each problem, answer A gets awarded k points if A is strictly better than k of the answers, where "no answer" counts as BOUNDS(LIN,INF), and "strictly better = better and not equal".
This would imply that if all answers are identical, then no-one gets a point.
Perhaps we want to add one virtual prover that always says"BOUNDS(LIN,INF)" -
so anyone who gives a better answer, gets at least one point.

=== Concrete syntax ===
* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

* JW: I'm not giving up ... one more reason against the O(n^k) syntax: 3. it cannot be used for lower bounds, as we would need Omega instead of Oh. (The other two reasons are: 2. needlessly complicated, and 1. n is an undefined variable)

* proposal to replace YES/NO/MAYBE by BOUNDS: http://dev.aspsimon.org/bugzilla/show_bug.cgi?id=85#c4

LN: I'd like to support this notation. But I think "?" for an unknown bound is unnecessary. It can always be replaced by POLY(0) for the lower
bound and INF for the upper bound. [[User:Noschinski|Noschinski]] 13:26, 13 February 2010 (UTC)

== Rules of the Competition ==
=== Input Format ===
Problems are given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification]. where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based respectively.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

=== Scoring ===
Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

=== Problem Sets and Problem Selection ===
We propose to run subcategories DC and iDC
on all TRS and SRS families from the newly organised TPDB, after
the selection function defined below has been applied.
For categories RC and iRC, we propose to run the competition on all TRS families
after application of the selection function stated below:

==== Selection function ====
In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... + p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

Complexity Techniques

2010-03-29T07:58:29Z

Zini: /* Runtime Complexity */

This page is for listing all techniques applied by the participants of the complexity competitions.

'''Be aware:''' the lists are still preliminary.

== Derivational Complexity ==

{| class="wikitable" border="1"
|-
! Method
! 2008
! 2009
|-
| Arctic Interpretation
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| [[Tools:CaT]]
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:CaT]], [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:Matchbox]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| [[Tools:Matchbox]]
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Rewriting Right Hand Sides
| [[Tools:CaT]]
| [[Tools:TCT]]
|-
| Root Labeling
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|}

== Runtime Complexity ==

{| class="wikitable" border="1"
|-
! Method
! 2008
! 2009
|-
| Arctic Interpretation
| ---
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| ---
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| ---
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Polynomial Path Orders
| [[Tools:TCT]]
| [[Tools:TCT]]
|-
| Rewriting Right Hand Sides
| ---
| ---
|-
| Root Labeling
| ---
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Weak Dependency Pairs
| [[Tools:TCT]]
| [[Tools:TCT]]
|}

Complexity Techniques

2010-03-27T08:08:58Z

Zini:

This page is for listing all techniques applied by the participants of the complexity competitions.

'''Be aware:''' the lists are still preliminary.

== Derivational Complexity ==

{| class="wikitable" border="1"
|-
! Method
! 2008
! 2009
|-
| Arctic Interpretation
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| [[Tools:CaT]]
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:CaT]], [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:Matchbox]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| [[Tools:Matchbox]]
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Rewriting Right Hand Sides
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Root Labeling
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|}

== Runtime Complexity ==

{| class="wikitable" border="1"
|-
! Method
! 2008
! 2009
|-
| Arctic Interpretation
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Match Bounds
| [[Tools:CaT]]
| [[Tools:CaT]]
|-
| Matrix Interpretation Triangular
| [[Tools:CaT]], [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Matrix Interpretation Non-Triangular
| ---
| ---
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Polynomial Path Orders
| [[Tools:TCT]]
| [[Tools:TCT]]
|-
| Rewriting Right Hand Sides
| [[Tools:CaT]]
| [[Tools:CaT]]
|-
| Root Labeling
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Weak Dependency Pairs
| [[Tools:TCT]]
| [[Tools:TCT]]
|}

Complexity Techniques

2010-03-27T07:50:50Z

Zini: /* Derivational Complexity */

This page is for listing all techniques applied by the participants of the complexity competitions.

{| class="wikitable" border="1"
|-
! Method
! 2008
! 2009
|-
| Matrix Interpretation Non-Triangular
| ---
| [[Tools:Matchbox]]
|-
| Matrix Interpretation Triangular
| [[Tools:CaT]], [[Tools:TCT]]
| [[Tools:CaT]], [[Tools:Matchbox]], [[Tools:TCT]]
|-
| Arctic Interpretation
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Root Labeling
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Rewriting Right Hand Sides
| [[Tools:CaT]]
| [[Tools:CaT]], [[Tools:TCT]]
|-
| Modular (Relative) Complexity Analysis
| ---
| [[Tools:CaT]]
|-
| Match Bounds
| [[Tools:CaT]]
| [[Tools:CaT]]
|}

== Runtime Complexity ==

=== 2009 ===

TBA

=== 2008 ===

TBA

Complexity:Old

2009-12-04T14:53:39Z

Zini: /* Problem selection */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run subcategories DC and iDC
on all TRS and SRS families from the newly organised TPDB, after
the selection function defined below has been applied.
For categories RC and iRC, we propose to run the competition on all TRS families
after application of the selection function stated below:

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participation ==

=== Requirements ===
In order to participate in the competition, the '''sources''' of your tool have to be '''publicly available'''.

=== Participants ===

Insert your name here if you intend to participate:

==== Competition 2009 ====
* M. Avanzini, G. Moser, A. Schnabl ([http://cl-informatik.uibk.ac.at/software/tct TCT])
* J. Waldmann (matchbox) (derivational complexity for full rewriting)

==== Competition 2008 ====
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-12T08:08:20Z

Zini:

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participation ==

=== Requirements ===
In order to participate in the competition, the '''sources''' of your tool have to be '''publicly available'''.

=== Participants ===

Insert your name here if you intend to participate:

==== Competition 2008 ====
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

==== Competition 2009 ====
* M. Avanzini, G. Moser, A. Schnabl ([http://cl-informatik.uibk.ac.at/software/tct TCT])

Complexity:Old

2009-11-12T07:48:01Z

Zini: /* Competition 2009 */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participation ==

=== Requirements ===
In order to participate in the competition, the '''sources''' of your tool have to be '''publicly available'''.

=== Participants ===

Insert your name here if you intend to participate:

==== Competition 2008 ====
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

==== Competition 2009 ====
* M. Avanzini, G. Moser, A. Schnabl ([http://cl-informatik.uibk.ac.at/software/tct TCT])

Complexity:Old

2009-11-12T07:46:34Z

Zini: /* Participation */

Complexity:Old

2009-11-12T07:45:34Z

Zini: /* Participants */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participation ==

=== Requirements ===
In order to participate in the competition, the '''sources''' of your tool has to be '''publicly available'''.

=== Participants ===

Insert your name here if you intend to participate:

==== Competition 2008 ====
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

==== Competition 2009 ====
* M. Avanzini, G. Moser, A. Schnabl (TCT)

Complexity:Old

2009-11-10T13:19:59Z

Zini: /* Selection function */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we define the extended selection function ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T13:18:12Z

Zini: /* Questions */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we then define the extended selection function ''select_comp'' such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T13:16:46Z

Zini: /* Overview of the Event */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories:
# Derivational Complexity (DC),
# innermost Derivational Complexity (iDC),
# Runtime Complexity (RC), and
# innermost Runtime Complexity (iRC)

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we then define the extended selection function ''select_comp'' such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing 

resolved for the competition on Nov 1, see above, for suggestion of XML input format

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T13:14:37Z

Zini: /* Selection function */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories RC, iRC and iDC:''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory DC:''' as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we then define the extended selection function ''select_comp'' such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing 

resolved for the competition on Nov 1, see above, for suggestion of XML input format

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T13:13:56Z

Zini: /* Syntax/Semantics for Input/Output */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

=== Input Format ===
Problems will be given in the newly TPDB-format, cf.
[http://www.termination-portal.org/wiki/XTC_Format_Specification], where
the XML-element ''problem'' will have the type ''complexity'' given.
Further, depending on the category DC, iDC, RC and iRC, the attributes
''strategy'' and ''startterm'' will be set to FULL/INNERMOST and full/constructor-based
respectively.
In particluar, this allows the upload of one single tool for all categories the authors want to participate in.

=== Output Format ===
The output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories runtime-complexity (RC), innermost runtime-complexity (iRC), and innermost derivational-complexity (iDC):''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory derivational complexity (DC)''': as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we then define the extended selection function ''select_comp'' such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing 

resolved for the competition on Nov 1, see above, for suggestion of XML input format

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T13:02:59Z

Zini: /* Selection function */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

Although there has been some discussion, unfortunately no agreement on a
new input format specific for the complexity category could be found.
Hence, as ad-hoc solution for the competition on November 1, the only demand from
the input is that it includes a well-formed description of a TRS,
all remaining annotations will be ignored.
To control the four subcategories, specific runme scripts are to be used.

For the future, one could use an XML input format that is generated on the fly.
The below proposal extends the current proposal of an XML import/export format,
see [http://termination-portal.org/wiki/TPDB_XML_Format]:

<pre>
<complexity>
<theory><theorydecl>Multiple</theorydecl></theory>
<startterm>
<CONSTRUCTOR-BASED/>
<FULL/>
<AUTOMATON>
<automatonstuff/>
</AUTOMATON>
</startterm>
<strategy>
<INNERMOST/> |
<OUTERMOST/> |
<CONTEXTSENSITIVE>
<contextsensitivestuff/>
</CONTEXTSENSITIVE>
|<NONE/>
</strategy>
<conditional type="ltr|join"/>
<type>TRS|SRS</type>
</complexity>
</pre>

On the other hand the output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories runtime-complexity (RC), innermost runtime-complexity (iRC), and innermost derivational-complexity (iDC):''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory derivational complexity (DC)''': as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). That is, we want to consider 40% examples that could be solved automatically in last years competition, and 60% of examples that could not be solved automatically. Additionally for DC we want to exclude duplicating TRS as those admit exponential derivational complexity. Based on the probability distribution ''p'' we then define the extended selection function ''select_comp'' such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing 

resolved for the competition on Nov 1, see above, for suggestion of XML input format

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2009-11-10T10:24:11Z

Zini: /* Problem selection */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds.

Although there has been some discussion, unfortunately no agreement on a
new input format specific for the complexity category could be found.
Hence, as ad-hoc solution for the competition on November 1, the only demand from
the input is that it includes a well-formed description of a TRS,
all remaining annotations will be ignored.
To control the four subcategories, specific runme scripts are to be used.

For the future, one could use an XML input format that is generated on the fly.
The below proposal extends the current proposal of an XML import/export format,
see [http://termination-portal.org/wiki/TPDB_XML_Format]:

<pre>
<complexity>
<theory><theorydecl>Multiple</theorydecl></theory>
<startterm>
<CONSTRUCTOR-BASED/>
<FULL/>
<AUTOMATON>
<automatonstuff/>
</AUTOMATON>
</startterm>
<strategy>
<INNERMOST/> |
<OUTERMOST/> |
<CONTEXTSENSITIVE>
<contextsensitivestuff/>
</CONTEXTSENSITIVE>
|<NONE/>
</strategy>
<conditional type="ltr|join"/>
<type>TRS|SRS</type>
</complexity>
</pre>

On the other hand the output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

<pre>
S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?)
F -> O(1) | O(n^Nat) | POLY
</pre>

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose to run each complexity-subcategory
on all TRS and SRS families from the newly organised TPDB, after
the following selection function defined below has been applied.

=== Selection function ===

In the following, we denote by ''select'' the function that relates
each family from the TPDB to the number of randomly chosen examples within this family as defined
for the termination competition.
The idea is to make ''select''
aware of different difficulties of proving complexity bounds. We do so by
# partitioning each family ''F'' into ''n'' different sets ''F = F_1 \cup ... \cup F_n'', where the sets ''F_i'' may be seen as collections of TRSs similar in difficulty. For this years competition we propose following partitioning of a family ''F'':
#:* '''subcategories runtime-complexity (RC), innermost runtime-complexity (iRC), and innermost derivational-complexity (iDC):''' we propose to partition each family into
#:*:(i) those upon which a polynomial bound could be shown automatically in last years competition (denoted by ''F_auto'' below) and
#:*:(ii) those where a polynomial bound could not be shown (''F_nonauto'').
#:* '''subcategory derivational complexity (DC)''': as above, but we split (ii) into duplicating TRS (''F_duplicating'') and non-duplicating TRSs (note that any TRS from (i) is non-duplicating)
# In accordance to the above described partitioning, we define a probability distribution ''p'' on ''F'' such that ''p(F_1) + ... p(F_n) = 1''. For this year's competition we propose the following distribution:
#:for all subcategories and families ''F'', we propose ''p(F_auto) = 0.4'' and ''p(F_nonauto) = 0.6'' (For the category DC, we additionally set ''p(F_duplicating) = 0.0''). Based on the probability distribution ''p'' we then define the extended selection function "select_comp" such that ''select_comp(F,i) = min(|F_i|, p(i) * select(F))''. Here ''|F_i|'' denotes the size of ''F_i''.
# From each partition ''F_i'' of a family ''F'', we randomly select ''select_comp(F,i)'' examples.

== Test Cases ==
In the following test cases we restrict to full rewriting.

test cases - derivational complexity


<pre>
R = {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"
</pre>

test cases - runtime complexity 
<pre>
R = {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R = {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n^1),O(n^2))" or "YES(O(n^2),O(n^2))"

R = {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n^1))" or "YES(O(n^1),O(n^1))"

R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"
</pre>

In the following test cases we restrict to innermost rewriting.

test cases - derivational complexity 
<pre>
R = {f(x) -> c(x,x)}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

test cases - runtime complexity 
<pre>
R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n^1),O(n^1))" or "YES(?,O(n^1))"
</pre>

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

<pre>
F -> O(1) | O(n^Nat) | POLY | EXP | INF
</pre>

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing 

resolved for the competition on Nov 1, see above, for suggestion of XML input format

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial. 

resolved

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)
* N. Hirokawa (Hydra), but might need more time
* M. Korp, C. Sternagel, H. Zankl (CaT)

Complexity:Old

2008-10-20T17:36:04Z

Zini: /* Problem selection */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds. The current input format should be kept as far as possible,
i.e., from a given TRS a complexity problem file is generated by
adding an annotation expressing one of the above given categories. This is
done on the fly during the competition to prevent the multiplication
of the database.

On the other hand the output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?) 
F -> O(1) | O(n^Nat) | POLY

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose the collection of all "standard" TRSs together
with all TRSs with flag "(STRATEGY INNERMOST)" as testbed. Here TRSs which
only differ by the flag in the current TPDB are only considered once.
However for sub-categories concerned with "derivational complexity" we
propose to restrict our attention to non-duplicating systems.

In the following test cases we restrict to full rewriting.

Test Cases - derivational complexity 
*
* R= {a -> b}, expected output "YES(O(n),O(n))" or "YES(?,O(n))" (if tool output should be closed under extension of signature)

* R= {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

* R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"

Test Cases - runtime complexity 
*
* R= {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"

In the following test cases we restrict to innermost rewriting.

Test Cases - derivational complexity 
*
* R= {f(x) -> c(x,x)}, expected output "YES(O(n),O(n))" or "YES(?,O(n))"

Test Cases - runtime complexity 
*
* R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n),O(n))" or "YES(?,O(n))"

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

F -> O(1) | O(n^Nat) | POLY | EXP | INF

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing.

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial.

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)

Complexity:Old

2008-10-20T17:03:25Z

Zini: /* Scoring */

This page is to record the current status of discussion
on the proposed Complexity Category of the Termination Competition.

The first installation of this event is planned for November 1, 2008.

(Discussion should take place on the termtools mailing list.)

== Overview of the Event ==

It is a challenging topic to automatically determine upper bounds on
the complexity of rewrite systems. By complexity of a TRS, we mean
the maximal length of derivations, where either no restrictions on the
initial terms are present ("derivational complexity") or only
constructor based terms are considered ("runtime complexity"). See
(Hirokawa, Moser, 2008) for further reading on the notion of runtime
complexity. Additionally one distinguishes between complexities
induced by full rewriting as opposed to complexities induced by
specific strategies, as for example innermost rewriting.
We propose four sub-categories, structured in two logical layers:
"strategy" and "complexity certificate", such that for each of
the currently considered strategies, both notions of complexity are tested.

== Syntax/Semantics for Input/Output ==

As competition semantics, we propose to focus on polynomial
bounds. The current input format should be kept as far as possible,
i.e., from a given TRS a complexity problem file is generated by
adding an annotation expressing one of the above given categories. This is
done on the fly during the competition to prevent the multiplication
of the database.

On the other hand the output format is adapted so that additional
information on the asymptotic complexity is given for lower as well
as upper bounds. Hence the output written to the first line of STDOUT
shall be a complexity statement according to the following grammar:

S -> NO | MAYBE | YES( F, F) | YES( ?, F) | YES( F, ?) 
F -> O(1) | O(n^Nat) | POLY

where "Nat" is a non-zero natural number and YES(F1, F2) means F2 is
upper bound and that F1 is a lower-bound. "O(n^k)" is the usual big-Oh
notation and "POLY" indicates an unspecified polynomial. Either of
the functions F1, F2 (but not both) may be replaced by ``don't know'',
indicated by ?. Any remaining output on STDOUT will be considered as
proof output and has to follow the normal rules for the competition.

Example: Consider R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}. Within
the derivational complexity category a syntactically correct output would be "YES(O(n^2),POLY)".
(Whether this output would also indicate a correct tool, is another question.)

== Scoring ==

Currently we focus on (polynomial) upper bounds. As
the output format indicates, this restriction should be lifted
later, see below. In order to take into account the quality of the upper
bound provided by the different tools, we propose the following
scoring algorithm, where we suppose the number of competitors is x.

Firstly, for each TRS the competing tools are ranked, where constant
complexity, i.e., output "YES(?,O(1))" is best and "MAYBE", "NO" or
time-out is worst.
As long as the output is of form "YES(?,O(n^k))" or "YES(?,POLY)" the
rank of the tool defines the number of points. More precisely the
best tool gets x+1 points, the second gets x points and so on. On the
other hand a negative output ("MAYBE", "NO" or time-out) gets 0
points.
If two or more tools would get the same rank, the rank of the
remaining tools is adapted in the usual way.

Secondly, all resulting points for all considered systems are summed
up and the contestant with the highest number of points wins. If this
cannot establish a winner, the total number of wins is counted. If
this still doesn't produce a winner, we give up and provide two (or
more) winners.

The maximal allowed CPU time is 60 seconds.

== Problem selection ==

We propose the collection of all "standard" TRSs together
with all TRSs with flag "(STRATEGY INNERMOST)" as testbed. Here TRSs which
only differ by the flag in the current TPDB are only considered once.
However for sub-categories concerned with "derivational complexity" we
propose to restrict our attention to non-duplicating systems.

In the following test cases we restrict to full rewriting.

Test Cases - derivational complexity 
*
* R= {a -> b}, expected output "YES(O(n),O(n))" or "YES(?,O(n))" (if tool output should be closed under extension of signature)

* R= {a(b(x)) -> b(a(x))}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {op(op(x,y),z) -> op(x,op(y,z))}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {f(f(x)) -> f(g(f(x)))}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {plus(mul(x,y),mul(x,z)) -> mul(x,plus(y,z)), plus(plus(x,y),z) -> plus(x,+(y,z)), plus(mul(x,y),plus(mul(x,z),u)) -> plus(mul(x,plus(y,z)),u)}

* R= {half(0) -> 0, half(s(0)) -> 0, half(s(s(x))) -> s(half(x)), s(log(0)) -> s(0), log(s(x)) -> s(log(half(s(x))))}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {a(a(x)) -> b(c(x)), b(b(x)) -> a(c(x)), c(c(x)) -> a(b(x))}, expected output "YES(O(n^2),?)" or "YES(?,?)"

* R= {+(s(x),+(y,z)) -> +(x,+(s(s(y)),z)), +(s(x),+(y,+(z,w))) -> +(x,+(z,+(y,w)))}, expected output "YES(?,?)"

Test Cases - runtime complexity 
*
* R= {a(b(x)) -> b(b(a(x)))}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {plus(0,y) -> y, plus(s(x),y) -> s(plus(x,y)), mul(0,y) -> 0, mul(s(x),y) -> plus(mul(x,y),y)}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {if(tt,x,y) -> x, if(ff,x,y) -> y, le(0,s(y)) -> tt, le(x,0) -> ff, le(s(x),s(y)) -> le(x,y), insert(x,nil) -> cons(x,nil), insert(x,cons(y,ys)) -> if(le(x,y),cons(x,cons(y,ys)),cons(y,insert(x,ys))), sort(nil) -> nil, sort(cons(x,xs)) -> insert(x,sort(xs))}, expected output "YES(?,O(n^2))" or "YES(O(n),O(n^2))" or "YES(O(n^2),O(n^2))"

* R= {minus(0,y) -> 0, minus(x,0) -> x, minus(s(x),s(y)) -> minus(x,y), div(0,s(y)) -> 0, div(s(x),s(y)) -> s(div(minus(x,y),s(y)))}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {f(x,0) -> s(0), f(s(x),s(y)) -> s(f(x,y)), g(0,x) -> g(f(x,x),x)}, expected output "YES(?,O(n))" or "YES(O(n),O(n))"

* R= {d(0) -> 0, d(s(x)) -> s(s(d(x))), e(0) -> s(0), e(s(x)) -> d(e(x))}, expected output "YES(?,?)"

* R= {f(0) -> c, f(s(x)) -> c(f(x),f(x))}, expected output "YES(?,?)"

In the following test cases we restrict to innermost rewriting.

Test Cases - derivational complexity 
*
* R= {f(x) -> c(x,x)}, expected output "YES(O(n),O(n))" or "YES(?,O(n))"

Test Cases - runtime complexity 
*
* R= {f(x) -> c(x,x), g(0) -> 0, g(s(x)) -> f(g(x))}, expected output "YES(O(n),O(n))" or "YES(?,O(n))"

== Wishlist ==
*
* assessment of lower bounds: 
In the future the tools should also be able to provide certificates on the
lower bound. This would imply to extend the grammar as follows

F -> O(1) | O(n^Nat) | POLY | EXP | INF

such that e.g. "YES(EXP,?)" indicated an exponential lower-bound,
or "YES(INF,INF)" indicated non-termination.
* as for the upper bound the lower bound certificate should be ranked and
both ranks could be compared lexicographically

== Questions ==
*
* the precise format for the subcategories needs to be fixed; JW suggests:

(START-TERMS CONSTRUCTOR-BASED) (VAR x) (RULES a(b(x)) -> b(a(x)))

to indicate runtime complextiy and full rewriting , GM suggests

(VAR x) (RULES a(b(x)) -> b(a(x))) (COMPLEXITY RUNTIME)

for the same thing.

* JW would prefer the following output format as it is easier to parse:

F -> POLY(Nat) | POLY(?)

Here "POLY(k)" abbreviates "O(n^k)" and "POLY(?)" denotes an unspecified
polynomial.

== Participants ==

insert your name here if you intend to participate.
The sources of all tools that want to participate in the competition
have to be publicly available.

*
* Johannes Waldmann (Matchbox), but will need more time (December 2008)
* M. Avanzini, G. Moser, A. Schnabl (TCT)