details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.270864009857 seconds
cpu usage	0.268461584
max memory	6172672.0

stage attributes

key	value
output-size	1309
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. L : [o * o] --> o R : [o * o] --> o a : [o] --> o b : [] --> o R(X, a(Y)) => R(a(X), Y) R(X, b) => L(X, a(b)) L(a(X), Y) => L(X, a(Y)) L(b, X) => R(a(b), X) 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: L : [oa * oa] --> qa R : [oa * oa] --> qa a : [oa] --> oa b : [] --> oa +++ 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