details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.0291 seconds
cpu usage	51.507
user time	49.6556
system time	1.85139
max virtual memory	8.3705488E7
max residence set size	4237412.0

stage attributes

key	value
starexec-result	YES

output

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