Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965046
details
property
value
status
complete
benchmark
016.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n135.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.092465877533 seconds
cpu usage
0.026694562
max memory
2207744.0
stage attributes
key
value
output-size
9017
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 f:S x:S y:S ys:S) (RULES app(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> app(app(filter,f:S),ys:S) app(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> app(app(cons,y:S),app(app(filter,f:S),ys:S)) app(app(filter,f:S),app(app(cons,y:S),ys:S)) -> app(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) app(app(filter,f:S),nil) -> nil app(app(neq,app(s,x:S)),app(s,y:S)) -> app(app(neq,x:S),y:S) app(app(neq,app(s,x:S)),0) -> ttrue app(app(neq,0),app(s,y:S)) -> ttrue app(app(neq,0),0) -> ffalse nonzero -> app(filter,app(neq,0)) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> app(app(filter,f:S),ys:S) app(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> app(app(cons,y:S),app(app(filter,f:S),ys:S)) app(app(filter,f:S),app(app(cons,y:S),ys:S)) -> app(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) app(app(filter,f:S),nil) -> nil app(app(neq,app(s,x:S)),app(s,y:S)) -> app(app(neq,x:S),y:S) app(app(neq,app(s,x:S)),0) -> ttrue app(app(neq,0),app(s,y:S)) -> ttrue app(app(neq,0),0) -> ffalse nonzero -> app(filter,app(neq,0)) -> 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(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> APP(app(filter,f:S),ys:S) APP(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> APP(app(cons,y:S),app(app(filter,f:S),ys:S)) APP(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> APP(app(filter,f:S),ys:S) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(app(filtersub,app(f:S,y:S)),f:S) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(filtersub,app(f:S,y:S)) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(f:S,y:S) APP(app(neq,app(s,x:S)),app(s,y:S)) -> APP(app(neq,x:S),y:S) -> Rules: app(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> app(app(filter,f:S),ys:S) app(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> app(app(cons,y:S),app(app(filter,f:S),ys:S)) app(app(filter,f:S),app(app(cons,y:S),ys:S)) -> app(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) app(app(filter,f:S),nil) -> nil app(app(neq,app(s,x:S)),app(s,y:S)) -> app(app(neq,x:S),y:S) app(app(neq,app(s,x:S)),0) -> ttrue app(app(neq,0),app(s,y:S)) -> ttrue app(app(neq,0),0) -> ffalse nonzero -> app(filter,app(neq,0)) Problem 1: SCC Processor: -> Pairs: APP(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> APP(app(filter,f:S),ys:S) APP(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> APP(app(cons,y:S),app(app(filter,f:S),ys:S)) APP(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> APP(app(filter,f:S),ys:S) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(app(filtersub,app(f:S,y:S)),f:S) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(filtersub,app(f:S,y:S)) APP(app(filter,f:S),app(app(cons,y:S),ys:S)) -> APP(f:S,y:S) APP(app(neq,app(s,x:S)),app(s,y:S)) -> APP(app(neq,x:S),y:S) -> Rules: app(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> app(app(filter,f:S),ys:S) app(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> app(app(cons,y:S),app(app(filter,f:S),ys:S)) app(app(filter,f:S),app(app(cons,y:S),ys:S)) -> app(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) app(app(filter,f:S),nil) -> nil app(app(neq,app(s,x:S)),app(s,y:S)) -> app(app(neq,x:S),y:S) app(app(neq,app(s,x:S)),0) -> ttrue app(app(neq,0),app(s,y:S)) -> ttrue app(app(neq,0),0) -> ffalse nonzero -> app(filter,app(neq,0)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(neq,app(s,x:S)),app(s,y:S)) -> APP(app(neq,x:S),y:S) ->->-> Rules: app(app(app(filtersub,ffalse),f:S),app(app(cons,y:S),ys:S)) -> app(app(filter,f:S),ys:S) app(app(app(filtersub,ttrue),f:S),app(app(cons,y:S),ys:S)) -> app(app(cons,y:S),app(app(filter,f:S),ys:S)) app(app(filter,f:S),app(app(cons,y:S),ys:S)) -> app(app(app(filtersub,app(f:S,y:S)),f:S),app(app(cons,y:S),ys:S)) app(app(filter,f:S),nil) -> nil app(app(neq,app(s,x:S)),app(s,y:S)) -> app(app(neq,x:S),y:S) app(app(neq,app(s,x:S)),0) -> ttrue app(app(neq,0),app(s,y:S)) -> ttrue app(app(neq,0),0) -> ffalse nonzero -> app(filter,app(neq,0)) ->->Cycle: ->->-> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard