details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	1.74017 seconds
cpu usage	3.90156
user time	3.72019
system time	0.18137
max virtual memory	1.8676764E7
max residence set size	271808.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(INF, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 34 ms] (4) CpxRelTRS (5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (6) TRS for Loop Detection (7) InfiniteLowerBoundProof [FINISHED, 0 ms] (8) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) c -> n__c activate(n__g(X)) -> g(X) activate(n__c) -> c activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(n__g(x_1)) -> n__g(encArg(x_1)) encArg(n__c) -> n__c encArg(cons_c) -> c encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_activate(x_1)) -> activate(encArg(x_1)) encode_c -> c encode_f(x_1) -> f(encArg(x_1)) encode_n__g(x_1) -> n__g(encArg(x_1)) encode_n__c -> n__c encode_g(x_1) -> g(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) c -> n__c activate(n__g(X)) -> g(X) activate(n__c) -> c activate(X) -> X The (relative) TRS S consists of the following rules: encArg(n__g(x_1)) -> n__g(encArg(x_1)) encArg(n__c) -> n__c encArg(cons_c) -> c encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_g(x_1)) -> g(encArg(x_1)) encArg(cons_activate(x_1)) -> activate(encArg(x_1)) encode_c -> c encode_f(x_1) -> f(encArg(x_1)) encode_n__g(x_1) -> n__g(encArg(x_1)) encode_n__c -> n__c encode_g(x_1) -> g(encArg(x_1)) encode_activate(x_1) -> activate(encArg(x_1)) Rewrite Strategy: FULL ---------------------------------------- (3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) proved innermost termination of relative rules ---------------------------------------- (4) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS