details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.214 seconds
cpu usage	9.01605
user time	8.59684
system time	0.419206
max virtual memory	1.8479572E7
max residence set size	674948.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 133 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 59 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 41 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 43 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 34 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 38 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 18 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 29 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 0 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 0 ms] (20) QTRS (21) QTRSRRRProof [EQUIVALENT, 2 ms] (22) QTRS (23) RisEmptyProof [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__zeros -> cons(0, zeros) a__U11(tt) -> tt a__U21(tt) -> tt a__U31(tt) -> tt a__U41(tt, V2) -> a__U42(a__isNatIList(V2)) a__U42(tt) -> tt a__U51(tt, V2) -> a__U52(a__isNatList(V2)) a__U52(tt) -> tt a__U61(tt, L, N) -> a__U62(a__isNat(N), L) a__U62(tt, L) -> s(a__length(mark(L))) a__isNat(0) -> tt a__isNat(length(V1)) -> a__U11(a__isNatList(V1)) a__isNat(s(V1)) -> a__U21(a__isNat(V1)) a__isNatIList(V) -> a__U31(a__isNatList(V)) a__isNatIList(zeros) -> tt a__isNatIList(cons(V1, V2)) -> a__U41(a__isNat(V1), V2) a__isNatList(nil) -> tt a__isNatList(cons(V1, V2)) -> a__U51(a__isNat(V1), V2) a__length(nil) -> 0 a__length(cons(N, L)) -> a__U61(a__isNatList(L), L, N) mark(zeros) -> a__zeros mark(U11(X)) -> a__U11(mark(X)) mark(U21(X)) -> a__U21(mark(X)) mark(U31(X)) -> a__U31(mark(X)) mark(U41(X1, X2)) -> a__U41(mark(X1), X2) mark(U42(X)) -> a__U42(mark(X)) mark(isNatIList(X)) -> a__isNatIList(X) mark(U51(X1, X2)) -> a__U51(mark(X1), X2) mark(U52(X)) -> a__U52(mark(X)) mark(isNatList(X)) -> a__isNatList(X) mark(U61(X1, X2, X3)) -> a__U61(mark(X1), X2, X3) mark(U62(X1, X2)) -> a__U62(mark(X1), X2) mark(isNat(X)) -> a__isNat(X) mark(length(X)) -> a__length(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(tt) -> tt mark(s(X)) -> s(mark(X)) mark(nil) -> nil a__zeros -> zeros a__U11(X) -> U11(X) a__U21(X) -> U21(X) a__U31(X) -> U31(X) a__U41(X1, X2) -> U41(X1, X2) a__U42(X) -> U42(X) a__isNatIList(X) -> isNatIList(X) a__U51(X1, X2) -> U51(X1, X2) a__U52(X) -> U52(X) a__isNatList(X) -> isNatList(X) a__U61(X1, X2, X3) -> U61(X1, X2, X3) a__U62(X1, X2) -> U62(X1, X2) a__isNat(X) -> isNat(X) a__length(X) -> length(X) The set Q consists of the following terms: a__zeros a__isNatIList(x0) mark(zeros) popout

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

job log

popout

actions

all output return to TRS Innermost