details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.17185 seconds
cpu usage	5.16452
user time	4.93974
system time	0.224779
max virtual memory	1.8408912E7
max residence set size	314744.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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 145 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 16 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 14 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 1 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(and(tt, X)) -> mark(X) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(s(plus(N, M))) active(x(N, 0)) -> mark(0) active(x(N, s(M))) -> mark(plus(x(N, M), N)) mark(and(X1, X2)) -> active(and(mark(X1), X2)) mark(tt) -> active(tt) mark(plus(X1, X2)) -> active(plus(mark(X1), mark(X2))) mark(0) -> active(0) mark(s(X)) -> active(s(mark(X))) mark(x(X1, X2)) -> active(x(mark(X1), mark(X2))) and(mark(X1), X2) -> and(X1, X2) and(X1, mark(X2)) -> and(X1, X2) and(active(X1), X2) -> and(X1, X2) and(X1, active(X2)) -> and(X1, X2) plus(mark(X1), X2) -> plus(X1, X2) plus(X1, mark(X2)) -> plus(X1, X2) plus(active(X1), X2) -> plus(X1, X2) plus(X1, active(X2)) -> plus(X1, X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) x(mark(X1), X2) -> x(X1, X2) x(X1, mark(X2)) -> x(X1, X2) x(active(X1), X2) -> x(X1, X2) x(X1, active(X2)) -> x(X1, X2) The set Q consists of the following terms: active(and(tt, x0)) active(plus(x0, 0)) active(plus(x0, s(x1))) active(x(x0, 0)) active(x(x0, s(x1))) mark(and(x0, x1)) mark(tt) mark(plus(x0, x1)) mark(0) mark(s(x0)) mark(x(x0, x1)) and(mark(x0), x1) and(x0, mark(x1)) and(active(x0), x1) and(x0, active(x1)) plus(mark(x0), x1) plus(x0, mark(x1)) plus(active(x0), x1) plus(x0, active(x1)) s(mark(x0)) s(active(x0)) x(mark(x0), x1) x(x0, mark(x1)) x(active(x0), x1) x(x0, active(x1)) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: active/1)YES( and/2(YES,YES) tt/0) mark/1)YES( plus/2(YES,YES) 0/0) s/1(YES) x/2(YES,YES) Quasi precedence: [0, x_2] > plus_2 > s_1 popout

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

job log

popout

actions

all output return to TRS Innermost