details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.502 seconds
cpu usage	3.53208
user time	3.37274
system time	0.159344
max virtual memory	1.8407092E7
max residence set size	224312.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 39 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 11 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: f_1: empty set g_1: empty set a_0: empty set f_0: {1} b_0: empty set *top*_0: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: f_1: empty set g_1: empty set a_0: empty set f_0: {1} b_0: empty set *top*_0: {1} Used ordering: Polynomial interpretation [POLO]: POL(*top*_0(x_1)) = x_1 POL(a_0) = 1 POL(b_0) = 0 POL(f_0(x_1)) = x_1 POL(f_1(x_1)) = 1 POL(g_1(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: f_1: empty set g_1: empty set a_0: empty set f_0: {1} *top*_0: {1} popout

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

job log

popout

actions

all output return to TRS Contextsensitive