details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.2138 seconds
cpu usage	5.37496
user time	5.1386
system time	0.236352
max virtual memory	1.8482152E7
max residence set size	352844.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) QDP (5) TransformationProof [EQUIVALENT, 8 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 37 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(a, b, X) -> a__f(mark(X), X, mark(X)) a__c -> a a__c -> b mark(f(X1, X2, X3)) -> a__f(mark(X1), X2, mark(X3)) mark(c) -> a__c mark(a) -> a mark(b) -> b a__f(X1, X2, X3) -> f(X1, X2, X3) a__c -> c The set Q consists of the following terms: a__c mark(f(x0, x1, x2)) mark(c) mark(a) mark(b) a__f(x0, x1, x2) ---------------------------------------- (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: A__F(a, b, X) -> A__F(mark(X), X, mark(X)) A__F(a, b, X) -> MARK(X) MARK(f(X1, X2, X3)) -> A__F(mark(X1), X2, mark(X3)) MARK(f(X1, X2, X3)) -> MARK(X1) MARK(f(X1, X2, X3)) -> MARK(X3) MARK(c) -> A__C The TRS R consists of the following rules: a__f(a, b, X) -> a__f(mark(X), X, mark(X)) a__c -> a a__c -> b mark(f(X1, X2, X3)) -> a__f(mark(X1), X2, mark(X3)) mark(c) -> a__c mark(a) -> a mark(b) -> b a__f(X1, X2, X3) -> f(X1, X2, X3) a__c -> c The set Q consists of the following terms: a__c mark(f(x0, x1, x2)) mark(c) mark(a) mark(b) a__f(x0, x1, x2) 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 1 less node. ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Innermost