details

property	value
status	complete
benchmark	MYNAT_nosorts-noand-peanoSimple.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n098.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	6.38374304771 seconds
cpu usage	5.209097578
max memory	4.79346688E8

stage attributes

key	value
output-size	4625
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Context Sensitive