details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.78966 seconds
cpu usage	23.46
user time	22.3463
system time	1.11372
max virtual memory	4.0723068E7
max residence set size	3167612.0

stage attributes

key	value
starexec-result	YES

output

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