details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.270598173141 seconds
cpu usage	0.272937005
max memory	7708672.0

stage attributes

key	value
output-size	36437
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 L N V V1 V2 X X1 X2) (RULES a__U11(tt,L) -> s(a__length(mark(L))) a__U11(X1,X2) -> U11(X1,X2) a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__isNat(0) -> tt a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNat(X) -> isNat(X) a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatIList(zeros) -> tt a__isNatIList(V) -> a__isNatList(V) a__isNatIList(X) -> isNatIList(X) a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__isNatList(nil) -> tt a__isNatList(X) -> isNatList(X) a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) a__length(nil) -> 0 a__length(X) -> length(X) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(isNatList(X)) -> a__isNatList(X) mark(length(X)) -> a__length(mark(X)) mark(nil) -> nil mark(s(X)) -> s(mark(X)) mark(tt) -> tt mark(zeros) -> a__zeros ) Problem 1: Dependency Pairs Processor: -> Pairs: A__U11(tt,L) -> A__LENGTH(mark(L)) A__U11(tt,L) -> MARK(L) A__AND(tt,X) -> MARK(X) A__ISNAT(length(V1)) -> A__ISNATLIST(V1) A__ISNAT(s(V1)) -> A__ISNAT(V1) A__ISNATILIST(cons(V1,V2)) -> A__AND(a__isNat(V1),isNatIList(V2)) A__ISNATILIST(cons(V1,V2)) -> A__ISNAT(V1) A__ISNATILIST(V) -> A__ISNATLIST(V) A__ISNATLIST(cons(V1,V2)) -> A__AND(a__isNat(V1),isNatList(V2)) A__ISNATLIST(cons(V1,V2)) -> A__ISNAT(V1) A__LENGTH(cons(N,L)) -> A__U11(a__and(a__isNatList(L),isNat(N)),L) A__LENGTH(cons(N,L)) -> A__AND(a__isNatList(L),isNat(N)) A__LENGTH(cons(N,L)) -> A__ISNATLIST(L) MARK(U11(X1,X2)) -> A__U11(mark(X1),X2) MARK(U11(X1,X2)) -> MARK(X1) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(cons(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> A__ISNAT(X) MARK(isNatIList(X)) -> A__ISNATILIST(X) MARK(isNatList(X)) -> A__ISNATLIST(X) MARK(length(X)) -> A__LENGTH(mark(X)) MARK(length(X)) -> MARK(X) MARK(s(X)) -> MARK(X) MARK(zeros) -> A__ZEROS -> Rules: a__U11(tt,L) -> s(a__length(mark(L))) a__U11(X1,X2) -> U11(X1,X2) a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__isNat(0) -> tt a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNat(X) -> isNat(X) a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatIList(zeros) -> tt a__isNatIList(V) -> a__isNatList(V) a__isNatIList(X) -> isNatIList(X) a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__isNatList(nil) -> tt a__isNatList(X) -> isNatList(X) a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) a__length(nil) -> 0 a__length(X) -> length(X) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(mark(X1),X2) popout

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

job log

popout

actions

all output return to TRS Stand 20472