Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733336
details
property
value
status
complete
benchmark
emmes.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.39120101929 seconds
cpu usage
1.253157338
max memory
1.7539072E7
stage attributes
key
value
output-size
4041
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) (STRATEGY CONTEXTSENSITIVE (if 1) (isZero 1) (p 1) (plus 1 2) (0) (false) (s 1) (true) ) (RULES if(false,x,y) -> y if(true,x,y) -> x isZero(0) -> true isZero(s(x)) -> false p(s(x)) -> x plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) ) Problem 1: Innermost Equivalent Processor: -> Rules: if(false,x,y) -> y if(true,x,y) -> x isZero(0) -> true isZero(s(x)) -> false p(s(x)) -> x plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: IF(false,x,y) -> y IF(true,x,y) -> x PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) PLUS(x,y) -> ISZERO(x) -> Rules: if(false,x,y) -> y if(true,x,y) -> x isZero(0) -> true isZero(s(x)) -> false p(s(x)) -> x plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) -> Unhiding Rules: s(plus(p(x),y)) -> P(x) s(plus(p(x),y)) -> PLUS(p(x),y) Problem 1: SCC Processor: -> Pairs: IF(false,x,y) -> y IF(true,x,y) -> x PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) PLUS(x,y) -> ISZERO(x) -> Rules: if(false,x,y) -> y if(true,x,y) -> x isZero(0) -> true isZero(s(x)) -> false p(s(x)) -> x plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) -> Unhiding rules: s(plus(p(x),y)) -> P(x) s(plus(p(x),y)) -> PLUS(p(x),y) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: IF(false,x,y) -> y IF(true,x,y) -> x PLUS(x,y) -> IF(isZero(x),y,s(plus(p(x),y))) ->->-> Rules: if(false,x,y) -> y if(true,x,y) -> x isZero(0) -> true isZero(s(x)) -> false p(s(x)) -> x plus(x,y) -> if(isZero(x),y,s(plus(p(x),y))) ->->-> Unhiding rules: s(plus(p(x),y)) -> PLUS(p(x),y) Problem 1: Reduction Pairs Processor: -> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651