details

property	value
status	complete
benchmark	#3.53b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n050.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.0557310581207 seconds
cpu usage	0.036990364
max memory	2351104.0

stage attributes

key	value
output-size	2513
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o 1 : [] --> o f : [o * o * o] --> o g : [o * o] --> o s : [o] --> o g(X, Y) => X g(X, Y) => Y f(0, 1, X) => f(s(X), X, X) f(X, Y, s(Z)) => s(f(0, 1, Z)) 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#(0, 1, X) =#> f#(s(X), X, X) 1] f#(X, Y, s(Z)) =#> f#(0, 1, Z) Rules R_0: g(X, Y) => X g(X, Y) => Y f(0, 1, X) => f(s(X), X, X) f(X, Y, s(Z)) => s(f(0, 1, Z)) 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 apply the subterm criterion with the following projection function: nu(f#) = 3 Thus, we can orient the dependency pairs as follows: nu(f#(0, 1, X)) = X = X = nu(f#(s(X), X, X)) nu(f#(X, Y, s(Z))) = s(Z) |> Z = nu(f#(0, 1, Z)) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_0, R_0, minimal, f) by (P_1, R_0, minimal, f), where P_1 contains: f#(0, 1, X) =#> f#(s(X), X, X) 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 place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : This graph has no strongly connected components. By [Kop12, Thm. 7.31], this implies finiteness of the dependency pair problem. 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