Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733222
details
property
value
status
complete
benchmark
Ex8_BLR02.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n098.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0199139118195 seconds
cpu usage
0.016537579
max memory
1732608.0
stage attributes
key
value
output-size
3717
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X XS Y) (STRATEGY CONTEXTSENSITIVE (add 1 2) (fib 1) (fib1 1 2) (sel 1 2) (0) (cons 1) (s 1) ) (RULES add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fib(N) -> sel(N,fib1(s(0),s(0))) fib1(X,Y) -> cons(X,fib1(Y,add(X,Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) ) Problem 1: Innermost Equivalent Processor: -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fib(N) -> sel(N,fib1(s(0),s(0))) fib1(X,Y) -> cons(X,fib1(Y,add(X,Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) FIB(N) -> FIB1(s(0),s(0)) FIB(N) -> SEL(N,fib1(s(0),s(0))) SEL(s(N),cons(X,XS)) -> SEL(N,XS) SEL(s(N),cons(X,XS)) -> XS -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fib(N) -> sel(N,fib1(s(0),s(0))) fib1(X,Y) -> cons(X,fib1(Y,add(X,Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) -> Unhiding Rules: fib1(Y,add(X,Y)) -> ADD(X,Y) fib1(Y,add(X,Y)) -> FIB1(Y,add(X,Y)) Problem 1: SCC Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) FIB(N) -> FIB1(s(0),s(0)) FIB(N) -> SEL(N,fib1(s(0),s(0))) SEL(s(N),cons(X,XS)) -> SEL(N,XS) SEL(s(N),cons(X,XS)) -> XS -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fib(N) -> sel(N,fib1(s(0),s(0))) fib1(X,Y) -> cons(X,fib1(Y,add(X,Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) -> Unhiding rules: fib1(Y,add(X,Y)) -> ADD(X,Y) fib1(Y,add(X,Y)) -> FIB1(Y,add(X,Y)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ADD(s(X),Y) -> ADD(X,Y) ->->-> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) fib(N) -> sel(N,fib1(s(0),s(0))) fib1(X,Y) -> cons(X,fib1(Y,add(X,Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) ->->-> Unhiding rules: Empty ->->Cycle: ->->-> Pairs: SEL(s(N),cons(X,XS)) -> SEL(N,XS) ->->-> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651