details

property	value
status	complete
benchmark	LengthOfFiniteLists_nokinds.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n035.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	4.53333497047 seconds
cpu usage	3.796610782
max memory	1.0756096E7

stage attributes

key	value
output-size	18446
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 L N V V1 V2 X) (STRATEGY CONTEXTSENSITIVE (U11 1) (and 1) (isNat) (isNatIList) (isNatList) (length 1) (zeros) (0) (cons 1) (nil) (s 1) (tt) ) (RULES U11(tt,L) -> s(length(L)) and(tt,X) -> X isNat(length(V1)) -> isNatList(V1) isNat(0) -> tt isNat(s(V1)) -> isNat(V1) isNatIList(zeros) -> tt isNatIList(cons(V1,V2)) -> and(isNat(V1),isNatIList(V2)) isNatIList(V) -> isNatList(V) isNatList(cons(V1,V2)) -> and(isNat(V1),isNatList(V2)) isNatList(nil) -> tt length(cons(N,L)) -> U11(and(isNatList(L),isNat(N)),L) length(nil) -> 0 zeros -> cons(0,zeros) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,L) -> LENGTH(L) U11#(tt,L) -> L AND(tt,X) -> X ISNAT(length(V1)) -> ISNATLIST(V1) ISNAT(s(V1)) -> ISNAT(V1) ISNATILIST(cons(V1,V2)) -> AND(isNat(V1),isNatIList(V2)) ISNATILIST(cons(V1,V2)) -> ISNAT(V1) ISNATILIST(V) -> ISNATLIST(V) ISNATLIST(cons(V1,V2)) -> AND(isNat(V1),isNatList(V2)) ISNATLIST(cons(V1,V2)) -> ISNAT(V1) LENGTH(cons(N,L)) -> U11#(and(isNatList(L),isNat(N)),L) LENGTH(cons(N,L)) -> AND(isNatList(L),isNat(N)) LENGTH(cons(N,L)) -> ISNATLIST(L) -> Rules: U11(tt,L) -> s(length(L)) and(tt,X) -> X isNat(length(V1)) -> isNatList(V1) isNat(0) -> tt isNat(s(V1)) -> isNat(V1) isNatIList(zeros) -> tt isNatIList(cons(V1,V2)) -> and(isNat(V1),isNatIList(V2)) isNatIList(V) -> isNatList(V) isNatList(cons(V1,V2)) -> and(isNat(V1),isNatList(V2)) isNatList(nil) -> tt length(cons(N,L)) -> U11(and(isNatList(L),isNat(N)),L) length(nil) -> 0 zeros -> cons(0,zeros) -> Unhiding Rules: isNat(N) -> ISNAT(N) isNatIList(V2) -> ISNATILIST(V2) isNatList(V2) -> ISNATLIST(V2) zeros -> ZEROS Problem 1: SCC Processor: -> Pairs: U11#(tt,L) -> LENGTH(L) U11#(tt,L) -> L AND(tt,X) -> X ISNAT(length(V1)) -> ISNATLIST(V1) ISNAT(s(V1)) -> ISNAT(V1) ISNATILIST(cons(V1,V2)) -> AND(isNat(V1),isNatIList(V2)) ISNATILIST(cons(V1,V2)) -> ISNAT(V1) ISNATILIST(V) -> ISNATLIST(V) ISNATLIST(cons(V1,V2)) -> AND(isNat(V1),isNatList(V2)) ISNATLIST(cons(V1,V2)) -> ISNAT(V1) LENGTH(cons(N,L)) -> U11#(and(isNatList(L),isNat(N)),L) LENGTH(cons(N,L)) -> AND(isNatList(L),isNat(N)) LENGTH(cons(N,L)) -> ISNATLIST(L) -> Rules: U11(tt,L) -> s(length(L)) and(tt,X) -> X isNat(length(V1)) -> isNatList(V1) isNat(0) -> tt popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Conte Sensi 17651