details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.144680976868 seconds
cpu usage	0.089685999
max memory	4055040.0

stage attributes

key	value
output-size	21587
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 v_NonEmpty:S n:S u:S v:S w:S x:S y:S z:S) (RULES app(add(n:S,x:S),y:S) -> add(n:S,app(x:S,y:S)) app(nil,y:S) -> y:S concat(cons(u:S,v:S),y:S) -> cons(u:S,concat(v:S,y:S)) concat(leaf,y:S) -> y:S less_leaves(cons(u:S,v:S),cons(w:S,z:S)) -> less_leaves(concat(u:S,v:S),concat(w:S,z:S)) less_leaves(leaf,cons(w:S,z:S)) -> ttrue less_leaves(x:S,leaf) -> ffalse minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(x:S,y:S),s(y:S))) reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuffle(add(n:S,x:S)) -> add(n:S,shuffle(reverse(x:S))) shuffle(nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(add(n:S,x:S),y:S) -> add(n:S,app(x:S,y:S)) app(nil,y:S) -> y:S concat(cons(u:S,v:S),y:S) -> cons(u:S,concat(v:S,y:S)) concat(leaf,y:S) -> y:S less_leaves(cons(u:S,v:S),cons(w:S,z:S)) -> less_leaves(concat(u:S,v:S),concat(w:S,z:S)) less_leaves(leaf,cons(w:S,z:S)) -> ttrue less_leaves(x:S,leaf) -> ffalse minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(x:S,y:S),s(y:S))) reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuffle(add(n:S,x:S)) -> add(n:S,shuffle(reverse(x:S))) shuffle(nil) -> nil -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(add(n:S,x:S),y:S) -> APP(x:S,y:S) CONCAT(cons(u:S,v:S),y:S) -> CONCAT(v:S,y:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> CONCAT(u:S,v:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> CONCAT(w:S,z:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> LESS_LEAVES(concat(u:S,v:S),concat(w:S,z:S)) MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> QUOT(minus(x:S,y:S),s(y:S)) REVERSE(add(n:S,x:S)) -> APP(reverse(x:S),add(n:S,nil)) REVERSE(add(n:S,x:S)) -> REVERSE(x:S) SHUFFLE(add(n:S,x:S)) -> REVERSE(x:S) SHUFFLE(add(n:S,x:S)) -> SHUFFLE(reverse(x:S)) -> Rules: app(add(n:S,x:S),y:S) -> add(n:S,app(x:S,y:S)) app(nil,y:S) -> y:S concat(cons(u:S,v:S),y:S) -> cons(u:S,concat(v:S,y:S)) concat(leaf,y:S) -> y:S less_leaves(cons(u:S,v:S),cons(w:S,z:S)) -> less_leaves(concat(u:S,v:S),concat(w:S,z:S)) less_leaves(leaf,cons(w:S,z:S)) -> ttrue less_leaves(x:S,leaf) -> ffalse minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(x:S,y:S),s(y:S))) reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuffle(add(n:S,x:S)) -> add(n:S,shuffle(reverse(x:S))) shuffle(nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(add(n:S,x:S),y:S) -> APP(x:S,y:S) CONCAT(cons(u:S,v:S),y:S) -> CONCAT(v:S,y:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> CONCAT(u:S,v:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> CONCAT(w:S,z:S) LESS_LEAVES(cons(u:S,v:S),cons(w:S,z:S)) -> LESS_LEAVES(concat(u:S,v:S),concat(w:S,z:S)) MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> QUOT(minus(x:S,y:S),s(y:S)) REVERSE(add(n:S,x:S)) -> APP(reverse(x:S),add(n:S,nil)) REVERSE(add(n:S,x:S)) -> REVERSE(x:S) SHUFFLE(add(n:S,x:S)) -> REVERSE(x:S) SHUFFLE(add(n:S,x:S)) -> SHUFFLE(reverse(x:S)) popout

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

job log

popout

actions

all output return to TRS Standard