details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	13.2726 seconds
cpu usage	47.4151
user time	44.7026
system time	2.71247
max virtual memory	4.1642152E7
max residence set size	6039376.0

stage attributes

key	value
starexec-result	YES

output

45.19/12.68 YES 47.21/13.23 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 47.21/13.23 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 47.21/13.23 47.21/13.23 47.21/13.23 Termination w.r.t. Q of the given QTRS could be proven: 47.21/13.23 47.21/13.23 (0) QTRS 47.21/13.23 (1) QTRSRRRProof [EQUIVALENT, 89 ms] 47.21/13.23 (2) QTRS 47.21/13.23 (3) DependencyPairsProof [EQUIVALENT, 65 ms] 47.21/13.23 (4) QDP 47.21/13.23 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 47.21/13.23 (6) AND 47.21/13.23 (7) QDP 47.21/13.23 (8) UsableRulesProof [EQUIVALENT, 0 ms] 47.21/13.23 (9) QDP 47.21/13.23 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 47.21/13.23 (11) YES 47.21/13.23 (12) QDP 47.21/13.23 (13) MNOCProof [EQUIVALENT, 3 ms] 47.21/13.23 (14) QDP 47.21/13.23 (15) UsableRulesProof [EQUIVALENT, 0 ms] 47.21/13.23 (16) QDP 47.21/13.23 (17) QReductionProof [EQUIVALENT, 0 ms] 47.21/13.23 (18) QDP 47.21/13.23 (19) QDPOrderProof [EQUIVALENT, 26 ms] 47.21/13.23 (20) QDP 47.21/13.23 (21) PisEmptyProof [EQUIVALENT, 0 ms] 47.21/13.23 (22) YES 47.21/13.23 (23) QDP 47.21/13.23 (24) MNOCProof [EQUIVALENT, 0 ms] 47.21/13.23 (25) QDP 47.21/13.23 (26) UsableRulesProof [EQUIVALENT, 0 ms] 47.21/13.23 (27) QDP 47.21/13.23 (28) QReductionProof [EQUIVALENT, 0 ms] 47.21/13.23 (29) QDP 47.21/13.23 (30) QDPOrderProof [EQUIVALENT, 102 ms] 47.21/13.23 (31) QDP 47.21/13.23 (32) PisEmptyProof [EQUIVALENT, 0 ms] 47.21/13.23 (33) YES 47.21/13.23 47.21/13.23 47.21/13.23 ---------------------------------------- 47.21/13.23 47.21/13.23 (0) 47.21/13.23 Obligation: 47.21/13.23 Q restricted rewrite system: 47.21/13.23 The TRS R consists of the following rules: 47.21/13.23 47.21/13.23 sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) 47.21/13.23 sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) 47.21/13.23 twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) 47.21/13.23 twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) 47.21/13.23 p(p(s(x1))) -> p(x1) 47.21/13.23 p(s(x1)) -> x1 47.21/13.23 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 47.21/13.23 0(x1) -> x1 47.21/13.23 47.21/13.23 Q is empty. 47.21/13.23 47.21/13.23 ---------------------------------------- 47.21/13.23 47.21/13.23 (1) QTRSRRRProof (EQUIVALENT) 47.21/13.23 Used ordering: 47.21/13.23 Polynomial interpretation [POLO]: 47.21/13.23 47.21/13.23 POL(0(x_1)) = 1 + x_1 47.21/13.23 POL(p(x_1)) = x_1 47.21/13.23 POL(s(x_1)) = x_1 47.21/13.23 POL(sq(x_1)) = 1 + x_1 47.21/13.23 POL(twice(x_1)) = x_1 47.21/13.23 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 47.21/13.23 47.21/13.23 sq(0(x1)) -> p(s(p(s(p(p(p(p(s(s(s(s(0(p(s(p(s(x1))))))))))))))))) 47.21/13.23 0(x1) -> x1 47.21/13.23 47.21/13.23 47.21/13.23 47.21/13.23 47.21/13.23 ---------------------------------------- 47.21/13.23 47.21/13.23 (2) 47.21/13.23 Obligation: 47.21/13.23 Q restricted rewrite system: 47.21/13.23 The TRS R consists of the following rules: 47.21/13.23 47.21/13.23 sq(s(x1)) -> s(p(s(p(s(p(p(s(s(twice(p(s(p(s(p(p(p(s(s(s(sq(p(p(p(p(p(p(s(s(s(s(s(s(x1))))))))))))))))))))))))))))))))) 47.21/13.23 twice(0(x1)) -> p(p(p(p(s(s(p(s(s(s(0(p(p(p(s(s(s(p(p(s(s(p(s(p(s(p(s(x1))))))))))))))))))))))))))) 47.21/13.23 twice(s(x1)) -> p(p(s(s(s(p(p(s(s(s(twice(p(s(p(s(x1))))))))))))))) 47.21/13.23 p(p(s(x1))) -> p(x1) 47.21/13.23 p(s(x1)) -> x1 47.21/13.23 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(s(s(s(x1)))))))))))) 47.21/13.23 47.21/13.23 Q is empty. 47.21/13.23 47.21/13.23 ---------------------------------------- 47.21/13.23 47.21/13.23 (3) DependencyPairsProof (EQUIVALENT) 47.21/13.23 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29