details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	13.5625 seconds
cpu usage	49.3355
user time	47.5372
system time	1.79835
max virtual memory	8.3717864E7
max residence set size	4718928.0

stage attributes

key	value
starexec-result	YES

output

47.10/12.98 YES 49.08/13.45 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 49.08/13.45 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 49.08/13.45 49.08/13.45 49.08/13.45 Termination w.r.t. Q of the given QTRS could be proven: 49.08/13.45 49.08/13.45 (0) QTRS 49.08/13.45 (1) QTRSRRRProof [EQUIVALENT, 38 ms] 49.08/13.45 (2) QTRS 49.08/13.45 (3) QTRSRRRProof [EQUIVALENT, 2 ms] 49.08/13.45 (4) QTRS 49.08/13.45 (5) DependencyPairsProof [EQUIVALENT, 3 ms] 49.08/13.45 (6) QDP 49.08/13.45 (7) QDPOrderProof [EQUIVALENT, 73 ms] 49.08/13.45 (8) QDP 49.08/13.45 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 49.08/13.45 (10) AND 49.08/13.45 (11) QDP 49.08/13.45 (12) UsableRulesProof [EQUIVALENT, 0 ms] 49.08/13.45 (13) QDP 49.08/13.45 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 49.08/13.45 (15) YES 49.08/13.45 (16) QDP 49.08/13.45 (17) MRRProof [EQUIVALENT, 0 ms] 49.08/13.45 (18) QDP 49.08/13.45 (19) MRRProof [EQUIVALENT, 0 ms] 49.08/13.45 (20) QDP 49.08/13.45 (21) MNOCProof [EQUIVALENT, 0 ms] 49.08/13.45 (22) QDP 49.08/13.45 (23) QDPOrderProof [EQUIVALENT, 0 ms] 49.08/13.45 (24) QDP 49.08/13.45 (25) PisEmptyProof [EQUIVALENT, 0 ms] 49.08/13.45 (26) YES 49.08/13.45 49.08/13.45 49.08/13.45 ---------------------------------------- 49.08/13.45 49.08/13.45 (0) 49.08/13.45 Obligation: 49.08/13.45 Q restricted rewrite system: 49.08/13.45 The TRS R consists of the following rules: 49.08/13.45 49.08/13.45 P(x1) -> Q(Q(p(x1))) 49.08/13.45 p(p(x1)) -> q(q(x1)) 49.08/13.45 p(Q(Q(x1))) -> Q(Q(p(x1))) 49.08/13.45 Q(p(q(x1))) -> q(p(Q(x1))) 49.08/13.45 q(q(p(x1))) -> p(q(q(x1))) 49.08/13.45 q(Q(x1)) -> x1 49.08/13.45 Q(q(x1)) -> x1 49.08/13.45 p(P(x1)) -> x1 49.08/13.45 P(p(x1)) -> x1 49.08/13.45 49.08/13.45 Q is empty. 49.08/13.45 49.08/13.45 ---------------------------------------- 49.08/13.45 49.08/13.45 (1) QTRSRRRProof (EQUIVALENT) 49.08/13.45 Used ordering: 49.08/13.45 Polynomial interpretation [POLO]: 49.08/13.45 49.08/13.45 POL(P(x_1)) = 2 + x_1 49.08/13.45 POL(Q(x_1)) = 1 + x_1 49.08/13.45 POL(p(x_1)) = x_1 49.08/13.45 POL(q(x_1)) = x_1 49.08/13.45 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 49.08/13.45 49.08/13.45 q(Q(x1)) -> x1 49.08/13.45 Q(q(x1)) -> x1 49.08/13.45 p(P(x1)) -> x1 49.08/13.45 P(p(x1)) -> x1 49.08/13.45 49.08/13.45 49.08/13.45 49.08/13.45 49.08/13.45 ---------------------------------------- 49.08/13.45 49.08/13.45 (2) 49.08/13.45 Obligation: 49.08/13.45 Q restricted rewrite system: 49.08/13.45 The TRS R consists of the following rules: 49.08/13.45 49.08/13.45 P(x1) -> Q(Q(p(x1))) 49.08/13.45 p(p(x1)) -> q(q(x1)) 49.08/13.45 p(Q(Q(x1))) -> Q(Q(p(x1))) 49.08/13.45 Q(p(q(x1))) -> q(p(Q(x1))) 49.08/13.45 q(q(p(x1))) -> p(q(q(x1))) 49.08/13.45 49.08/13.45 Q is empty. 49.08/13.45 49.08/13.45 ---------------------------------------- 49.08/13.45 49.08/13.45 (3) QTRSRRRProof (EQUIVALENT) 49.08/13.45 Used ordering: 49.08/13.45 Polynomial interpretation [POLO]: 49.08/13.45 49.08/13.45 POL(P(x_1)) = 2 + x_1 49.08/13.45 POL(Q(x_1)) = x_1 49.08/13.45 POL(p(x_1)) = 1 + x_1 49.08/13.45 POL(q(x_1)) = x_1 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