Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733248
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts-noand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.710618019104 seconds
cpu usage
0.540359629
max memory
4689920.0
stage attributes
key
value
output-size
1912
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 L N) (STRATEGY CONTEXTSENSITIVE (U11 1) (U12 1) (length 1) (zeros) (0) (cons 1) (nil) (s 1) (tt) ) (RULES U11(tt,L) -> U12(tt,L) U12(tt,L) -> s(length(L)) length(cons(N,L)) -> U11(tt,L) length(nil) -> 0 zeros -> cons(0,zeros) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,L) -> U12#(tt,L) U12#(tt,L) -> LENGTH(L) U12#(tt,L) -> L LENGTH(cons(N,L)) -> U11#(tt,L) -> Rules: U11(tt,L) -> U12(tt,L) U12(tt,L) -> s(length(L)) length(cons(N,L)) -> U11(tt,L) length(nil) -> 0 zeros -> cons(0,zeros) -> Unhiding Rules: zeros -> ZEROS Problem 1: SCC Processor: -> Pairs: U11#(tt,L) -> U12#(tt,L) U12#(tt,L) -> LENGTH(L) U12#(tt,L) -> L LENGTH(cons(N,L)) -> U11#(tt,L) -> Rules: U11(tt,L) -> U12(tt,L) U12(tt,L) -> s(length(L)) length(cons(N,L)) -> U11(tt,L) length(nil) -> 0 zeros -> cons(0,zeros) -> Unhiding rules: zeros -> ZEROS ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U11#(tt,L) -> U12#(tt,L) U12#(tt,L) -> LENGTH(L) LENGTH(cons(N,L)) -> U11#(tt,L) ->->-> Rules: U11(tt,L) -> U12(tt,L) U12(tt,L) -> s(length(L)) length(cons(N,L)) -> U11(tt,L) length(nil) -> 0 zeros -> cons(0,zeros) ->->-> Unhiding rules: Empty Problem 1: Basic Processor: -> Pairs: U11#(tt,L) -> U12#(tt,L) U12#(tt,L) -> LENGTH(L) LENGTH(cons(N,L)) -> U11#(tt,L) -> Rules: U11(tt,L) -> U12(tt,L) U12(tt,L) -> s(length(L)) length(cons(N,L)) -> U11(tt,L) length(nil) -> 0 zeros -> cons(0,zeros) -> Unhiding rules: Empty -> Pairs in cycle: U11#(tt,zeros) -> U12#(tt,zeros) U12#(tt,zeros) -> LENGTH(zeros) LENGTH(zeros) -> LENGTH(cons(0,zeros)) LENGTH(cons(0,zeros)) -> U11#(tt,zeros) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651