details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.4606 seconds
cpu usage	25.8294
user time	24.6735
system time	1.1559
max virtual memory	8.3695572E7
max residence set size	3247996.0

stage attributes

key	value
starexec-result	YES

output

24.94/7.32 YES 25.53/7.37 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 25.53/7.37 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.53/7.37 25.53/7.37 25.53/7.37 Termination w.r.t. Q of the given QTRS could be proven: 25.53/7.37 25.53/7.37 (0) QTRS 25.53/7.37 (1) DependencyPairsProof [EQUIVALENT, 12 ms] 25.53/7.37 (2) QDP 25.53/7.37 (3) DependencyGraphProof [EQUIVALENT, 1 ms] 25.53/7.37 (4) QDP 25.53/7.37 (5) QDPOrderProof [EQUIVALENT, 60 ms] 25.53/7.37 (6) QDP 25.53/7.37 (7) QDPOrderProof [EQUIVALENT, 42 ms] 25.53/7.37 (8) QDP 25.53/7.37 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 25.53/7.37 (10) TRUE 25.53/7.37 25.53/7.37 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (0) 25.53/7.37 Obligation: 25.53/7.37 Q restricted rewrite system: 25.53/7.37 The TRS R consists of the following rules: 25.53/7.37 25.53/7.37 a(a(x1)) -> b(a(c(b(x1)))) 25.53/7.37 b(b(x1)) -> a(a(x1)) 25.53/7.37 c(a(x1)) -> x1 25.53/7.37 25.53/7.37 Q is empty. 25.53/7.37 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (1) DependencyPairsProof (EQUIVALENT) 25.53/7.37 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (2) 25.53/7.37 Obligation: 25.53/7.37 Q DP problem: 25.53/7.37 The TRS P consists of the following rules: 25.53/7.37 25.53/7.37 A(a(x1)) -> B(a(c(b(x1)))) 25.53/7.37 A(a(x1)) -> A(c(b(x1))) 25.53/7.37 A(a(x1)) -> C(b(x1)) 25.53/7.37 A(a(x1)) -> B(x1) 25.53/7.37 B(b(x1)) -> A(a(x1)) 25.53/7.37 B(b(x1)) -> A(x1) 25.53/7.37 25.53/7.37 The TRS R consists of the following rules: 25.53/7.37 25.53/7.37 a(a(x1)) -> b(a(c(b(x1)))) 25.53/7.37 b(b(x1)) -> a(a(x1)) 25.53/7.37 c(a(x1)) -> x1 25.53/7.37 25.53/7.37 Q is empty. 25.53/7.37 We have to consider all minimal (P,Q,R)-chains. 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (3) DependencyGraphProof (EQUIVALENT) 25.53/7.37 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (4) 25.53/7.37 Obligation: 25.53/7.37 Q DP problem: 25.53/7.37 The TRS P consists of the following rules: 25.53/7.37 25.53/7.37 B(b(x1)) -> A(a(x1)) 25.53/7.37 A(a(x1)) -> B(a(c(b(x1)))) 25.53/7.37 B(b(x1)) -> A(x1) 25.53/7.37 A(a(x1)) -> A(c(b(x1))) 25.53/7.37 A(a(x1)) -> B(x1) 25.53/7.37 25.53/7.37 The TRS R consists of the following rules: 25.53/7.37 25.53/7.37 a(a(x1)) -> b(a(c(b(x1)))) 25.53/7.37 b(b(x1)) -> a(a(x1)) 25.53/7.37 c(a(x1)) -> x1 25.53/7.37 25.53/7.37 Q is empty. 25.53/7.37 We have to consider all minimal (P,Q,R)-chains. 25.53/7.37 ---------------------------------------- 25.53/7.37 25.53/7.37 (5) QDPOrderProof (EQUIVALENT) 25.53/7.37 We use the reduction pair processor [LPAR04,JAR06]. 25.53/7.37 25.53/7.37 25.53/7.37 The following pairs can be oriented strictly and are deleted. 25.53/7.37 25.53/7.37 B(b(x1)) -> A(x1) 25.53/7.37 A(a(x1)) -> A(c(b(x1))) 25.53/7.37 A(a(x1)) -> B(x1) 25.53/7.37 The remaining pairs can at least be oriented weakly. 25.53/7.37 Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation: 25.53/7.37 25.53/7.37 POL( A_1(x_1) ) = max{0, 2x_1 - 1} 25.53/7.37 POL( B_1(x_1) ) = max{0, 2x_1 - 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