details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.3777 seconds
cpu usage	36.1829
user time	34.6632
system time	1.51967
max virtual memory	8.0229608E7
max residence set size	4259344.0

stage attributes

key	value
starexec-result	YES

output

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