details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	6.62996792793 seconds
cpu usage	6.253672343
max memory	4.77261824E8

stage attributes

key	value
output-size	3006
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, 102 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 2 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, n__from(s(X))) first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) sel(0, cons(X, Z)) -> X sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) from(X) -> n__from(X) first(X1, X2) -> n__first(X1, X2) activate(n__from(X)) -> from(X) activate(n__first(X1, X2)) -> first(X1, X2) activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: from/1(YES) cons/2(YES,YES) n__from/1)YES( s/1(YES) first/2(YES,YES) 0/0) nil/0) n__first/2(YES,YES) activate/1(YES) sel/2(YES,YES) Quasi precedence: 0 > nil > cons_2 sel_2 > [from_1, first_2, activate_1] > s_1 > n__first_2 > cons_2 sel_2 > [from_1, first_2, activate_1] > nil > cons_2 Status: from_1: [1] cons_2: multiset status s_1: multiset status first_2: [2,1] 0: multiset status nil: multiset status n__first_2: [1,2] activate_1: [1] sel_2: [1,2] 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(s(X))) first(0, Z) -> nil first(s(X), cons(Y, Z)) -> cons(Y, n__first(X, activate(Z))) sel(0, cons(X, Z)) -> X sel(s(X), cons(Y, Z)) -> sel(X, activate(Z)) from(X) -> n__from(X) first(X1, X2) -> n__first(X1, X2) activate(n__first(X1, X2)) -> first(X1, X2) activate(X) -> X ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: activate(n__from(X)) -> from(X) Q is empty. popout

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

job log

popout

actions

all output return to TRS Standard