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	n145.star.cs.uiowa.edu
space	COPS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0581169128418 seconds
cpu usage	0.024614726
max memory	2375680.0

stage attributes

key	value
output-size	10315
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Conditional