details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.31557 seconds
cpu usage	13.5312
user time	12.9605
system time	0.570749
max virtual memory	3.8707672E7
max residence set size	1683456.0

stage attributes

key	value
starexec-result	YES

output

12.98/4.14 YES 13.21/4.17 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 13.21/4.17 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.21/4.17 13.21/4.17 13.21/4.17 Termination w.r.t. Q of the given QTRS could be proven: 13.21/4.17 13.21/4.17 (0) QTRS 13.21/4.17 (1) DependencyPairsProof [EQUIVALENT, 31 ms] 13.21/4.17 (2) QDP 13.21/4.17 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 13.21/4.17 (4) QDP 13.21/4.17 (5) QDPOrderProof [EQUIVALENT, 94 ms] 13.21/4.17 (6) QDP 13.21/4.17 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 13.21/4.17 (8) TRUE 13.21/4.17 13.21/4.17 13.21/4.17 ---------------------------------------- 13.21/4.17 13.21/4.17 (0) 13.21/4.17 Obligation: 13.21/4.17 Q restricted rewrite system: 13.21/4.17 The TRS R consists of the following rules: 13.21/4.17 13.21/4.17 b(b(x1)) -> c(d(x1)) 13.21/4.17 c(c(x1)) -> d(d(d(x1))) 13.21/4.17 c(x1) -> g(x1) 13.21/4.17 d(d(x1)) -> c(f(x1)) 13.21/4.17 d(d(d(x1))) -> g(c(x1)) 13.21/4.17 f(x1) -> a(g(x1)) 13.21/4.17 g(x1) -> d(a(b(x1))) 13.21/4.17 g(g(x1)) -> b(c(x1)) 13.21/4.17 13.21/4.17 Q is empty. 13.21/4.17 13.21/4.17 ---------------------------------------- 13.21/4.17 13.21/4.17 (1) DependencyPairsProof (EQUIVALENT) 13.21/4.17 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 13.21/4.17 ---------------------------------------- 13.21/4.17 13.21/4.17 (2) 13.21/4.17 Obligation: 13.21/4.17 Q DP problem: 13.21/4.17 The TRS P consists of the following rules: 13.21/4.17 13.21/4.17 B(b(x1)) -> C(d(x1)) 13.21/4.17 B(b(x1)) -> D(x1) 13.21/4.17 C(c(x1)) -> D(d(d(x1))) 13.21/4.17 C(c(x1)) -> D(d(x1)) 13.21/4.17 C(c(x1)) -> D(x1) 13.21/4.17 C(x1) -> G(x1) 13.21/4.17 D(d(x1)) -> C(f(x1)) 13.21/4.17 D(d(x1)) -> F(x1) 13.21/4.17 D(d(d(x1))) -> G(c(x1)) 13.21/4.17 D(d(d(x1))) -> C(x1) 13.21/4.17 F(x1) -> G(x1) 13.21/4.17 G(x1) -> D(a(b(x1))) 13.21/4.17 G(x1) -> B(x1) 13.21/4.17 G(g(x1)) -> B(c(x1)) 13.21/4.17 G(g(x1)) -> C(x1) 13.21/4.17 13.21/4.17 The TRS R consists of the following rules: 13.21/4.17 13.21/4.17 b(b(x1)) -> c(d(x1)) 13.21/4.17 c(c(x1)) -> d(d(d(x1))) 13.21/4.17 c(x1) -> g(x1) 13.21/4.17 d(d(x1)) -> c(f(x1)) 13.21/4.17 d(d(d(x1))) -> g(c(x1)) 13.21/4.17 f(x1) -> a(g(x1)) 13.21/4.17 g(x1) -> d(a(b(x1))) 13.21/4.17 g(g(x1)) -> b(c(x1)) 13.21/4.17 13.21/4.17 Q is empty. 13.21/4.17 We have to consider all minimal (P,Q,R)-chains. 13.21/4.17 ---------------------------------------- 13.21/4.17 13.21/4.17 (3) DependencyGraphProof (EQUIVALENT) 13.21/4.17 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. 13.21/4.17 ---------------------------------------- 13.21/4.17 13.21/4.17 (4) 13.21/4.17 Obligation: 13.21/4.17 Q DP problem: 13.21/4.17 The TRS P consists of the following rules: 13.21/4.17 13.21/4.17 C(c(x1)) -> D(d(d(x1))) 13.21/4.17 D(d(x1)) -> C(f(x1)) 13.21/4.17 C(c(x1)) -> D(d(x1)) 13.21/4.17 D(d(x1)) -> F(x1) 13.21/4.17 F(x1) -> G(x1) 13.21/4.17 G(x1) -> B(x1) 13.21/4.17 B(b(x1)) -> C(d(x1)) 13.21/4.17 C(c(x1)) -> D(x1) 13.21/4.17 D(d(d(x1))) -> G(c(x1)) 13.21/4.17 G(g(x1)) -> B(c(x1)) 13.21/4.17 B(b(x1)) -> D(x1) 13.21/4.17 D(d(d(x1))) -> C(x1) 13.21/4.17 C(x1) -> G(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