details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.47839283943 seconds
cpu usage	5.463467929
max memory	4.83106816E8

stage attributes

key	value
output-size	4294
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 100 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 7 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 4 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_1(x)) -> f_1(i_1(x)) h_1(x) -> f_1(h_1(x)) *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(i_1(x)) -> x i_1(x) -> h_1(x) The replacement map contains the following entries: f_1: empty set h_1: empty set i_1: empty set *top*_0: {1} f_0: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_1(x)) -> f_1(i_1(x)) h_1(x) -> f_1(h_1(x)) *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(i_1(x)) -> x i_1(x) -> h_1(x) The replacement map contains the following entries: f_1: empty set h_1: empty set i_1: empty set *top*_0: {1} f_0: {1} Used ordering: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(f_1(x_1)) = [[0], [0]] + [[1, 0], [0, 1]] * x_1 >>> <<< POL(h_1(x_1)) = [[1], [1]] + [[1, 1], [1, 1]] * x_1 >>> <<< POL(i_1(x_1)) = [[1], [1]] + [[1, 1], [1, 1]] * x_1 >>> <<< POL(*top*_0(x_1)) = [[1], [1]] + [[1, 0], [0, 1]] * x_1 >>> <<< POL(f_0(x_1)) = [[1], [1]] + [[1, 1], [1, 1]] * x_1 >>> With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(i_1(x)) -> x ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Context Sensitive