Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714329
details
property
value
status
complete
benchmark
4.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0179059505463 seconds
cpu usage
0.014431055
max memory
1642496.0
stage attributes
key
value
output-size
3475
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 x y) (RULES int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(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: INT(0,s(y)) -> INT(s(0),s(y)) INT(s(x),s(y)) -> INT(x,y) INT(s(x),s(y)) -> INT_LIST(int(x,y)) INT_LIST(.(x,y)) -> INT_LIST(y) -> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(nil) -> nil Problem 1: SCC Processor: -> Pairs: INT(0,s(y)) -> INT(s(0),s(y)) INT(s(x),s(y)) -> INT(x,y) INT(s(x),s(y)) -> INT_LIST(int(x,y)) INT_LIST(.(x,y)) -> INT_LIST(y) -> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: INT_LIST(.(x,y)) -> INT_LIST(y) ->->-> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(nil) -> nil ->->Cycle: ->->-> Pairs: INT(0,s(y)) -> INT(s(0),s(y)) INT(s(x),s(y)) -> INT(x,y) ->->-> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y)) int_list(.(x,y)) -> .(s(x),int_list(y)) int_list(nil) -> nil The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: INT_LIST(.(x,y)) -> INT_LIST(y) -> Rules: int(0,0) -> .(0,nil) int(0,s(y)) -> .(0,int(s(0),s(y))) int(s(x),0) -> nil int(s(x),s(y)) -> int_list(int(x,y))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472