details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.22499 seconds
cpu usage	13.2791
user time	12.6305
system time	0.648573
max virtual memory	3.9914184E7
max residence set size	2015648.0

stage attributes

key	value
starexec-result	YES

output

12.93/4.09 YES 12.93/4.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 12.93/4.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.93/4.13 12.93/4.13 12.93/4.13 Termination w.r.t. Q of the given QTRS could be proven: 12.93/4.13 12.93/4.13 (0) QTRS 12.93/4.13 (1) QTRSRRRProof [EQUIVALENT, 50 ms] 12.93/4.13 (2) QTRS 12.93/4.13 (3) DependencyPairsProof [EQUIVALENT, 25 ms] 12.93/4.13 (4) QDP 12.93/4.13 (5) MRRProof [EQUIVALENT, 34 ms] 12.93/4.13 (6) QDP 12.93/4.13 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 12.93/4.13 (8) AND 12.93/4.13 (9) QDP 12.93/4.13 (10) QDPOrderProof [EQUIVALENT, 6 ms] 12.93/4.13 (11) QDP 12.93/4.13 (12) PisEmptyProof [EQUIVALENT, 0 ms] 12.93/4.13 (13) YES 12.93/4.13 (14) QDP 12.93/4.13 (15) QDPOrderProof [EQUIVALENT, 36 ms] 12.93/4.13 (16) QDP 12.93/4.13 (17) DependencyGraphProof [EQUIVALENT, 0 ms] 12.93/4.13 (18) TRUE 12.93/4.13 12.93/4.13 12.93/4.13 ---------------------------------------- 12.93/4.13 12.93/4.13 (0) 12.93/4.13 Obligation: 12.93/4.13 Q restricted rewrite system: 12.93/4.13 The TRS R consists of the following rules: 12.93/4.13 12.93/4.13 a(a(x1)) -> b(b(b(x1))) 12.93/4.13 a(x1) -> d(c(d(x1))) 12.93/4.13 b(b(b(x1))) -> a(f(x1)) 12.93/4.13 b(b(x1)) -> c(c(c(x1))) 12.93/4.13 c(c(x1)) -> d(d(d(x1))) 12.93/4.13 c(d(d(x1))) -> f(x1) 12.93/4.13 f(f(x1)) -> f(a(x1)) 12.93/4.13 12.93/4.13 Q is empty. 12.93/4.13 12.93/4.13 ---------------------------------------- 12.93/4.13 12.93/4.13 (1) QTRSRRRProof (EQUIVALENT) 12.93/4.13 Used ordering: 12.93/4.13 Polynomial interpretation [POLO]: 12.93/4.13 12.93/4.13 POL(a(x_1)) = 39 + x_1 12.93/4.13 POL(b(x_1)) = 26 + x_1 12.93/4.13 POL(c(x_1)) = 17 + x_1 12.93/4.13 POL(d(x_1)) = 11 + x_1 12.93/4.13 POL(f(x_1)) = 39 + x_1 12.93/4.13 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 12.93/4.13 12.93/4.13 b(b(x1)) -> c(c(c(x1))) 12.93/4.13 c(c(x1)) -> d(d(d(x1))) 12.93/4.13 12.93/4.13 12.93/4.13 12.93/4.13 12.93/4.13 ---------------------------------------- 12.93/4.13 12.93/4.13 (2) 12.93/4.13 Obligation: 12.93/4.13 Q restricted rewrite system: 12.93/4.13 The TRS R consists of the following rules: 12.93/4.13 12.93/4.13 a(a(x1)) -> b(b(b(x1))) 12.93/4.13 a(x1) -> d(c(d(x1))) 12.93/4.13 b(b(b(x1))) -> a(f(x1)) 12.93/4.13 c(d(d(x1))) -> f(x1) 12.93/4.13 f(f(x1)) -> f(a(x1)) 12.93/4.13 12.93/4.13 Q is empty. 12.93/4.13 12.93/4.13 ---------------------------------------- 12.93/4.13 12.93/4.13 (3) DependencyPairsProof (EQUIVALENT) 12.93/4.13 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 12.93/4.13 ---------------------------------------- 12.93/4.13 12.93/4.13 (4) 12.93/4.13 Obligation: 12.93/4.13 Q DP problem: 12.93/4.13 The TRS P consists of the following rules: 12.93/4.13 12.93/4.13 A(a(x1)) -> B(b(b(x1))) 12.93/4.13 A(a(x1)) -> B(b(x1)) 12.93/4.13 A(a(x1)) -> B(x1) 12.93/4.13 A(x1) -> C(d(x1)) 12.93/4.13 B(b(b(x1))) -> A(f(x1)) 12.93/4.13 B(b(b(x1))) -> F(x1) 12.93/4.13 C(d(d(x1))) -> F(x1) 12.93/4.13 F(f(x1)) -> F(a(x1)) 12.93/4.13 F(f(x1)) -> A(x1) 12.93/4.13 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