details

property	value
status	complete
benchmark	uni-5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n107.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.96042 seconds
cpu usage	27.5832
user time	26.2547
system time	1.32848
max virtual memory	6.2206704E7
max residence set size	3897724.0

stage attributes

key	value
starexec-result	YES

output

27.19/7.81 YES 27.19/7.82 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 27.19/7.82 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 27.19/7.82 27.19/7.82 27.19/7.82 Termination w.r.t. Q of the given QTRS could be proven: 27.19/7.82 27.19/7.82 (0) QTRS 27.19/7.82 (1) DependencyPairsProof [EQUIVALENT, 21 ms] 27.19/7.82 (2) QDP 27.19/7.82 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 27.19/7.82 (4) QDP 27.19/7.82 (5) QDPOrderProof [EQUIVALENT, 92 ms] 27.19/7.82 (6) QDP 27.19/7.82 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 27.19/7.82 (8) QDP 27.19/7.82 (9) QDPOrderProof [EQUIVALENT, 0 ms] 27.19/7.82 (10) QDP 27.19/7.82 (11) PisEmptyProof [EQUIVALENT, 0 ms] 27.19/7.82 (12) YES 27.19/7.82 27.19/7.82 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (0) 27.19/7.82 Obligation: 27.19/7.82 Q restricted rewrite system: 27.19/7.82 The TRS R consists of the following rules: 27.19/7.82 27.19/7.82 a(a(x1)) -> x1 27.19/7.82 b(b(x1)) -> c(c(c(c(x1)))) 27.19/7.82 c(c(x1)) -> a(c(b(x1))) 27.19/7.82 27.19/7.82 Q is empty. 27.19/7.82 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (1) DependencyPairsProof (EQUIVALENT) 27.19/7.82 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (2) 27.19/7.82 Obligation: 27.19/7.82 Q DP problem: 27.19/7.82 The TRS P consists of the following rules: 27.19/7.82 27.19/7.82 B(b(x1)) -> C(c(c(c(x1)))) 27.19/7.82 B(b(x1)) -> C(c(c(x1))) 27.19/7.82 B(b(x1)) -> C(c(x1)) 27.19/7.82 B(b(x1)) -> C(x1) 27.19/7.82 C(c(x1)) -> A(c(b(x1))) 27.19/7.82 C(c(x1)) -> C(b(x1)) 27.19/7.82 C(c(x1)) -> B(x1) 27.19/7.82 27.19/7.82 The TRS R consists of the following rules: 27.19/7.82 27.19/7.82 a(a(x1)) -> x1 27.19/7.82 b(b(x1)) -> c(c(c(c(x1)))) 27.19/7.82 c(c(x1)) -> a(c(b(x1))) 27.19/7.82 27.19/7.82 Q is empty. 27.19/7.82 We have to consider all minimal (P,Q,R)-chains. 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (3) DependencyGraphProof (EQUIVALENT) 27.19/7.82 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (4) 27.19/7.82 Obligation: 27.19/7.82 Q DP problem: 27.19/7.82 The TRS P consists of the following rules: 27.19/7.82 27.19/7.82 C(c(x1)) -> C(b(x1)) 27.19/7.82 C(c(x1)) -> B(x1) 27.19/7.82 B(b(x1)) -> C(c(c(c(x1)))) 27.19/7.82 B(b(x1)) -> C(c(c(x1))) 27.19/7.82 B(b(x1)) -> C(c(x1)) 27.19/7.82 B(b(x1)) -> C(x1) 27.19/7.82 27.19/7.82 The TRS R consists of the following rules: 27.19/7.82 27.19/7.82 a(a(x1)) -> x1 27.19/7.82 b(b(x1)) -> c(c(c(c(x1)))) 27.19/7.82 c(c(x1)) -> a(c(b(x1))) 27.19/7.82 27.19/7.82 Q is empty. 27.19/7.82 We have to consider all minimal (P,Q,R)-chains. 27.19/7.82 ---------------------------------------- 27.19/7.82 27.19/7.82 (5) QDPOrderProof (EQUIVALENT) 27.19/7.82 We use the reduction pair processor [LPAR04,JAR06]. 27.19/7.82 27.19/7.82 27.19/7.82 The following pairs can be oriented strictly and are deleted. 27.19/7.82 27.19/7.82 B(b(x1)) -> C(c(c(c(x1)))) 27.19/7.82 B(b(x1)) -> C(c(c(x1))) 27.19/7.82 B(b(x1)) -> C(c(x1)) 27.19/7.82 B(b(x1)) -> C(x1) 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