details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.5958 seconds
cpu usage	107.966
user time	103.786
system time	4.18026
max virtual memory	8.3755848E7
max residence set size	4610580.0

stage attributes

key	value
starexec-result	YES

output

49.71/13.49 YES 53.74/14.49 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 53.74/14.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 53.74/14.49 53.74/14.49 53.74/14.49 Termination w.r.t. Q of the given QTRS could be proven: 53.74/14.49 53.74/14.49 (0) QTRS 53.74/14.49 (1) QTRSRRRProof [EQUIVALENT, 55 ms] 53.74/14.49 (2) QTRS 53.74/14.49 (3) DependencyPairsProof [EQUIVALENT, 26 ms] 53.74/14.49 (4) QDP 53.74/14.49 (5) DependencyGraphProof [EQUIVALENT, 7 ms] 53.74/14.49 (6) AND 53.74/14.49 (7) QDP 53.74/14.49 (8) UsableRulesProof [EQUIVALENT, 1 ms] 53.74/14.49 (9) QDP 53.74/14.49 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 53.74/14.49 (11) YES 53.74/14.49 (12) QDP 53.74/14.49 (13) UsableRulesProof [EQUIVALENT, 1 ms] 53.74/14.49 (14) QDP 53.74/14.49 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 53.74/14.49 (16) YES 53.74/14.49 (17) QDP 53.74/14.49 (18) UsableRulesProof [EQUIVALENT, 6 ms] 53.74/14.49 (19) QDP 53.74/14.49 (20) MRRProof [EQUIVALENT, 0 ms] 53.74/14.49 (21) QDP 53.74/14.49 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 53.74/14.49 (23) AND 53.74/14.49 (24) QDP 53.74/14.49 (25) UsableRulesProof [EQUIVALENT, 1 ms] 53.74/14.49 (26) QDP 53.74/14.49 (27) MRRProof [EQUIVALENT, 7 ms] 53.74/14.49 (28) QDP 53.74/14.49 (29) MNOCProof [EQUIVALENT, 0 ms] 53.74/14.49 (30) QDP 53.74/14.49 (31) QDPOrderProof [EQUIVALENT, 9 ms] 53.74/14.49 (32) QDP 53.74/14.49 (33) PisEmptyProof [EQUIVALENT, 0 ms] 53.74/14.49 (34) YES 53.74/14.49 (35) QDP 53.74/14.49 (36) QDPOrderProof [EQUIVALENT, 8 ms] 53.74/14.49 (37) QDP 53.74/14.49 (38) QDPOrderProof [EQUIVALENT, 102 ms] 53.74/14.49 (39) QDP 53.74/14.49 (40) PisEmptyProof [EQUIVALENT, 0 ms] 53.74/14.49 (41) YES 53.74/14.49 (42) QDP 53.74/14.49 (43) UsableRulesProof [EQUIVALENT, 4 ms] 53.74/14.49 (44) QDP 53.74/14.49 (45) QDPOrderProof [EQUIVALENT, 54 ms] 53.74/14.49 (46) QDP 53.74/14.49 (47) PisEmptyProof [EQUIVALENT, 0 ms] 53.74/14.49 (48) YES 53.74/14.49 53.74/14.49 53.74/14.49 ---------------------------------------- 53.74/14.49 53.74/14.49 (0) 53.74/14.49 Obligation: 53.74/14.49 Q restricted rewrite system: 53.74/14.49 The TRS R consists of the following rules: 53.74/14.49 53.74/14.49 log(s(x1)) -> s(log(half(s(x1)))) 53.74/14.49 half(0(x1)) -> 0(s(s(half(x1)))) 53.74/14.49 half(s(0(x1))) -> 0(x1) 53.74/14.49 half(s(s(x1))) -> s(half(p(s(s(x1))))) 53.74/14.49 half(half(s(s(s(s(x1)))))) -> s(s(half(half(x1)))) 53.74/14.49 p(s(s(s(x1)))) -> s(p(s(s(x1)))) 53.74/14.49 s(s(p(s(x1)))) -> s(s(x1)) 53.74/14.49 0(x1) -> x1 53.74/14.49 53.74/14.49 Q is empty. 53.74/14.49 53.74/14.49 ---------------------------------------- 53.74/14.49 53.74/14.49 (1) QTRSRRRProof (EQUIVALENT) 53.74/14.49 Used ordering: 53.74/14.49 Polynomial interpretation [POLO]: 53.74/14.49 53.74/14.49 POL(0(x_1)) = 1 + x_1 53.74/14.49 POL(half(x_1)) = x_1 53.74/14.49 POL(log(x_1)) = x_1 53.74/14.49 POL(p(x_1)) = x_1 53.74/14.49 POL(s(x_1)) = x_1 53.74/14.49 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 53.74/14.49 53.74/14.49 0(x1) -> x1 53.74/14.49 53.74/14.49 53.74/14.49 53.74/14.49 53.74/14.49 ---------------------------------------- 53.74/14.49 53.74/14.49 (2) 53.74/14.49 Obligation: 53.74/14.49 Q restricted rewrite system: 53.74/14.49 The TRS R consists of the following rules: 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