details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.7246 seconds
cpu usage	54.2682
user time	52.697
system time	1.57124
max virtual memory	7.7571972E7
max residence set size	4314724.0

stage attributes

key	value
starexec-result	YES

output

33.33/9.38 YES 53.97/14.66 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 53.97/14.66 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 53.97/14.66 53.97/14.66 53.97/14.66 Termination w.r.t. Q of the given QTRS could be proven: 53.97/14.66 53.97/14.66 (0) QTRS 53.97/14.66 (1) DependencyPairsProof [EQUIVALENT, 12 ms] 53.97/14.66 (2) QDP 53.97/14.66 (3) QDPOrderProof [EQUIVALENT, 273 ms] 53.97/14.66 (4) QDP 53.97/14.66 (5) QDPOrderProof [EQUIVALENT, 0 ms] 53.97/14.66 (6) QDP 53.97/14.66 (7) QDPOrderProof [EQUIVALENT, 36 ms] 53.97/14.66 (8) QDP 53.97/14.66 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 53.97/14.66 (10) QDP 53.97/14.66 (11) QDPOrderProof [EQUIVALENT, 16 ms] 53.97/14.66 (12) QDP 53.97/14.66 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 53.97/14.66 (14) TRUE 53.97/14.66 53.97/14.66 53.97/14.66 ---------------------------------------- 53.97/14.66 53.97/14.66 (0) 53.97/14.66 Obligation: 53.97/14.66 Q restricted rewrite system: 53.97/14.66 The TRS R consists of the following rules: 53.97/14.66 53.97/14.66 a(b(x1)) -> c(b(x1)) 53.97/14.66 c(c(x1)) -> d(b(x1)) 53.97/14.66 d(x1) -> c(e(x1)) 53.97/14.66 b(b(x1)) -> f(x1) 53.97/14.66 c(b(x1)) -> g(x1) 53.97/14.66 e(x1) -> f(x1) 53.97/14.66 e(x1) -> b(b(x1)) 53.97/14.66 f(g(x1)) -> a(c(x1)) 53.97/14.66 g(f(x1)) -> e(x1) 53.97/14.66 a(x1) -> b(c(x1)) 53.97/14.66 53.97/14.66 Q is empty. 53.97/14.66 53.97/14.66 ---------------------------------------- 53.97/14.66 53.97/14.66 (1) DependencyPairsProof (EQUIVALENT) 53.97/14.66 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 53.97/14.66 ---------------------------------------- 53.97/14.66 53.97/14.66 (2) 53.97/14.66 Obligation: 53.97/14.66 Q DP problem: 53.97/14.66 The TRS P consists of the following rules: 53.97/14.66 53.97/14.66 A(b(x1)) -> C(b(x1)) 53.97/14.66 C(c(x1)) -> D(b(x1)) 53.97/14.66 C(c(x1)) -> B(x1) 53.97/14.66 D(x1) -> C(e(x1)) 53.97/14.66 D(x1) -> E(x1) 53.97/14.66 B(b(x1)) -> F(x1) 53.97/14.66 C(b(x1)) -> G(x1) 53.97/14.66 E(x1) -> F(x1) 53.97/14.66 E(x1) -> B(b(x1)) 53.97/14.66 E(x1) -> B(x1) 53.97/14.66 F(g(x1)) -> A(c(x1)) 53.97/14.66 F(g(x1)) -> C(x1) 53.97/14.66 G(f(x1)) -> E(x1) 53.97/14.66 A(x1) -> B(c(x1)) 53.97/14.66 A(x1) -> C(x1) 53.97/14.66 53.97/14.66 The TRS R consists of the following rules: 53.97/14.66 53.97/14.66 a(b(x1)) -> c(b(x1)) 53.97/14.66 c(c(x1)) -> d(b(x1)) 53.97/14.66 d(x1) -> c(e(x1)) 53.97/14.66 b(b(x1)) -> f(x1) 53.97/14.66 c(b(x1)) -> g(x1) 53.97/14.66 e(x1) -> f(x1) 53.97/14.66 e(x1) -> b(b(x1)) 53.97/14.66 f(g(x1)) -> a(c(x1)) 53.97/14.66 g(f(x1)) -> e(x1) 53.97/14.66 a(x1) -> b(c(x1)) 53.97/14.66 53.97/14.66 Q is empty. 53.97/14.66 We have to consider all minimal (P,Q,R)-chains. 53.97/14.66 ---------------------------------------- 53.97/14.66 53.97/14.66 (3) QDPOrderProof (EQUIVALENT) 53.97/14.66 We use the reduction pair processor [LPAR04,JAR06]. 53.97/14.66 53.97/14.66 53.97/14.66 The following pairs can be oriented strictly and are deleted. 53.97/14.66 53.97/14.66 E(x1) -> F(x1) 53.97/14.66 The remaining pairs can at least be oriented weakly. 53.97/14.66 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 53.97/14.66 53.97/14.66 <<< 53.97/14.66 POL(A(x_1)) = [[0A]] + [[0A, 0A, 1A]] * 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