details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.04324388504 seconds
cpu usage	0.984305666
max memory	1.5753216E7

stage attributes

key	value
output-size	9695
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 n: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 head(add(n:S,x:S)) -> n:S if(ffalse,x:S,y:S,z:S) -> shuff(reverse(tail(x:S)),z:S) if(ttrue,x:S,y:S,z:S) -> y:S null(add(n:S,x:S)) -> ffalse null(nil) -> ttrue reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuff(x:S,y:S) -> if(null(x:S),x:S,y:S,app(y:S,add(head(x:S),nil))) shuffle(x:S) -> shuff(x:S,nil) tail(add(n:S,x:S)) -> x:S tail(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 head(add(n:S,x:S)) -> n:S if(ffalse,x:S,y:S,z:S) -> shuff(reverse(tail(x:S)),z:S) if(ttrue,x:S,y:S,z:S) -> y:S null(add(n:S,x:S)) -> ffalse null(nil) -> ttrue reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuff(x:S,y:S) -> if(null(x:S),x:S,y:S,app(y:S,add(head(x:S),nil))) shuffle(x:S) -> shuff(x:S,nil) tail(add(n:S,x:S)) -> x:S tail(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) IF(ffalse,x:S,y:S,z:S) -> REVERSE(tail(x:S)) IF(ffalse,x:S,y:S,z:S) -> SHUFF(reverse(tail(x:S)),z:S) IF(ffalse,x:S,y:S,z:S) -> TAIL(x:S) REVERSE(add(n:S,x:S)) -> APP(reverse(x:S),add(n:S,nil)) REVERSE(add(n:S,x:S)) -> REVERSE(x:S) SHUFF(x:S,y:S) -> APP(y:S,add(head(x:S),nil)) SHUFF(x:S,y:S) -> HEAD(x:S) SHUFF(x:S,y:S) -> IF(null(x:S),x:S,y:S,app(y:S,add(head(x:S),nil))) SHUFF(x:S,y:S) -> NULL(x:S) SHUFFLE(x:S) -> SHUFF(x:S,nil) -> Rules: app(add(n:S,x:S),y:S) -> add(n:S,app(x:S,y:S)) app(nil,y:S) -> y:S head(add(n:S,x:S)) -> n:S if(ffalse,x:S,y:S,z:S) -> shuff(reverse(tail(x:S)),z:S) if(ttrue,x:S,y:S,z:S) -> y:S null(add(n:S,x:S)) -> ffalse null(nil) -> ttrue reverse(add(n:S,x:S)) -> app(reverse(x:S),add(n:S,nil)) reverse(nil) -> nil shuff(x:S,y:S) -> if(null(x:S),x:S,y:S,app(y:S,add(head(x:S),nil))) shuffle(x:S) -> shuff(x:S,nil) tail(add(n:S,x:S)) -> x:S tail(nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(add(n:S,x:S),y:S) -> APP(x:S,y:S) IF(ffalse,x:S,y:S,z:S) -> REVERSE(tail(x:S)) IF(ffalse,x:S,y:S,z:S) -> SHUFF(reverse(tail(x:S)),z:S) IF(ffalse,x:S,y:S,z:S) -> TAIL(x:S) REVERSE(add(n:S,x:S)) -> APP(reverse(x:S),add(n:S,nil)) REVERSE(add(n:S,x:S)) -> REVERSE(x:S) SHUFF(x:S,y:S) -> APP(y:S,add(head(x:S),nil)) SHUFF(x:S,y:S) -> HEAD(x:S) SHUFF(x:S,y:S) -> IF(null(x:S),x:S,y:S,app(y:S,add(head(x:S),nil))) SHUFF(x:S,y:S) -> NULL(x:S) SHUFFLE(x:S) -> SHUFF(x:S,nil) -> Rules: app(add(n:S,x:S),y:S) -> add(n:S,app(x:S,y:S)) app(nil,y:S) -> y:S head(add(n:S,x:S)) -> n:S if(ffalse,x:S,y:S,z:S) -> shuff(reverse(tail(x:S)),z:S) if(ttrue,x:S,y:S,z:S) -> y:S null(add(n:S,x:S)) -> ffalse null(nil) -> ttrue popout

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

job log

popout

actions

all output return to TRS Standard