details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	18.1344 seconds
cpu usage	67.0801
user time	65.3436
system time	1.7365
max virtual memory	3.8976068E7
max residence set size	3638468.0

stage attributes

key	value
starexec-result	YES

output

60.57/16.48 YES 66.48/17.97 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 66.48/17.97 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 66.48/17.97 66.48/17.97 66.48/17.97 Termination w.r.t. Q of the given QTRS could be proven: 66.48/17.97 66.48/17.97 (0) QTRS 66.48/17.97 (1) DependencyPairsProof [EQUIVALENT, 87 ms] 66.48/17.97 (2) QDP 66.48/17.97 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 66.48/17.97 (4) QDP 66.48/17.97 (5) QDPOrderProof [EQUIVALENT, 252 ms] 66.48/17.97 (6) QDP 66.48/17.97 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 66.48/17.97 (8) AND 66.48/17.97 (9) QDP 66.48/17.97 (10) QDPQMonotonicMRRProof [EQUIVALENT, 71 ms] 66.48/17.97 (11) QDP 66.48/17.97 (12) QDPQMonotonicMRRProof [EQUIVALENT, 38 ms] 66.48/17.97 (13) QDP 66.48/17.97 (14) QDPOrderProof [EQUIVALENT, 91 ms] 66.48/17.97 (15) QDP 66.48/17.97 (16) DependencyGraphProof [EQUIVALENT, 0 ms] 66.48/17.97 (17) TRUE 66.48/17.97 (18) QDP 66.48/17.97 (19) QDPOrderProof [EQUIVALENT, 92 ms] 66.48/17.97 (20) QDP 66.48/17.97 (21) QDPOrderProof [EQUIVALENT, 43 ms] 66.48/17.97 (22) QDP 66.48/17.97 (23) QDPOrderProof [EQUIVALENT, 38 ms] 66.48/17.97 (24) QDP 66.48/17.97 (25) QDPOrderProof [EQUIVALENT, 104 ms] 66.48/17.97 (26) QDP 66.48/17.97 (27) DependencyGraphProof [EQUIVALENT, 0 ms] 66.48/17.97 (28) AND 66.48/17.97 (29) QDP 66.48/17.97 (30) UsableRulesProof [EQUIVALENT, 0 ms] 66.48/17.97 (31) QDP 66.48/17.97 (32) QReductionProof [EQUIVALENT, 0 ms] 66.48/17.97 (33) QDP 66.48/17.97 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 66.48/17.97 (35) YES 66.48/17.97 (36) QDP 66.48/17.97 (37) QDPOrderProof [EQUIVALENT, 91 ms] 66.48/17.97 (38) QDP 66.48/17.97 (39) QDPQMonotonicMRRProof [EQUIVALENT, 103 ms] 66.48/17.97 (40) QDP 66.48/17.97 (41) QDPQMonotonicMRRProof [EQUIVALENT, 118 ms] 66.48/17.97 (42) QDP 66.48/17.97 (43) QDPOrderProof [EQUIVALENT, 297 ms] 66.48/17.97 (44) QDP 66.48/17.97 (45) QDPOrderProof [EQUIVALENT, 87 ms] 66.48/17.97 (46) QDP 66.48/17.97 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 66.48/17.97 (48) QDP 66.48/17.97 (49) QDPQMonotonicMRRProof [EQUIVALENT, 77 ms] 66.48/17.97 (50) QDP 66.48/17.97 (51) UsableRulesProof [EQUIVALENT, 0 ms] 66.48/17.97 (52) QDP 66.48/17.97 (53) QReductionProof [EQUIVALENT, 0 ms] 66.48/17.97 (54) QDP 66.48/17.97 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 66.48/17.97 (56) YES 66.48/17.97 66.48/17.97 66.48/17.97 ---------------------------------------- 66.48/17.97 66.48/17.97 (0) 66.48/17.97 Obligation: 66.48/17.97 Q restricted rewrite system: 66.48/17.97 The TRS R consists of the following rules: 66.48/17.97 66.48/17.97 a__and(tt, T) -> mark(T) 66.48/17.97 a__isNatIList(IL) -> a__isNatList(IL) 66.48/17.97 a__isNat(0) -> tt 66.48/17.97 a__isNat(s(N)) -> a__isNat(N) 66.48/17.97 a__isNat(length(L)) -> a__isNatList(L) 66.48/17.97 a__isNatIList(zeros) -> tt 66.48/17.97 a__isNatIList(cons(N, IL)) -> a__and(a__isNat(N), a__isNatIList(IL)) 66.48/17.97 a__isNatList(nil) -> tt 66.48/17.97 a__isNatList(cons(N, L)) -> a__and(a__isNat(N), a__isNatList(L)) 66.48/17.97 a__isNatList(take(N, IL)) -> a__and(a__isNat(N), a__isNatIList(IL)) 66.48/17.97 a__zeros -> cons(0, zeros) 66.48/17.97 a__take(0, IL) -> a__uTake1(a__isNatIList(IL)) 66.48/17.97 a__uTake1(tt) -> nil 66.48/17.97 a__take(s(M), cons(N, IL)) -> a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL) 66.48/17.97 a__uTake2(tt, M, N, IL) -> cons(mark(N), take(M, IL)) 66.48/17.97 a__length(cons(N, L)) -> a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) 66.48/17.97 a__uLength(tt, L) -> s(a__length(mark(L))) 66.48/17.97 mark(and(X1, X2)) -> a__and(mark(X1), mark(X2)) 66.48/17.97 mark(isNatIList(X)) -> a__isNatIList(X) 66.48/17.97 mark(isNatList(X)) -> a__isNatList(X) 66.48/17.97 mark(isNat(X)) -> a__isNat(X) 66.48/17.97 mark(length(X)) -> a__length(mark(X)) 66.48/17.97 mark(zeros) -> a__zeros 66.48/17.97 mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) 66.48/17.97 mark(uTake1(X)) -> a__uTake1(mark(X)) 66.48/17.97 mark(uTake2(X1, X2, X3, X4)) -> a__uTake2(mark(X1), X2, X3, X4) 66.48/17.97 mark(uLength(X1, X2)) -> a__uLength(mark(X1), X2) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12