details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0214519500732 seconds
cpu usage	0.017036812
max memory	2134016.0

stage attributes

key	value
output-size	10756
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR l m n) (RULES insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) -> true insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) -> false insert(nil,m) -> cons(m,nil) lte(0,n) -> true lte(s(m),0) -> false lte(s(m),s(n)) -> lte(m,n) ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) -> true ordered(cons(m,cons(n,l))) -> false | lte(m,n) -> false ordered(cons(m,nil)) -> true ordered(nil) -> true ) Problem 1: Valid CTRS Processor: -> Rules: insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) -> true insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) -> false insert(nil,m) -> cons(m,nil) lte(0,n) -> true lte(s(m),0) -> false lte(s(m),s(n)) -> lte(m,n) ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) -> true ordered(cons(m,cons(n,l))) -> false | lte(m,n) -> false ordered(cons(m,nil)) -> true ordered(nil) -> true -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: INSERT(cons(n,l),m) -> INSERT(l,m) | lte(m,n) -> false LTE(s(m),s(n)) -> LTE(m,n) ORDERED(cons(m,cons(n,l))) -> ORDERED(cons(n,l)) | lte(m,n) -> true -> QPairs: Empty -> Rules: insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) -> true insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) -> false insert(nil,m) -> cons(m,nil) lte(0,n) -> true lte(s(m),0) -> false lte(s(m),s(n)) -> lte(m,n) ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) -> true ordered(cons(m,cons(n,l))) -> false | lte(m,n) -> false ordered(cons(m,nil)) -> true ordered(nil) -> true Conditional Termination Problem 2: -> Pairs: INSERT(cons(n,l),m) -> LTE(m,n) ORDERED(cons(m,cons(n,l))) -> LTE(m,n) -> QPairs: INSERT(cons(n,l),m) -> INSERT(l,m) | lte(m,n) -> false LTE(s(m),s(n)) -> LTE(m,n) ORDERED(cons(m,cons(n,l))) -> ORDERED(cons(n,l)) | lte(m,n) -> true -> Rules: insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) -> true insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) -> false insert(nil,m) -> cons(m,nil) lte(0,n) -> true lte(s(m),0) -> false lte(s(m),s(n)) -> lte(m,n) ordered(cons(m,cons(n,l))) -> ordered(cons(n,l)) | lte(m,n) -> true ordered(cons(m,cons(n,l))) -> false | lte(m,n) -> false ordered(cons(m,nil)) -> true ordered(nil) -> true The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: INSERT(cons(n,l),m) -> INSERT(l,m) | lte(m,n) -> false LTE(s(m),s(n)) -> LTE(m,n) ORDERED(cons(m,cons(n,l))) -> ORDERED(cons(n,l)) | lte(m,n) -> true -> QPairs: Empty -> Rules: insert(cons(n,l),m) -> cons(m,cons(n,l)) | lte(m,n) -> true insert(cons(n,l),m) -> cons(n,insert(l,m)) | lte(m,n) -> false insert(nil,m) -> cons(m,nil) lte(0,n) -> true lte(s(m),0) -> false popout

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

job log

popout

actions

all output return to TRS Condi 20667