details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.53969 seconds
cpu usage	25.4505
user time	24.1198
system time	1.33065
max virtual memory	7.8895592E7
max residence set size	3951404.0

stage attributes

key	value
starexec-result	YES

output

25.20/7.44 YES 25.20/7.47 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 25.20/7.47 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.20/7.47 25.20/7.47 25.20/7.47 Termination w.r.t. Q of the given QTRS could be proven: 25.20/7.47 25.20/7.47 (0) QTRS 25.20/7.47 (1) DependencyPairsProof [EQUIVALENT, 12 ms] 25.20/7.47 (2) QDP 25.20/7.47 (3) QDPOrderProof [EQUIVALENT, 21 ms] 25.20/7.47 (4) QDP 25.20/7.47 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 25.20/7.47 (6) QDP 25.20/7.47 (7) QDPOrderProof [EQUIVALENT, 15 ms] 25.20/7.47 (8) QDP 25.20/7.47 (9) PisEmptyProof [EQUIVALENT, 0 ms] 25.20/7.47 (10) YES 25.20/7.47 25.20/7.47 25.20/7.47 ---------------------------------------- 25.20/7.47 25.20/7.47 (0) 25.20/7.47 Obligation: 25.20/7.47 Q restricted rewrite system: 25.20/7.47 The TRS R consists of the following rules: 25.20/7.47 25.20/7.47 b(a(a(x1))) -> a(b(c(x1))) 25.20/7.47 c(a(x1)) -> a(c(x1)) 25.20/7.47 c(b(x1)) -> b(a(x1)) 25.20/7.47 a(a(x1)) -> a(b(a(x1))) 25.20/7.47 25.20/7.47 Q is empty. 25.20/7.47 25.20/7.47 ---------------------------------------- 25.20/7.47 25.20/7.47 (1) DependencyPairsProof (EQUIVALENT) 25.20/7.47 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 25.20/7.47 ---------------------------------------- 25.20/7.47 25.20/7.47 (2) 25.20/7.47 Obligation: 25.20/7.47 Q DP problem: 25.20/7.47 The TRS P consists of the following rules: 25.20/7.47 25.20/7.47 B(a(a(x1))) -> A(b(c(x1))) 25.20/7.47 B(a(a(x1))) -> B(c(x1)) 25.20/7.47 B(a(a(x1))) -> C(x1) 25.20/7.47 C(a(x1)) -> A(c(x1)) 25.20/7.47 C(a(x1)) -> C(x1) 25.20/7.47 C(b(x1)) -> B(a(x1)) 25.20/7.47 C(b(x1)) -> A(x1) 25.20/7.47 A(a(x1)) -> A(b(a(x1))) 25.20/7.47 A(a(x1)) -> B(a(x1)) 25.20/7.47 25.20/7.47 The TRS R consists of the following rules: 25.20/7.47 25.20/7.47 b(a(a(x1))) -> a(b(c(x1))) 25.20/7.47 c(a(x1)) -> a(c(x1)) 25.20/7.47 c(b(x1)) -> b(a(x1)) 25.20/7.47 a(a(x1)) -> a(b(a(x1))) 25.20/7.47 25.20/7.47 Q is empty. 25.20/7.47 We have to consider all minimal (P,Q,R)-chains. 25.20/7.47 ---------------------------------------- 25.20/7.47 25.20/7.47 (3) QDPOrderProof (EQUIVALENT) 25.20/7.47 We use the reduction pair processor [LPAR04,JAR06]. 25.20/7.47 25.20/7.47 25.20/7.47 The following pairs can be oriented strictly and are deleted. 25.20/7.47 25.20/7.47 B(a(a(x1))) -> A(b(c(x1))) 25.20/7.47 B(a(a(x1))) -> B(c(x1)) 25.20/7.47 B(a(a(x1))) -> C(x1) 25.20/7.47 C(a(x1)) -> A(c(x1)) 25.20/7.47 C(a(x1)) -> C(x1) 25.20/7.47 C(b(x1)) -> A(x1) 25.20/7.47 The remaining pairs can at least be oriented weakly. 25.20/7.47 Used ordering: Polynomial interpretation [POLO]: 25.20/7.47 25.20/7.47 POL(A(x_1)) = x_1 25.20/7.47 POL(B(x_1)) = x_1 25.20/7.47 POL(C(x_1)) = 1 + x_1 25.20/7.47 POL(a(x_1)) = 1 + x_1 25.20/7.47 POL(b(x_1)) = x_1 25.20/7.47 POL(c(x_1)) = 1 + x_1 25.20/7.47 25.20/7.47 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 25.20/7.47 25.20/7.47 c(a(x1)) -> a(c(x1)) 25.20/7.47 c(b(x1)) -> b(a(x1)) 25.20/7.47 b(a(a(x1))) -> a(b(c(x1))) 25.20/7.47 a(a(x1)) -> a(b(a(x1))) 25.20/7.47 25.20/7.47 25.20/7.47 ---------------------------------------- 25.20/7.47 25.20/7.47 (4) 25.20/7.47 Obligation: 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