Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714569
details
property
value
status
complete
benchmark
4.31.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0404710769653 seconds
cpu usage
0.034310508
max memory
3846144.0
stage attributes
key
value
output-size
3323
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 z) (RULES purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,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: PURGE(.(x,y)) -> PURGE(remove(x,y)) PURGE(.(x,y)) -> REMOVE(x,y) REMOVE(x,.(y,z)) -> REMOVE(x,z) -> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil Problem 1: SCC Processor: -> Pairs: PURGE(.(x,y)) -> PURGE(remove(x,y)) PURGE(.(x,y)) -> REMOVE(x,y) REMOVE(x,.(y,z)) -> REMOVE(x,z) -> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: REMOVE(x,.(y,z)) -> REMOVE(x,z) ->->-> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil ->->Cycle: ->->-> Pairs: PURGE(.(x,y)) -> PURGE(remove(x,y)) ->->-> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: REMOVE(x,.(y,z)) -> REMOVE(x,z) -> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil ->Projection: pi(REMOVE) = 2 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: purge(.(x,y)) -> .(x,purge(remove(x,y))) purge(nil) -> nil remove(x,.(y,z)) -> if(=(x,y),remove(x,z),.(y,remove(x,z))) remove(x,nil) -> nil ->Strongly Connected Components: There is no strongly connected component
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472