details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.39596 seconds
cpu usage	6.48966
user time	6.19816
system time	0.291506
max virtual memory	1.8475452E7
max residence set size	543068.0

stage attributes

key	value
starexec-result	YES

output

6.30/2.33 YES 6.30/2.34 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 6.30/2.34 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.30/2.34 6.30/2.34 6.30/2.34 Termination of the given CSR could be proven: 6.30/2.34 6.30/2.34 (0) CSR 6.30/2.34 (1) CSRRRRProof [EQUIVALENT, 99 ms] 6.30/2.34 (2) CSR 6.30/2.34 (3) CSRRRRProof [EQUIVALENT, 26 ms] 6.30/2.34 (4) CSR 6.30/2.34 (5) CSRRRRProof [EQUIVALENT, 0 ms] 6.30/2.34 (6) CSR 6.30/2.34 (7) CSDependencyPairsProof [EQUIVALENT, 0 ms] 6.30/2.34 (8) QCSDP 6.30/2.34 (9) QCSDependencyGraphProof [EQUIVALENT, 0 ms] 6.30/2.34 (10) AND 6.30/2.34 (11) QCSDP 6.30/2.34 (12) QCSUsableRulesProof [EQUIVALENT, 0 ms] 6.30/2.34 (13) QCSDP 6.30/2.34 (14) QCSDPMuMonotonicPoloProof [EQUIVALENT, 21 ms] 6.30/2.34 (15) QCSDP 6.30/2.34 (16) QCSDependencyGraphProof [EQUIVALENT, 0 ms] 6.30/2.34 (17) QCSDP 6.30/2.34 (18) QCSDPSubtermProof [EQUIVALENT, 0 ms] 6.30/2.34 (19) QCSDP 6.30/2.34 (20) PIsEmptyProof [EQUIVALENT, 0 ms] 6.30/2.34 (21) YES 6.30/2.34 (22) QCSDP 6.30/2.34 (23) QCSDPSubtermProof [EQUIVALENT, 0 ms] 6.30/2.34 (24) QCSDP 6.30/2.34 (25) QCSDependencyGraphProof [EQUIVALENT, 0 ms] 6.30/2.34 (26) TRUE 6.30/2.34 (27) QCSDP 6.30/2.34 (28) QCSDPReductionPairProof [EQUIVALENT, 20 ms] 6.30/2.34 (29) QCSDP 6.30/2.34 (30) QCSDependencyGraphProof [EQUIVALENT, 0 ms] 6.30/2.34 (31) TRUE 6.30/2.34 6.30/2.34 6.30/2.34 ---------------------------------------- 6.30/2.34 6.30/2.34 (0) 6.30/2.34 Obligation: 6.30/2.34 Context-sensitive rewrite system: 6.30/2.34 The TRS R consists of the following rules: 6.30/2.34 6.30/2.34 zeros -> cons(0, zeros) 6.30/2.34 U11(tt) -> tt 6.30/2.34 U21(tt) -> tt 6.30/2.34 U31(tt) -> tt 6.30/2.34 U41(tt, V2) -> U42(isNatIList(V2)) 6.30/2.34 U42(tt) -> tt 6.30/2.34 U51(tt, V2) -> U52(isNatList(V2)) 6.30/2.34 U52(tt) -> tt 6.30/2.34 U61(tt, V2) -> U62(isNatIList(V2)) 6.30/2.34 U62(tt) -> tt 6.30/2.34 U71(tt, L, N) -> U72(isNat(N), L) 6.30/2.34 U72(tt, L) -> s(length(L)) 6.30/2.34 U81(tt) -> nil 6.30/2.34 U91(tt, IL, M, N) -> U92(isNat(M), IL, M, N) 6.30/2.34 U92(tt, IL, M, N) -> U93(isNat(N), IL, M, N) 6.30/2.34 U93(tt, IL, M, N) -> cons(N, take(M, IL)) 6.30/2.34 isNat(0) -> tt 6.30/2.34 isNat(length(V1)) -> U11(isNatList(V1)) 6.30/2.34 isNat(s(V1)) -> U21(isNat(V1)) 6.30/2.34 isNatIList(V) -> U31(isNatList(V)) 6.30/2.34 isNatIList(zeros) -> tt 6.30/2.34 isNatIList(cons(V1, V2)) -> U41(isNat(V1), V2) 6.30/2.34 isNatList(nil) -> tt 6.30/2.34 isNatList(cons(V1, V2)) -> U51(isNat(V1), V2) 6.30/2.34 isNatList(take(V1, V2)) -> U61(isNat(V1), V2) 6.30/2.35 length(nil) -> 0 6.30/2.35 length(cons(N, L)) -> U71(isNatList(L), L, N) 6.30/2.35 take(0, IL) -> U81(isNatIList(IL)) 6.30/2.35 take(s(M), cons(N, IL)) -> U91(isNatIList(IL), IL, M, N) 6.30/2.35 6.30/2.35 The replacement map contains the following entries: 6.30/2.35 6.30/2.35 zeros: empty set 6.30/2.35 cons: {1} 6.30/2.35 0: empty set 6.30/2.35 U11: {1} 6.30/2.35 tt: empty set 6.30/2.35 U21: {1} 6.30/2.35 U31: {1} 6.30/2.35 U41: {1} 6.30/2.35 U42: {1} 6.30/2.35 isNatIList: empty set 6.30/2.35 U51: {1} 6.30/2.35 U52: {1} 6.30/2.35 isNatList: empty set 6.30/2.35 U61: {1} 6.30/2.35 U62: {1} 6.30/2.35 U71: {1} 6.30/2.35 U72: {1} 6.30/2.35 isNat: empty set 6.30/2.35 s: {1} 6.30/2.35 length: {1} popout

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

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07