details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.39245390892 seconds
cpu usage	6.160533352
max memory	4.77212672E8

stage attributes

key	value
output-size	5297
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 140 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__and(tt, X) -> mark(X) a__plus(N, 0) -> mark(N) a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M))) a__x(N, 0) -> 0 a__x(N, s(M)) -> a__plus(a__x(mark(N), mark(M)), mark(N)) mark(and(X1, X2)) -> a__and(mark(X1), X2) mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) mark(x(X1, X2)) -> a__x(mark(X1), mark(X2)) mark(tt) -> tt mark(0) -> 0 mark(s(X)) -> s(mark(X)) a__and(X1, X2) -> and(X1, X2) a__plus(X1, X2) -> plus(X1, X2) a__x(X1, X2) -> x(X1, X2) The set Q consists of the following terms: mark(and(x0, x1)) mark(plus(x0, x1)) mark(x(x0, x1)) mark(tt) mark(0) mark(s(x0)) a__and(x0, x1) a__plus(x0, x1) a__x(x0, x1) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: a__and/2(YES,YES) tt/0) mark/1)YES( a__plus/2(YES,YES) 0/0) s/1(YES) a__x/2(YES,YES) and/2(YES,YES) plus/2(YES,YES) x/2(YES,YES) Quasi precedence: [a__and_2, and_2] > s_1 tt > s_1 [a__x_2, x_2] > [a__plus_2, plus_2] > s_1 [a__x_2, x_2] > 0 > s_1 Status: a__and_2: [1,2] tt: multiset status a__plus_2: [1,2] 0: multiset status s_1: multiset status a__x_2: multiset status and_2: [1,2] plus_2: [1,2] x_2: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a__and(tt, X) -> mark(X) a__plus(N, 0) -> mark(N) a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M))) a__x(N, 0) -> 0 a__x(N, s(M)) -> a__plus(a__x(mark(N), mark(M)), mark(N)) popout

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

job log

popout

actions

all output return to TRS Innermost