details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	9.34802103043 seconds
cpu usage	8.380421588
max memory	5.67808E8

stage attributes

key	value
output-size	7043
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 19 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 9 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) NonTerminationLoopProof [COMPLETE, 138 ms] (10) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(a, b, X) -> a__f(X, X, mark(X)) a__c -> a a__c -> b mark(f(X1, X2, X3)) -> a__f(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 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: A__F(a, b, X) -> A__F(X, X, mark(X)) A__F(a, b, X) -> MARK(X) MARK(f(X1, X2, X3)) -> A__F(X1, X2, mark(X3)) 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(X, X, mark(X)) a__c -> a a__c -> b mark(f(X1, X2, X3)) -> a__f(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 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 1 less node. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A__F(a, b, X) -> MARK(X) MARK(f(X1, X2, X3)) -> A__F(X1, X2, mark(X3)) A__F(a, b, X) -> A__F(X, X, mark(X)) MARK(f(X1, X2, X3)) -> MARK(X3) The TRS R consists of the following rules: a__f(a, b, X) -> a__f(X, X, mark(X)) a__c -> a a__c -> b mark(f(X1, X2, X3)) -> a__f(X1, X2, mark(X3)) mark(c) -> a__c mark(a) -> a popout

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

job log

popout

actions

all output return to TRS Standard