details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.74889 seconds
cpu usage	34.8185
user time	33.3682
system time	1.4503
max virtual memory	7.9429628E7
max residence set size	3800244.0

stage attributes

key	value
starexec-result	YES

output

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