details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.57467 seconds
cpu usage	33.6733
user time	32.2484
system time	1.42486
max virtual memory	8.3688632E7
max residence set size	4017012.0

stage attributes

key	value
starexec-result	YES

output

31.69/8.98 YES 33.19/9.36 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 33.19/9.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.19/9.36 33.19/9.36 33.19/9.36 Termination w.r.t. Q of the given QTRS could be proven: 33.19/9.36 33.19/9.36 (0) QTRS 33.19/9.36 (1) QTRSRRRProof [EQUIVALENT, 52 ms] 33.19/9.36 (2) QTRS 33.19/9.36 (3) QTRSRRRProof [EQUIVALENT, 2 ms] 33.19/9.36 (4) QTRS 33.19/9.36 (5) QTRSRRRProof [EQUIVALENT, 2 ms] 33.19/9.36 (6) QTRS 33.19/9.36 (7) DependencyPairsProof [EQUIVALENT, 21 ms] 33.19/9.36 (8) QDP 33.19/9.36 (9) QDPOrderProof [EQUIVALENT, 139 ms] 33.19/9.36 (10) QDP 33.19/9.36 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 33.19/9.36 (12) AND 33.19/9.36 (13) QDP 33.19/9.36 (14) QDPOrderProof [EQUIVALENT, 0 ms] 33.19/9.36 (15) QDP 33.19/9.36 (16) DependencyGraphProof [EQUIVALENT, 0 ms] 33.19/9.36 (17) TRUE 33.19/9.36 (18) QDP 33.19/9.36 (19) MRRProof [EQUIVALENT, 0 ms] 33.19/9.36 (20) QDP 33.19/9.36 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 33.19/9.36 (22) TRUE 33.19/9.36 33.19/9.36 33.19/9.36 ---------------------------------------- 33.19/9.36 33.19/9.36 (0) 33.19/9.36 Obligation: 33.19/9.36 Q restricted rewrite system: 33.19/9.36 The TRS R consists of the following rules: 33.19/9.36 33.19/9.36 a(b(c(x1))) -> c(b(a(x1))) 33.19/9.36 C(B(A(x1))) -> A(B(C(x1))) 33.19/9.36 b(a(C(x1))) -> C(a(b(x1))) 33.19/9.36 c(A(B(x1))) -> B(A(c(x1))) 33.19/9.36 A(c(b(x1))) -> b(c(A(x1))) 33.19/9.36 B(C(a(x1))) -> a(C(B(x1))) 33.19/9.36 a(A(x1)) -> x1 33.19/9.36 A(a(x1)) -> x1 33.19/9.36 b(B(x1)) -> x1 33.19/9.36 B(b(x1)) -> x1 33.19/9.36 c(C(x1)) -> x1 33.19/9.36 C(c(x1)) -> x1 33.19/9.36 33.19/9.36 Q is empty. 33.19/9.36 33.19/9.36 ---------------------------------------- 33.19/9.36 33.19/9.36 (1) QTRSRRRProof (EQUIVALENT) 33.19/9.36 Used ordering: 33.19/9.36 Polynomial interpretation [POLO]: 33.19/9.36 33.19/9.36 POL(A(x_1)) = 1 + x_1 33.19/9.36 POL(B(x_1)) = x_1 33.19/9.36 POL(C(x_1)) = x_1 33.19/9.36 POL(a(x_1)) = x_1 33.19/9.36 POL(b(x_1)) = x_1 33.19/9.36 POL(c(x_1)) = x_1 33.19/9.36 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 33.19/9.36 33.19/9.36 a(A(x1)) -> x1 33.19/9.36 A(a(x1)) -> x1 33.19/9.36 33.19/9.36 33.19/9.36 33.19/9.36 33.19/9.36 ---------------------------------------- 33.19/9.36 33.19/9.36 (2) 33.19/9.36 Obligation: 33.19/9.36 Q restricted rewrite system: 33.19/9.36 The TRS R consists of the following rules: 33.19/9.36 33.19/9.36 a(b(c(x1))) -> c(b(a(x1))) 33.19/9.36 C(B(A(x1))) -> A(B(C(x1))) 33.19/9.36 b(a(C(x1))) -> C(a(b(x1))) 33.19/9.36 c(A(B(x1))) -> B(A(c(x1))) 33.19/9.36 A(c(b(x1))) -> b(c(A(x1))) 33.19/9.36 B(C(a(x1))) -> a(C(B(x1))) 33.19/9.36 b(B(x1)) -> x1 33.19/9.36 B(b(x1)) -> x1 33.19/9.36 c(C(x1)) -> x1 33.19/9.36 C(c(x1)) -> x1 33.19/9.36 33.19/9.36 Q is empty. 33.19/9.36 33.19/9.36 ---------------------------------------- 33.19/9.36 33.19/9.36 (3) QTRSRRRProof (EQUIVALENT) 33.19/9.36 Used ordering: 33.19/9.36 Polynomial interpretation [POLO]: 33.19/9.36 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