details

property	value
status	complete
benchmark	size-12-alpha-3-num-31.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n152.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.68347 seconds
cpu usage	21.3636
user time	20.3702
system time	0.993328
max virtual memory	2.0473044E7
max residence set size	2881068.0

stage attributes

key	value
starexec-result	YES

output

20.81/6.55 YES 21.04/6.59 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 21.04/6.59 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 21.04/6.59 21.04/6.59 21.04/6.59 Termination w.r.t. Q of the given QTRS could be proven: 21.04/6.59 21.04/6.59 (0) QTRS 21.04/6.59 (1) QTRS Reverse [EQUIVALENT, 0 ms] 21.04/6.59 (2) QTRS 21.04/6.59 (3) DependencyPairsProof [EQUIVALENT, 19 ms] 21.04/6.59 (4) QDP 21.04/6.59 (5) DependencyGraphProof [EQUIVALENT, 1 ms] 21.04/6.59 (6) QDP 21.04/6.59 (7) QDPOrderProof [EQUIVALENT, 108 ms] 21.04/6.59 (8) QDP 21.04/6.59 (9) PisEmptyProof [EQUIVALENT, 0 ms] 21.04/6.59 (10) YES 21.04/6.59 21.04/6.59 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (0) 21.04/6.59 Obligation: 21.04/6.59 Q restricted rewrite system: 21.04/6.59 The TRS R consists of the following rules: 21.04/6.59 21.04/6.59 a(x1) -> x1 21.04/6.59 a(x1) -> b(b(x1)) 21.04/6.59 b(a(c(x1))) -> c(c(a(a(x1)))) 21.04/6.59 c(x1) -> x1 21.04/6.59 21.04/6.59 Q is empty. 21.04/6.59 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (1) QTRS Reverse (EQUIVALENT) 21.04/6.59 We applied the QTRS Reverse Processor [REVERSE]. 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (2) 21.04/6.59 Obligation: 21.04/6.59 Q restricted rewrite system: 21.04/6.59 The TRS R consists of the following rules: 21.04/6.59 21.04/6.59 a(x1) -> x1 21.04/6.59 a(x1) -> b(b(x1)) 21.04/6.59 c(a(b(x1))) -> a(a(c(c(x1)))) 21.04/6.59 c(x1) -> x1 21.04/6.59 21.04/6.59 Q is empty. 21.04/6.59 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (3) DependencyPairsProof (EQUIVALENT) 21.04/6.59 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (4) 21.04/6.59 Obligation: 21.04/6.59 Q DP problem: 21.04/6.59 The TRS P consists of the following rules: 21.04/6.59 21.04/6.59 C(a(b(x1))) -> A(a(c(c(x1)))) 21.04/6.59 C(a(b(x1))) -> A(c(c(x1))) 21.04/6.59 C(a(b(x1))) -> C(c(x1)) 21.04/6.59 C(a(b(x1))) -> C(x1) 21.04/6.59 21.04/6.59 The TRS R consists of the following rules: 21.04/6.59 21.04/6.59 a(x1) -> x1 21.04/6.59 a(x1) -> b(b(x1)) 21.04/6.59 c(a(b(x1))) -> a(a(c(c(x1)))) 21.04/6.59 c(x1) -> x1 21.04/6.59 21.04/6.59 Q is empty. 21.04/6.59 We have to consider all minimal (P,Q,R)-chains. 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (5) DependencyGraphProof (EQUIVALENT) 21.04/6.59 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. 21.04/6.59 ---------------------------------------- 21.04/6.59 21.04/6.59 (6) 21.04/6.59 Obligation: 21.04/6.59 Q DP problem: 21.04/6.59 The TRS P consists of the following rules: 21.04/6.59 21.04/6.59 C(a(b(x1))) -> C(x1) 21.04/6.59 C(a(b(x1))) -> C(c(x1)) 21.04/6.59 21.04/6.59 The TRS R consists of the following rules: 21.04/6.59 21.04/6.59 a(x1) -> x1 21.04/6.59 a(x1) -> b(b(x1)) 21.04/6.59 c(a(b(x1))) -> a(a(c(c(x1)))) 21.04/6.59 c(x1) -> x1 21.04/6.59 21.04/6.59 Q is empty. 21.04/6.59 We have to consider all minimal (P,Q,R)-chains. 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