details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.56459 seconds
cpu usage	29.8004
user time	28.521
system time	1.27949
max virtual memory	6.1257784E7
max residence set size	3573528.0

stage attributes

key	value
starexec-result	YES

output

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