details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.35896 seconds
cpu usage	5.14699
user time	4.89425
system time	0.252736
max virtual memory	1.8546104E7
max residence set size	346128.0

stage attributes

key	value
starexec-result	NO

output

NO 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 disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) UsableRulesReductionPairsProof [EQUIVALENT, 9 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesReductionPairsProof [EQUIVALENT, 7 ms] (12) QDP (13) TransformationProof [EQUIVALENT, 0 ms] (14) QDP (15) NonTerminationLoopProof [COMPLETE, 0 ms] (16) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(X) -> g(X, X) g(a, X) -> f(b, activate(X)) f(X, X) -> h(a) a -> b 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: H(X) -> G(X, X) G(a, X) -> F(b, activate(X)) G(a, X) -> ACTIVATE(X) F(X, X) -> H(a) F(X, X) -> A The TRS R consists of the following rules: h(X) -> g(X, X) g(a, X) -> f(b, activate(X)) f(X, X) -> h(a) a -> b 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 1 SCC with 2 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: G(a, X) -> F(b, activate(X)) F(X, X) -> H(a) H(X) -> G(X, X) The TRS R consists of the following rules: h(X) -> g(X, X) g(a, X) -> f(b, activate(X)) f(X, X) -> h(a) a -> b activate(X) -> X Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) UsableRulesReductionPairsProof (EQUIVALENT) By using the usable rules with reduction pair processor [LPAR04] with a polynomial ordering [POLO], all dependency pairs and the corresponding usable rules [FROCOS05] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well. No dependency pairs are removed. popout

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

job log

popout

actions

all output return to TRS Standard