details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.8085 seconds
cpu usage	42.5585
user time	41.0653
system time	1.49324
max virtual memory	6.2893168E7
max residence set size	4172120.0

stage attributes

key	value
starexec-result	YES

output

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