Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713695
details
property
value
status
complete
benchmark
Ex4_7_37_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Strategy_removed_CSR_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
1.47176098824 seconds
cpu usage
1.304655355
max memory
1.5552512E7
stage attributes
key
value
output-size
1906
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR N X XS Y YS) (RULES from(X) -> cons(X,from(s(X))) minus(s(X),s(Y)) -> minus(X,Y) minus(X,0) -> 0 quot(0,s(Y)) -> 0 quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),zWquot(XS,YS)) zWquot(nil,XS) -> nil zWquot(XS,nil) -> nil ) Problem 1: Dependency Pairs Processor: -> Pairs: FROM(X) -> FROM(s(X)) MINUS(s(X),s(Y)) -> MINUS(X,Y) QUOT(s(X),s(Y)) -> MINUS(X,Y) QUOT(s(X),s(Y)) -> QUOT(minus(X,Y),s(Y)) SEL(s(N),cons(X,XS)) -> SEL(N,XS) ZWQUOT(cons(X,XS),cons(Y,YS)) -> QUOT(X,Y) ZWQUOT(cons(X,XS),cons(Y,YS)) -> ZWQUOT(XS,YS) -> Rules: from(X) -> cons(X,from(s(X))) minus(s(X),s(Y)) -> minus(X,Y) minus(X,0) -> 0 quot(0,s(Y)) -> 0 quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),zWquot(XS,YS)) zWquot(nil,XS) -> nil zWquot(XS,nil) -> nil Problem 1: Infinite Processor: -> Pairs: FROM(X) -> FROM(s(X)) MINUS(s(X),s(Y)) -> MINUS(X,Y) QUOT(s(X),s(Y)) -> MINUS(X,Y) QUOT(s(X),s(Y)) -> QUOT(minus(X,Y),s(Y)) SEL(s(N),cons(X,XS)) -> SEL(N,XS) ZWQUOT(cons(X,XS),cons(Y,YS)) -> QUOT(X,Y) ZWQUOT(cons(X,XS),cons(Y,YS)) -> ZWQUOT(XS,YS) -> Rules: from(X) -> cons(X,from(s(X))) minus(s(X),s(Y)) -> minus(X,Y) minus(X,0) -> 0 quot(0,s(Y)) -> 0 quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y))) sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),zWquot(XS,YS)) zWquot(nil,XS) -> nil zWquot(XS,nil) -> nil -> Pairs in cycle: FROM(X) -> FROM(s(X)) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472