details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.06874 seconds
cpu usage	31.9219
user time	30.8869
system time	1.03497
max virtual memory	2.011006E7
max residence set size	3126220.0

stage attributes

key	value
starexec-result	YES

output

30.60/8.63 YES 31.26/8.80 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 31.26/8.80 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 31.26/8.80 31.26/8.80 31.26/8.80 Termination w.r.t. Q of the given QTRS could be proven: 31.26/8.80 31.26/8.80 (0) QTRS 31.26/8.80 (1) QTRSRRRProof [EQUIVALENT, 129 ms] 31.26/8.80 (2) QTRS 31.26/8.80 (3) Overlay + Local Confluence [EQUIVALENT, 17 ms] 31.26/8.80 (4) QTRS 31.26/8.80 (5) DependencyPairsProof [EQUIVALENT, 22 ms] 31.26/8.80 (6) QDP 31.26/8.80 (7) MRRProof [EQUIVALENT, 76 ms] 31.26/8.80 (8) QDP 31.26/8.80 (9) PisEmptyProof [EQUIVALENT, 0 ms] 31.26/8.80 (10) YES 31.26/8.80 31.26/8.80 31.26/8.80 ---------------------------------------- 31.26/8.80 31.26/8.80 (0) 31.26/8.80 Obligation: 31.26/8.80 Q restricted rewrite system: 31.26/8.80 The TRS R consists of the following rules: 31.26/8.80 31.26/8.80 a(b(x1)) -> C(x1) 31.26/8.80 b(c(x1)) -> A(x1) 31.26/8.80 c(a(x1)) -> B(x1) 31.26/8.80 A(C(x1)) -> b(x1) 31.26/8.80 C(B(x1)) -> a(x1) 31.26/8.80 B(A(x1)) -> c(x1) 31.26/8.80 a(a(a(a(x1)))) -> A(A(A(x1))) 31.26/8.80 A(A(A(A(x1)))) -> a(a(a(x1))) 31.26/8.80 b(b(b(b(x1)))) -> B(B(B(x1))) 31.26/8.80 B(B(B(B(x1)))) -> b(b(b(x1))) 31.26/8.80 c(c(c(c(x1)))) -> C(C(C(x1))) 31.26/8.80 C(C(C(C(x1)))) -> c(c(c(x1))) 31.26/8.80 B(a(a(a(x1)))) -> c(A(A(A(x1)))) 31.26/8.80 A(A(A(b(x1)))) -> a(a(a(C(x1)))) 31.26/8.80 C(b(b(b(x1)))) -> a(B(B(B(x1)))) 31.26/8.80 B(B(B(c(x1)))) -> b(b(b(A(x1)))) 31.26/8.80 A(c(c(c(x1)))) -> b(C(C(C(x1)))) 31.26/8.80 C(C(C(a(x1)))) -> c(c(c(B(x1)))) 31.26/8.80 a(A(x1)) -> x1 31.26/8.80 A(a(x1)) -> x1 31.26/8.80 b(B(x1)) -> x1 31.26/8.80 B(b(x1)) -> x1 31.26/8.80 c(C(x1)) -> x1 31.26/8.80 C(c(x1)) -> x1 31.26/8.80 31.26/8.80 Q is empty. 31.26/8.80 31.26/8.80 ---------------------------------------- 31.26/8.80 31.26/8.80 (1) QTRSRRRProof (EQUIVALENT) 31.26/8.80 Used ordering: 31.26/8.80 Polynomial interpretation [POLO]: 31.26/8.80 31.26/8.80 POL(A(x_1)) = 1 + x_1 31.26/8.80 POL(B(x_1)) = 1 + x_1 31.26/8.80 POL(C(x_1)) = 1 + x_1 31.26/8.80 POL(a(x_1)) = 1 + x_1 31.26/8.80 POL(b(x_1)) = 1 + x_1 31.26/8.80 POL(c(x_1)) = 1 + x_1 31.26/8.80 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 31.26/8.80 31.26/8.80 a(b(x1)) -> C(x1) 31.26/8.80 b(c(x1)) -> A(x1) 31.26/8.80 c(a(x1)) -> B(x1) 31.26/8.80 A(C(x1)) -> b(x1) 31.26/8.80 C(B(x1)) -> a(x1) 31.26/8.80 B(A(x1)) -> c(x1) 31.26/8.80 a(a(a(a(x1)))) -> A(A(A(x1))) 31.26/8.80 A(A(A(A(x1)))) -> a(a(a(x1))) 31.26/8.80 b(b(b(b(x1)))) -> B(B(B(x1))) 31.26/8.80 B(B(B(B(x1)))) -> b(b(b(x1))) 31.26/8.80 c(c(c(c(x1)))) -> C(C(C(x1))) 31.26/8.80 C(C(C(C(x1)))) -> c(c(c(x1))) 31.26/8.80 a(A(x1)) -> x1 31.26/8.80 A(a(x1)) -> x1 31.26/8.80 b(B(x1)) -> x1 31.26/8.80 B(b(x1)) -> x1 31.26/8.80 c(C(x1)) -> x1 31.26/8.80 C(c(x1)) -> x1 31.26/8.80 31.26/8.80 31.26/8.80 31.26/8.80 31.26/8.80 ---------------------------------------- 31.26/8.80 31.26/8.80 (2) 31.26/8.80 Obligation: 31.26/8.80 Q restricted rewrite system: 31.26/8.80 The TRS R consists of the following rules: 31.26/8.80 31.26/8.80 B(a(a(a(x1)))) -> c(A(A(A(x1)))) 31.26/8.80 A(A(A(b(x1)))) -> a(a(a(C(x1)))) 31.26/8.80 C(b(b(b(x1)))) -> a(B(B(B(x1)))) 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