details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.49170899391 seconds
cpu usage	6.629190136
max memory	4.94026752E8

stage attributes

key	value
output-size	6318
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 79 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (12) QDP (13) NonTerminationLoopProof [COMPLETE, 0 ms] (14) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(b, X, c) -> a__f(X, a__c, X) a__c -> b mark(f(X1, X2, X3)) -> a__f(X1, mark(X2), X3) mark(c) -> a__c mark(b) -> b a__f(X1, X2, X3) -> f(X1, X2, X3) a__c -> c Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a__c) = 0 POL(a__f(x_1, x_2, x_3)) = 2 + x_1 + 2*x_2 + x_3 POL(b) = 0 POL(c) = 0 POL(f(x_1, x_2, x_3)) = 2 + x_1 + 2*x_2 + x_3 POL(mark(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: mark(f(X1, X2, X3)) -> a__f(X1, mark(X2), X3) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(b, X, c) -> a__f(X, a__c, X) a__c -> b mark(c) -> a__c mark(b) -> b a__f(X1, X2, X3) -> f(X1, X2, X3) a__c -> c Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a__c) = 0 POL(a__f(x_1, x_2, x_3)) = 1 + x_1 + 2*x_2 + x_3 POL(b) = 0 POL(c) = 0 POL(f(x_1, x_2, x_3)) = x_1 + 2*x_2 + x_3 POL(mark(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a__f(X1, X2, X3) -> f(X1, X2, X3) popout

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

job log

popout

actions

all output return to TRS Standard