Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965061
details
property
value
status
complete
benchmark
009.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.081573009491 seconds
cpu usage
0.027658683
max memory
2351104.0
stage attributes
key
value
output-size
11139
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 p:S x:S xs:S) (RULES app(app(and,ffalse),ffalse) -> ffalse app(app(and,ffalse),ttrue) -> ffalse app(app(and,ttrue),ffalse) -> ffalse app(app(and,ttrue),ttrue) -> ttrue 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,ffalse),ttrue) -> ttrue app(app(or,ttrue),ffalse) -> ttrue app(app(or,ttrue),ttrue) -> ttrue ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(and,ffalse),ffalse) -> ffalse app(app(and,ffalse),ttrue) -> ffalse app(app(and,ttrue),ffalse) -> ffalse app(app(and,ttrue),ttrue) -> ttrue 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,ffalse),ttrue) -> ttrue app(app(or,ttrue),ffalse) -> ttrue app(app(or,ttrue),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),ffalse) -> ffalse app(app(and,ffalse),ttrue) -> ffalse app(app(and,ttrue),ffalse) -> ffalse app(app(and,ttrue),ttrue) -> ttrue 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,ffalse),ttrue) -> ttrue app(app(or,ttrue),ffalse) -> ttrue app(app(or,ttrue),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),ffalse) -> ffalse app(app(and,ffalse),ttrue) -> ffalse app(app(and,ttrue),ffalse) -> ffalse app(app(and,ttrue),ttrue) -> ttrue 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,ffalse),ttrue) -> ttrue app(app(or,ttrue),ffalse) -> ttrue app(app(or,ttrue),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)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard