details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.3955 seconds
cpu usage	36.6337
user time	35.0783
system time	1.55538
max virtual memory	8.3680744E7
max residence set size	4064028.0

stage attributes

key	value
starexec-result	YES

output

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