details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.84279 seconds
cpu usage	3.93537
user time	3.7382
system time	0.197168
max virtual memory	1.8341328E7
max residence set size	235732.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, 88 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 6 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: *top*_0(f_1(f_0(g_1(x)))) -> *top*_0(x) f_0(f_1(f_0(g_1(x)))) -> f_0(x) g_0(f_1(f_0(g_1(x)))) -> g_1(x) *top*_0(f_0(f_1(f_0(g_0(x))))) -> *top*_0(f_0(x)) f_0(f_0(f_1(f_0(g_0(x))))) -> f_1(f_0(x)) g_0(f_0(f_1(f_0(g_0(x))))) -> g_0(f_0(x)) f_1(f_0(g_0(x))) -> x *top*_0(f_1(f_0(g_0(x)))) -> *top*_0(x) f_0(f_1(f_0(g_0(x)))) -> f_1(x) g_0(f_1(f_0(g_0(x)))) -> g_0(x) *top*_0(g_1(b_0)) -> *top*_0(f_0(g_1(b_0))) f_0(g_1(b_0)) -> f_1(f_0(g_1(b_0))) g_0(g_1(b_0)) -> g_0(f_0(g_1(b_0))) The replacement map contains the following entries: *top*_0: {1} f_1: empty set f_0: {1} g_1: empty set g_0: {1} b_0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: *top*_0(f_1(f_0(g_1(x)))) -> *top*_0(x) f_0(f_1(f_0(g_1(x)))) -> f_0(x) g_0(f_1(f_0(g_1(x)))) -> g_1(x) *top*_0(f_0(f_1(f_0(g_0(x))))) -> *top*_0(f_0(x)) f_0(f_0(f_1(f_0(g_0(x))))) -> f_1(f_0(x)) g_0(f_0(f_1(f_0(g_0(x))))) -> g_0(f_0(x)) f_1(f_0(g_0(x))) -> x *top*_0(f_1(f_0(g_0(x)))) -> *top*_0(x) f_0(f_1(f_0(g_0(x)))) -> f_1(x) g_0(f_1(f_0(g_0(x)))) -> g_0(x) *top*_0(g_1(b_0)) -> *top*_0(f_0(g_1(b_0))) f_0(g_1(b_0)) -> f_1(f_0(g_1(b_0))) g_0(g_1(b_0)) -> g_0(f_0(g_1(b_0))) The replacement map contains the following entries: *top*_0: {1} f_1: empty set f_0: {1} g_1: empty set g_0: {1} b_0: empty set Used ordering: Polynomial interpretation [POLO]: POL(*top*_0(x_1)) = x_1 POL(b_0) = 0 POL(f_0(x_1)) = x_1 POL(f_1(x_1)) = x_1 POL(g_0(x_1)) = 1 + x_1 POL(g_1(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: g_0(f_1(f_0(g_1(x)))) -> g_1(x) *top*_0(f_0(f_1(f_0(g_0(x))))) -> *top*_0(f_0(x)) f_0(f_0(f_1(f_0(g_0(x))))) -> f_1(f_0(x)) g_0(f_0(f_1(f_0(g_0(x))))) -> g_0(f_0(x)) f_1(f_0(g_0(x))) -> x *top*_0(f_1(f_0(g_0(x)))) -> *top*_0(x) f_0(f_1(f_0(g_0(x)))) -> f_1(x) g_0(f_1(f_0(g_0(x)))) -> g_0(x) popout

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

job log

popout

actions

all output return to TRS Contextsensitive