Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712262
details
property
value
status
complete
benchmark
improved_usable2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.0373179912567 seconds
cpu usage
0.03238598
max memory
1630208.0
stage attributes
key
value
output-size
2569
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. a : [] --> o f : [o * o] --> o g : [o] --> o h : [o] --> o f(a, X) => f(g(X), X) h(g(X)) => h(a) g(h(X)) => g(X) h(h(X)) => X We use the dependency pair framework as described in [Kop12, Ch. 6/7], with static dependency pairs (see [KusIsoSakBla09] and the adaptation for AFSMs in [Kop12, Ch. 7.8]). We thus obtain the following dependency pair problem (P_0, R_0, minimal, formative): Dependency Pairs P_0: 0] f#(a, X) =#> f#(g(X), X) 1] f#(a, X) =#> g#(X) 2] h#(g(X)) =#> h#(a) 3] g#(h(X)) =#> g#(X) Rules R_0: f(a, X) => f(g(X), X) h(g(X)) => h(a) g(h(X)) => g(X) h(h(X)) => X Thus, the original system is terminating if (P_0, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_0, R_0, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : * 1 : 3 * 2 : * 3 : 3 This graph has the following strongly connected components: P_1: g#(h(X)) =#> g#(X) By [Kop12, Thm. 7.31], we may replace any dependency pair problem (P_0, R_0, m, f) by (P_1, R_0, m, f). Thus, the original system is terminating if (P_1, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_1, R_0, minimal, formative). We apply the subterm criterion with the following projection function: nu(g#) = 1 Thus, we can orient the dependency pairs as follows: nu(g#(h(X))) = h(X) |> X = nu(g#(X)) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_1, R_0, minimal, f) by ({}, R_0, minimal, f). By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed. As all dependency pair problems were succesfully simplified with sound (and complete) processors until nothing remained, we conclude termination. +++ Citations +++ [Kop12] C. Kop. Higher Order Termination. PhD Thesis, 2012. [KusIsoSakBla09] K. Kusakari, Y. Isogai, M. Sakai, and F. Blanqui. Static Dependency Pair Method Based On Strong Computability for Higher-Order Rewrite Systems. In volume 92(10) of IEICE Transactions on Information and Systems. 2007--2015, 2009.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472