Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713380
details
property
value
status
complete
benchmark
#3.2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0532231330872 seconds
cpu usage
0.029124126
max memory
3596288.0
stage attributes
key
value
output-size
3222
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 minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ) Problem 1: Innermost Equivalent Processor: -> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: MINUS(x,s(y)) -> MINUS(x,y) MINUS(x,s(y)) -> PRED(minus(x,y)) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) -> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) Problem 1: SCC Processor: -> Pairs: MINUS(x,s(y)) -> MINUS(x,y) MINUS(x,s(y)) -> PRED(minus(x,y)) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) -> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(x,s(y)) -> MINUS(x,y) ->->-> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->->Cycle: ->->-> Pairs: QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) ->->-> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: MINUS(x,s(y)) -> MINUS(x,y) -> Rules: minus(x,0) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->Projection: pi(MINUS) = 2 Problem 1.1: SCC Processor:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472