Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712282
details
property
value
status
complete
benchmark
006.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0209219455719 seconds
cpu usage
0.01750809
max memory
1732608.0
stage attributes
key
value
output-size
4903
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 f l r x) (RULES app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) -> 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(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(branch,app(f,x)),app(app(mapbt,f),l)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(branch,app(f,x)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(f,x) APP(app(mapbt,f),app(leaf,x)) -> APP(leaf,app(f,x)) APP(app(mapbt,f),app(leaf,x)) -> APP(f,x) -> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) Problem 1: SCC Processor: -> Pairs: APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(branch,app(f,x)),app(app(mapbt,f),l)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(branch,app(f,x)) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(f,x) APP(app(mapbt,f),app(leaf,x)) -> APP(leaf,app(f,x)) APP(app(mapbt,f),app(leaf,x)) -> APP(f,x) -> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(f,x) APP(app(mapbt,f),app(leaf,x)) -> APP(f,x) ->->-> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) Problem 1: Subterm Processor: -> Pairs: APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(f,x) APP(app(mapbt,f),app(leaf,x)) -> APP(f,x) -> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) ->Projection: pi(APP) = 1 Problem 1: SCC Processor: -> Pairs: APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) -> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),l) APP(app(mapbt,f),app(app(app(branch,x),l),r)) -> APP(app(mapbt,f),r) ->->-> Rules: app(app(mapbt,f),app(app(app(branch,x),l),r)) -> app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) app(app(mapbt,f),app(leaf,x)) -> app(leaf,app(f,x)) Problem 1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472