details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.81684 seconds
cpu usage	30.325
user time	28.8896
system time	1.4354
max virtual memory	6.2412792E7
max residence set size	3999828.0

stage attributes

key	value
starexec-result	YES

output

29.21/8.37 YES 29.83/8.60 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 29.83/8.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.83/8.60 29.83/8.60 29.83/8.60 Termination w.r.t. Q of the given QTRS could be proven: 29.83/8.60 29.83/8.60 (0) QTRS 29.83/8.60 (1) DependencyPairsProof [EQUIVALENT, 2 ms] 29.83/8.60 (2) QDP 29.83/8.60 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 29.83/8.60 (4) QDP 29.83/8.60 (5) QDPOrderProof [EQUIVALENT, 174 ms] 29.83/8.60 (6) QDP 29.83/8.60 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 29.83/8.60 (8) AND 29.83/8.60 (9) QDP 29.83/8.60 (10) QDPOrderProof [EQUIVALENT, 50 ms] 29.83/8.60 (11) QDP 29.83/8.60 (12) PisEmptyProof [EQUIVALENT, 0 ms] 29.83/8.60 (13) YES 29.83/8.60 (14) QDP 29.83/8.60 (15) UsableRulesProof [EQUIVALENT, 0 ms] 29.83/8.60 (16) QDP 29.83/8.60 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.83/8.60 (18) YES 29.83/8.60 29.83/8.60 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (0) 29.83/8.60 Obligation: 29.83/8.60 Q restricted rewrite system: 29.83/8.60 The TRS R consists of the following rules: 29.83/8.60 29.83/8.60 a(a(x1)) -> a(b(b(c(x1)))) 29.83/8.60 b(a(x1)) -> x1 29.83/8.60 c(b(x1)) -> a(c(x1)) 29.83/8.60 29.83/8.60 Q is empty. 29.83/8.60 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (1) DependencyPairsProof (EQUIVALENT) 29.83/8.60 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (2) 29.83/8.60 Obligation: 29.83/8.60 Q DP problem: 29.83/8.60 The TRS P consists of the following rules: 29.83/8.60 29.83/8.60 A(a(x1)) -> A(b(b(c(x1)))) 29.83/8.60 A(a(x1)) -> B(b(c(x1))) 29.83/8.60 A(a(x1)) -> B(c(x1)) 29.83/8.60 A(a(x1)) -> C(x1) 29.83/8.60 C(b(x1)) -> A(c(x1)) 29.83/8.60 C(b(x1)) -> C(x1) 29.83/8.60 29.83/8.60 The TRS R consists of the following rules: 29.83/8.60 29.83/8.60 a(a(x1)) -> a(b(b(c(x1)))) 29.83/8.60 b(a(x1)) -> x1 29.83/8.60 c(b(x1)) -> a(c(x1)) 29.83/8.60 29.83/8.60 Q is empty. 29.83/8.60 We have to consider all minimal (P,Q,R)-chains. 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (3) DependencyGraphProof (EQUIVALENT) 29.83/8.60 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (4) 29.83/8.60 Obligation: 29.83/8.60 Q DP problem: 29.83/8.60 The TRS P consists of the following rules: 29.83/8.60 29.83/8.60 A(a(x1)) -> C(x1) 29.83/8.60 C(b(x1)) -> A(c(x1)) 29.83/8.60 A(a(x1)) -> A(b(b(c(x1)))) 29.83/8.60 C(b(x1)) -> C(x1) 29.83/8.60 29.83/8.60 The TRS R consists of the following rules: 29.83/8.60 29.83/8.60 a(a(x1)) -> a(b(b(c(x1)))) 29.83/8.60 b(a(x1)) -> x1 29.83/8.60 c(b(x1)) -> a(c(x1)) 29.83/8.60 29.83/8.60 Q is empty. 29.83/8.60 We have to consider all minimal (P,Q,R)-chains. 29.83/8.60 ---------------------------------------- 29.83/8.60 29.83/8.60 (5) QDPOrderProof (EQUIVALENT) 29.83/8.60 We use the reduction pair processor [LPAR04,JAR06]. 29.83/8.60 29.83/8.60 29.83/8.60 The following pairs can be oriented strictly and are deleted. 29.83/8.60 29.83/8.60 A(a(x1)) -> 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