details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.00624 seconds
cpu usage	4.60312
user time	4.37326
system time	0.229861
max virtual memory	1.8413844E7
max residence set size	334872.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) QDPOrderProof [EQUIVALENT, 44 ms] (7) QDP (8) DependencyGraphProof [EQUIVALENT, 0 ms] (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, n__from(n__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) s(X) -> n__s(X) first(X1, X2) -> n__first(X1, X2) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) activate(X) -> X Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: FIRST(s(X), cons(Y, Z)) -> ACTIVATE(Z) SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z)) SEL(s(X), cons(Y, Z)) -> ACTIVATE(Z) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__first(X1, X2)) -> FIRST(activate(X1), activate(X2)) ACTIVATE(n__first(X1, X2)) -> ACTIVATE(X1) ACTIVATE(n__first(X1, X2)) -> ACTIVATE(X2) The TRS R consists of the following rules: from(X) -> cons(X, n__from(n__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) s(X) -> n__s(X) first(X1, X2) -> n__first(X1, X2) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1, X2)) -> first(activate(X1), activate(X2)) activate(X) -> X Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 3 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: popout

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

job log

popout

actions

all output return to TRS Standard