details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0255451 seconds
cpu usage	0.026067
user time	0.01445
system time	0.011617
max virtual memory	113188.0
max residence set size	5680.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S p:S x:S xs:S y:S) (RULES app(app(and,ffalse),y:S) -> ffalse app(app(and,ttrue),ttrue) -> ttrue app(app(and,x:S),ffalse) -> ffalse app(app(forall,p:S),app(app(cons,x:S),xs:S)) -> app(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) app(app(forall,p:S),nil) -> ttrue app(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> app(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) app(app(forsome,p:S),nil) -> ffalse app(app(or,ffalse),ffalse) -> ffalse app(app(or,ttrue),y:S) -> ttrue app(app(or,x:S),ttrue) -> ttrue ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(and,ffalse),y:S) -> ffalse app(app(and,ttrue),ttrue) -> ttrue app(app(and,x:S),ffalse) -> ffalse app(app(forall,p:S),app(app(cons,x:S),xs:S)) -> app(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) app(app(forall,p:S),nil) -> ttrue app(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> app(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) app(app(forsome,p:S),nil) -> ffalse app(app(or,ffalse),ffalse) -> ffalse app(app(or,ttrue),y:S) -> ttrue app(app(or,x:S),ttrue) -> ttrue -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forall,p:S),xs:S) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(and,app(p:S,x:S)) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forsome,p:S),xs:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(or,app(p:S,x:S)) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) -> Rules: app(app(and,ffalse),y:S) -> ffalse app(app(and,ttrue),ttrue) -> ttrue app(app(and,x:S),ffalse) -> ffalse app(app(forall,p:S),app(app(cons,x:S),xs:S)) -> app(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) app(app(forall,p:S),nil) -> ttrue app(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> app(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) app(app(forsome,p:S),nil) -> ffalse app(app(or,ffalse),ffalse) -> ffalse app(app(or,ttrue),y:S) -> ttrue app(app(or,x:S),ttrue) -> ttrue Problem 1: SCC Processor: -> Pairs: APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forall,p:S),xs:S) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(and,app(p:S,x:S)) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forsome,p:S),xs:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(or,app(p:S,x:S)) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) -> Rules: app(app(and,ffalse),y:S) -> ffalse app(app(and,ttrue),ttrue) -> ttrue app(app(and,x:S),ffalse) -> ffalse app(app(forall,p:S),app(app(cons,x:S),xs:S)) -> app(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) app(app(forall,p:S),nil) -> ttrue app(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> app(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) app(app(forsome,p:S),nil) -> ffalse app(app(or,ffalse),ffalse) -> ffalse app(app(or,ttrue),y:S) -> ttrue app(app(or,x:S),ttrue) -> ttrue ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forall,p:S),xs:S) APP(app(forall,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(app(forsome,p:S),xs:S) APP(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> APP(p:S,x:S) ->->-> Rules: app(app(and,ffalse),y:S) -> ffalse app(app(and,ttrue),ttrue) -> ttrue app(app(and,x:S),ffalse) -> ffalse app(app(forall,p:S),app(app(cons,x:S),xs:S)) -> app(app(and,app(p:S,x:S)),app(app(forall,p:S),xs:S)) app(app(forall,p:S),nil) -> ttrue app(app(forsome,p:S),app(app(cons,x:S),xs:S)) -> app(app(or,app(p:S,x:S)),app(app(forsome,p:S),xs:S)) app(app(forsome,p:S),nil) -> ffalse app(app(or,ffalse),ffalse) -> ffalse app(app(or,ttrue),y:S) -> ttrue app(app(or,x:S),ttrue) -> ttrue popout

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

job log

popout

actions

all output return to TRS Standard