details

property	value
status	complete
benchmark	ExProp7_Luc06.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n113.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.50478 seconds
cpu usage	3.28499
user time	3.13634
system time	0.148645
max virtual memory	1.8407068E7
max residence set size	207680.0

stage attributes

key	value
starexec-result	YES

output

3.20/1.46 YES 3.24/1.47 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.24/1.47 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.24/1.47 3.24/1.47 3.24/1.47 Termination of the given CSR could be proven: 3.24/1.47 3.24/1.47 (0) CSR 3.24/1.47 (1) CSRRRRProof [EQUIVALENT, 74 ms] 3.24/1.47 (2) CSR 3.24/1.47 (3) CSRRRRProof [EQUIVALENT, 0 ms] 3.24/1.47 (4) CSR 3.24/1.47 (5) CSRRRRProof [EQUIVALENT, 6 ms] 3.24/1.47 (6) CSR 3.24/1.47 (7) RisEmptyProof [EQUIVALENT, 0 ms] 3.24/1.47 (8) YES 3.24/1.47 3.24/1.47 3.24/1.47 ---------------------------------------- 3.24/1.47 3.24/1.47 (0) 3.24/1.47 Obligation: 3.24/1.47 Context-sensitive rewrite system: 3.24/1.47 The TRS R consists of the following rules: 3.24/1.47 3.24/1.47 f(0) -> cons(0, f(s(0))) 3.24/1.47 f(s(0)) -> f(p(s(0))) 3.24/1.47 p(s(X)) -> X 3.24/1.47 3.24/1.47 The replacement map contains the following entries: 3.24/1.47 3.24/1.47 f: {1} 3.24/1.47 0: empty set 3.24/1.47 cons: {1} 3.24/1.47 s: {1} 3.24/1.47 p: {1} 3.24/1.47 3.24/1.47 ---------------------------------------- 3.24/1.47 3.24/1.47 (1) CSRRRRProof (EQUIVALENT) 3.24/1.47 The following CSR is given: Context-sensitive rewrite system: 3.24/1.47 The TRS R consists of the following rules: 3.24/1.47 3.24/1.47 f(0) -> cons(0, f(s(0))) 3.24/1.47 f(s(0)) -> f(p(s(0))) 3.24/1.47 p(s(X)) -> X 3.24/1.47 3.24/1.47 The replacement map contains the following entries: 3.24/1.47 3.24/1.47 f: {1} 3.24/1.47 0: empty set 3.24/1.47 cons: {1} 3.24/1.47 s: {1} 3.24/1.47 p: {1} 3.24/1.47 Used ordering: 3.24/1.47 Polynomial interpretation [POLO]: 3.24/1.47 3.24/1.47 POL(0) = 0 3.24/1.47 POL(cons(x_1, x_2)) = x_1 3.24/1.47 POL(f(x_1)) = 1 + x_1 3.24/1.47 POL(p(x_1)) = 2*x_1 3.24/1.47 POL(s(x_1)) = 2*x_1 3.24/1.47 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 3.24/1.47 3.24/1.47 f(0) -> cons(0, f(s(0))) 3.24/1.47 3.24/1.47 3.24/1.47 3.24/1.47 3.24/1.47 ---------------------------------------- 3.24/1.47 3.24/1.47 (2) 3.24/1.47 Obligation: 3.24/1.47 Context-sensitive rewrite system: 3.24/1.47 The TRS R consists of the following rules: 3.24/1.47 3.24/1.47 f(s(0)) -> f(p(s(0))) 3.24/1.47 p(s(X)) -> X 3.24/1.47 3.24/1.47 The replacement map contains the following entries: 3.24/1.47 3.24/1.47 f: {1} 3.24/1.47 0: empty set 3.24/1.47 s: {1} 3.24/1.47 p: {1} 3.24/1.47 3.24/1.47 ---------------------------------------- 3.24/1.47 3.24/1.47 (3) CSRRRRProof (EQUIVALENT) 3.24/1.47 The following CSR is given: Context-sensitive rewrite system: 3.24/1.47 The TRS R consists of the following rules: 3.24/1.47 3.24/1.47 f(s(0)) -> f(p(s(0))) 3.24/1.47 p(s(X)) -> X 3.24/1.47 3.24/1.47 The replacement map contains the following entries: 3.24/1.47 3.24/1.47 f: {1} 3.24/1.47 0: empty set 3.24/1.47 s: {1} popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07