details

property	value
status	complete
benchmark	enger-nonloop-isTrueList.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n007.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.131856918335 seconds
cpu usage	0.12188501
max memory	4313088.0

stage attributes

key	value
output-size	1358
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. Cons : [o * o] --> o f : [o * o] --> o isList : [o] --> o nil : [] --> o tt : [] --> o f(tt, X) => f(isList(X), Cons(tt, X)) isList(Cons(tt, X)) => isList(X) isList(nil) => tt 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: Cons : [ca * ba] --> ba f : [ca * ba] --> q isList : [ba] --> ca nil : [] --> ba tt : [] --> ca +++ 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