details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.0107 seconds
cpu usage	37.1898
user time	35.9503
system time	1.2395
max virtual memory	4.089734E7
max residence set size	3702864.0

stage attributes

key	value
starexec-result	YES

output

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