details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.4678 seconds
cpu usage	41.0118
user time	39.4324
system time	1.57937
max virtual memory	8.3737412E7
max residence set size	4158020.0

stage attributes

key	value
starexec-result	YES

output

39.99/11.22 YES 40.56/11.39 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 40.56/11.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 40.56/11.39 40.56/11.39 40.56/11.39 Termination w.r.t. Q of the given QTRS could be proven: 40.56/11.39 40.56/11.39 (0) QTRS 40.56/11.39 (1) DependencyPairsProof [EQUIVALENT, 1 ms] 40.56/11.39 (2) QDP 40.56/11.39 (3) QDPOrderProof [EQUIVALENT, 22 ms] 40.56/11.39 (4) QDP 40.56/11.39 (5) QDPOrderProof [EQUIVALENT, 95 ms] 40.56/11.39 (6) QDP 40.56/11.39 (7) QDPOrderProof [EQUIVALENT, 26 ms] 40.56/11.39 (8) QDP 40.56/11.39 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 40.56/11.39 (10) TRUE 40.56/11.39 40.56/11.39 40.56/11.39 ---------------------------------------- 40.56/11.39 40.56/11.39 (0) 40.56/11.39 Obligation: 40.56/11.39 Q restricted rewrite system: 40.56/11.39 The TRS R consists of the following rules: 40.56/11.39 40.56/11.39 a(x1) -> x1 40.56/11.39 a(a(b(x1))) -> c(b(a(a(x1)))) 40.56/11.39 b(c(x1)) -> a(b(x1)) 40.56/11.39 40.56/11.39 Q is empty. 40.56/11.39 40.56/11.39 ---------------------------------------- 40.56/11.39 40.56/11.39 (1) DependencyPairsProof (EQUIVALENT) 40.56/11.39 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 40.56/11.39 ---------------------------------------- 40.56/11.39 40.56/11.39 (2) 40.56/11.39 Obligation: 40.56/11.39 Q DP problem: 40.56/11.39 The TRS P consists of the following rules: 40.56/11.39 40.56/11.39 A(a(b(x1))) -> B(a(a(x1))) 40.56/11.39 A(a(b(x1))) -> A(a(x1)) 40.56/11.39 A(a(b(x1))) -> A(x1) 40.56/11.39 B(c(x1)) -> A(b(x1)) 40.56/11.39 B(c(x1)) -> B(x1) 40.56/11.39 40.56/11.39 The TRS R consists of the following rules: 40.56/11.39 40.56/11.39 a(x1) -> x1 40.56/11.39 a(a(b(x1))) -> c(b(a(a(x1)))) 40.56/11.39 b(c(x1)) -> a(b(x1)) 40.56/11.39 40.56/11.39 Q is empty. 40.56/11.39 We have to consider all minimal (P,Q,R)-chains. 40.56/11.39 ---------------------------------------- 40.56/11.39 40.56/11.39 (3) QDPOrderProof (EQUIVALENT) 40.56/11.39 We use the reduction pair processor [LPAR04,JAR06]. 40.56/11.39 40.56/11.39 40.56/11.39 The following pairs can be oriented strictly and are deleted. 40.56/11.39 40.56/11.39 A(a(b(x1))) -> A(a(x1)) 40.56/11.39 A(a(b(x1))) -> A(x1) 40.56/11.39 The remaining pairs can at least be oriented weakly. 40.56/11.39 Used ordering: Polynomial interpretation [POLO]: 40.56/11.39 40.56/11.39 POL(A(x_1)) = x_1 40.56/11.39 POL(B(x_1)) = 1 + x_1 40.56/11.39 POL(a(x_1)) = x_1 40.56/11.39 POL(b(x_1)) = 1 + x_1 40.56/11.39 POL(c(x_1)) = x_1 40.56/11.39 40.56/11.39 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 40.56/11.39 40.56/11.39 a(x1) -> x1 40.56/11.39 a(a(b(x1))) -> c(b(a(a(x1)))) 40.56/11.39 b(c(x1)) -> a(b(x1)) 40.56/11.39 40.56/11.39 40.56/11.39 ---------------------------------------- 40.56/11.39 40.56/11.39 (4) 40.56/11.39 Obligation: 40.56/11.39 Q DP problem: 40.56/11.39 The TRS P consists of the following rules: 40.56/11.39 40.56/11.39 A(a(b(x1))) -> B(a(a(x1))) 40.56/11.39 B(c(x1)) -> A(b(x1)) 40.56/11.39 B(c(x1)) -> B(x1) 40.56/11.39 40.56/11.39 The TRS R consists of the following rules: 40.56/11.39 40.56/11.39 a(x1) -> x1 40.56/11.39 a(a(b(x1))) -> c(b(a(a(x1)))) 40.56/11.39 b(c(x1)) -> a(b(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