details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.54694914818 seconds
cpu usage	6.936427579
max memory	4.84573184E8

stage attributes

key	value
output-size	26495
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 72 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 8 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 19 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 23 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) MRRProof [EQUIVALENT, 0 ms] (14) QDP (15) MRRProof [EQUIVALENT, 0 ms] (16) QDP (17) MRRProof [EQUIVALENT, 18 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPQMonotonicMRRProof [EQUIVALENT, 27 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) QReductionProof [EQUIVALENT, 0 ms] (28) QDP (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__incr(nil) -> nil a__incr(cons(X, L)) -> cons(s(mark(X)), incr(L)) a__adx(nil) -> nil a__adx(cons(X, L)) -> a__incr(cons(mark(X), adx(L))) a__nats -> a__adx(a__zeros) a__zeros -> cons(0, zeros) a__head(cons(X, L)) -> mark(X) a__tail(cons(X, L)) -> mark(L) mark(incr(X)) -> a__incr(mark(X)) mark(adx(X)) -> a__adx(mark(X)) mark(nats) -> a__nats mark(zeros) -> a__zeros mark(head(X)) -> a__head(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) mark(0) -> 0 a__incr(X) -> incr(X) a__adx(X) -> adx(X) a__nats -> nats a__zeros -> zeros a__head(X) -> head(X) a__tail(X) -> tail(X) The set Q consists of the following terms: a__nats a__zeros mark(incr(x0)) mark(adx(x0)) mark(nats) mark(zeros) mark(head(x0)) mark(tail(x0)) mark(nil) mark(cons(x0, x1)) mark(s(x0)) mark(0) a__incr(x0) a__adx(x0) a__head(x0) a__tail(x0) ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Inner 89993