details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.1086 seconds
cpu usage	22.0075
user time	21.0241
system time	0.983419
max virtual memory	3.776732E7
max residence set size	2202164.0

stage attributes

key	value
starexec-result	YES

output

21.84/11.02 YES 21.84/11.03 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 21.84/11.03 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.84/11.03 21.84/11.03 21.84/11.03 Termination w.r.t. Q of the given QTRS could be proven: 21.84/11.03 21.84/11.03 (0) QTRS 21.84/11.03 (1) DependencyPairsProof [EQUIVALENT, 0 ms] 21.84/11.03 (2) QDP 21.84/11.03 (3) QDPOrderProof [EQUIVALENT, 88 ms] 21.84/11.03 (4) QDP 21.84/11.03 (5) QDPOrderProof [EQUIVALENT, 46 ms] 21.84/11.03 (6) QDP 21.84/11.03 (7) QDPOrderProof [EQUIVALENT, 41 ms] 21.84/11.03 (8) QDP 21.84/11.03 (9) QDPOrderProof [EQUIVALENT, 20 ms] 21.84/11.03 (10) QDP 21.84/11.03 (11) QDPOrderProof [EQUIVALENT, 70 ms] 21.84/11.03 (12) QDP 21.84/11.03 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 21.84/11.03 (14) AND 21.84/11.03 (15) QDP 21.84/11.03 (16) QDPOrderProof [EQUIVALENT, 1381 ms] 21.84/11.03 (17) QDP 21.84/11.03 (18) PisEmptyProof [EQUIVALENT, 0 ms] 21.84/11.03 (19) YES 21.84/11.03 (20) QDP 21.84/11.03 (21) QDPOrderProof [EQUIVALENT, 25 ms] 21.84/11.03 (22) QDP 21.84/11.03 (23) QDPOrderProof [EQUIVALENT, 25 ms] 21.84/11.03 (24) QDP 21.84/11.03 (25) DependencyGraphProof [EQUIVALENT, 0 ms] 21.84/11.03 (26) QDP 21.84/11.03 (27) UsableRulesProof [EQUIVALENT, 0 ms] 21.84/11.03 (28) QDP 21.84/11.03 (29) QReductionProof [EQUIVALENT, 0 ms] 21.84/11.03 (30) QDP 21.84/11.03 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 21.84/11.03 (32) YES 21.84/11.03 21.84/11.03 21.84/11.03 ---------------------------------------- 21.84/11.03 21.84/11.03 (0) 21.84/11.03 Obligation: 21.84/11.03 Q restricted rewrite system: 21.84/11.03 The TRS R consists of the following rules: 21.84/11.03 21.84/11.03 a__from(X) -> cons(mark(X), from(s(X))) 21.84/11.03 a__after(0, XS) -> mark(XS) 21.84/11.03 a__after(s(N), cons(X, XS)) -> a__after(mark(N), mark(XS)) 21.84/11.03 mark(from(X)) -> a__from(mark(X)) 21.84/11.03 mark(after(X1, X2)) -> a__after(mark(X1), mark(X2)) 21.84/11.03 mark(cons(X1, X2)) -> cons(mark(X1), X2) 21.84/11.03 mark(s(X)) -> s(mark(X)) 21.84/11.03 mark(0) -> 0 21.84/11.03 a__from(X) -> from(X) 21.84/11.03 a__after(X1, X2) -> after(X1, X2) 21.84/11.03 21.84/11.03 The set Q consists of the following terms: 21.84/11.03 21.84/11.03 a__from(x0) 21.84/11.03 mark(from(x0)) 21.84/11.03 mark(after(x0, x1)) 21.84/11.03 mark(cons(x0, x1)) 21.84/11.03 mark(s(x0)) 21.84/11.03 mark(0) 21.84/11.03 a__after(x0, x1) 21.84/11.03 21.84/11.03 21.84/11.03 ---------------------------------------- 21.84/11.03 21.84/11.03 (1) DependencyPairsProof (EQUIVALENT) 21.84/11.03 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 21.84/11.03 ---------------------------------------- 21.84/11.03 21.84/11.03 (2) 21.84/11.03 Obligation: 21.84/11.03 Q DP problem: 21.84/11.03 The TRS P consists of the following rules: 21.84/11.03 21.84/11.03 A__FROM(X) -> MARK(X) 21.84/11.03 A__AFTER(0, XS) -> MARK(XS) 21.84/11.03 A__AFTER(s(N), cons(X, XS)) -> A__AFTER(mark(N), mark(XS)) 21.84/11.03 A__AFTER(s(N), cons(X, XS)) -> MARK(N) 21.84/11.03 A__AFTER(s(N), cons(X, XS)) -> MARK(XS) 21.84/11.03 MARK(from(X)) -> A__FROM(mark(X)) 21.84/11.03 MARK(from(X)) -> MARK(X) 21.84/11.03 MARK(after(X1, X2)) -> A__AFTER(mark(X1), mark(X2)) 21.84/11.03 MARK(after(X1, X2)) -> MARK(X1) 21.84/11.03 MARK(after(X1, X2)) -> MARK(X2) 21.84/11.03 MARK(cons(X1, X2)) -> MARK(X1) 21.84/11.03 MARK(s(X)) -> MARK(X) 21.84/11.03 21.84/11.03 The TRS R consists of the following rules: 21.84/11.03 21.84/11.03 a__from(X) -> cons(mark(X), from(s(X))) 21.84/11.03 a__after(0, XS) -> mark(XS) 21.84/11.03 a__after(s(N), cons(X, XS)) -> a__after(mark(N), mark(XS)) 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