details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.62114691734 seconds
cpu usage	3.640558749
max memory	2.22511104E8

stage attributes

key	value
output-size	2117
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 77 ms] (2) QTRS (3) RisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, n__from(n__s(X))) after(0, XS) -> XS after(s(N), cons(X, XS)) -> after(N, activate(XS)) from(X) -> n__from(X) s(X) -> n__s(X) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Quasi precedence: after_2 > activate_1 > from_1 > cons_2 after_2 > activate_1 > from_1 > n__from_1 after_2 > activate_1 > from_1 > n__s_1 after_2 > activate_1 > s_1 > n__s_1 Status: from_1: multiset status cons_2: multiset status n__from_1: multiset status n__s_1: multiset status after_2: [1,2] 0: multiset status s_1: multiset status activate_1: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: from(X) -> cons(X, n__from(n__s(X))) after(0, XS) -> XS after(s(N), cons(X, XS)) -> after(N, activate(XS)) from(X) -> n__from(X) s(X) -> n__s(X) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X ---------------------------------------- (2) Obligation: Q restricted rewrite system: R is empty. Q is empty. ---------------------------------------- (3) RisEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (4) YES popout

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

job log

popout

actions

all output return to TRS Stand 20472