details

property	value
status	complete
benchmark	Ex1_Luc02b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n073.star.cs.uiowa.edu
space	Strategy_removed_CSR_05

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.134073972702 seconds
cpu usage	0.123184967
max memory	5357568.0

stage attributes

key	value
output-size	1517
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o cons : [o * o] --> o first : [o * o] --> o from : [o] --> o nil : [] --> o s : [o] --> o sel : [o * o] --> o from(X) => cons(X, from(s(X))) first(0, X) => nil first(s(X), cons(Y, Z)) => cons(Y, first(X, Z)) sel(0, cons(X, Y)) => X sel(s(X), cons(Y, Z)) => sel(X, Z) As the system is orthogonal, it is terminating if it is innermost terminating by [Gra95]. Then, by [FuhGieParSchSwi11], it suffices to prove (innermost) termination of the typed system, with sort annotations chosen to respect the rules, as follows: 0 : [] --> db cons : [db * za] --> za first : [db * za] --> za from : [db] --> za nil : [] --> za s : [db] --> db sel : [db * za] --> db +++ Citations +++ [FuhGieParSchSwi11] C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, and S. Swiderski. Proving Termination by Dependency Pairs and Inductive Theorem Proving. In volume 47(2) of Journal of Automated Reasoning. 133--160, 2011. [Gra95] B. Gramlich. Abstract Relations Between Restricted Termination and Confluence Properties of Rewrite Systems. In volume 24(1-2) of Fundamentae Informaticae. 3--23, 1995. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Stand 20472