details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.49811 seconds
cpu usage	33.2739
user time	31.7297
system time	1.54421
max virtual memory	8.3686896E7
max residence set size	4143568.0

stage attributes

key	value
starexec-result	YES

output

32.31/9.26 YES 33.00/9.41 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 33.00/9.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.00/9.41 33.00/9.41 33.00/9.41 Termination w.r.t. Q of the given QTRS could be proven: 33.00/9.41 33.00/9.41 (0) QTRS 33.00/9.41 (1) QTRS Reverse [EQUIVALENT, 0 ms] 33.00/9.41 (2) QTRS 33.00/9.41 (3) DependencyPairsProof [EQUIVALENT, 6 ms] 33.00/9.41 (4) QDP 33.00/9.41 (5) QDPOrderProof [EQUIVALENT, 129 ms] 33.00/9.41 (6) QDP 33.00/9.41 (7) QDPOrderProof [EQUIVALENT, 0 ms] 33.00/9.41 (8) QDP 33.00/9.41 (9) QDPOrderProof [EQUIVALENT, 55 ms] 33.00/9.41 (10) QDP 33.00/9.41 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 33.00/9.41 (12) TRUE 33.00/9.41 33.00/9.41 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (0) 33.00/9.41 Obligation: 33.00/9.41 Q restricted rewrite system: 33.00/9.41 The TRS R consists of the following rules: 33.00/9.41 33.00/9.41 b(b(x1)) -> a(a(a(x1))) 33.00/9.41 b(a(b(x1))) -> a(x1) 33.00/9.41 b(a(a(x1))) -> b(a(b(x1))) 33.00/9.41 33.00/9.41 Q is empty. 33.00/9.41 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (1) QTRS Reverse (EQUIVALENT) 33.00/9.41 We applied the QTRS Reverse Processor [REVERSE]. 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (2) 33.00/9.41 Obligation: 33.00/9.41 Q restricted rewrite system: 33.00/9.41 The TRS R consists of the following rules: 33.00/9.41 33.00/9.41 b(b(x1)) -> a(a(a(x1))) 33.00/9.41 b(a(b(x1))) -> a(x1) 33.00/9.41 a(a(b(x1))) -> b(a(b(x1))) 33.00/9.41 33.00/9.41 Q is empty. 33.00/9.41 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (3) DependencyPairsProof (EQUIVALENT) 33.00/9.41 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (4) 33.00/9.41 Obligation: 33.00/9.41 Q DP problem: 33.00/9.41 The TRS P consists of the following rules: 33.00/9.41 33.00/9.41 B(b(x1)) -> A(a(a(x1))) 33.00/9.41 B(b(x1)) -> A(a(x1)) 33.00/9.41 B(b(x1)) -> A(x1) 33.00/9.41 B(a(b(x1))) -> A(x1) 33.00/9.41 A(a(b(x1))) -> B(a(b(x1))) 33.00/9.41 33.00/9.41 The TRS R consists of the following rules: 33.00/9.41 33.00/9.41 b(b(x1)) -> a(a(a(x1))) 33.00/9.41 b(a(b(x1))) -> a(x1) 33.00/9.41 a(a(b(x1))) -> b(a(b(x1))) 33.00/9.41 33.00/9.41 Q is empty. 33.00/9.41 We have to consider all minimal (P,Q,R)-chains. 33.00/9.41 ---------------------------------------- 33.00/9.41 33.00/9.41 (5) QDPOrderProof (EQUIVALENT) 33.00/9.41 We use the reduction pair processor [LPAR04,JAR06]. 33.00/9.41 33.00/9.41 33.00/9.41 The following pairs can be oriented strictly and are deleted. 33.00/9.41 33.00/9.41 B(b(x1)) -> A(x1) 33.00/9.41 B(a(b(x1))) -> A(x1) 33.00/9.41 The remaining pairs can at least be oriented weakly. 33.00/9.41 Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: 33.00/9.41 33.00/9.41 <<< 33.00/9.41 POL(B(x_1)) = [[0A]] + [[-I, -I, 0A]] * x_1 33.00/9.41 >>> 33.00/9.41 33.00/9.41 <<< 33.00/9.41 POL(b(x_1)) = [[-I], [0A], [0A]] + [[0A, 0A, 0A], [0A, -I, 0A], [1A, 1A, 1A]] * x_1 33.00/9.41 >>> 33.00/9.41 33.00/9.41 <<< 33.00/9.41 POL(A(x_1)) = [[-I]] + [[0A, 0A, 0A]] * x_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