Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS pair #487100702
details
property
value
status
complete
benchmark
secr8.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
291.691 seconds
cpu usage
1081.95
user time
1070.09
system time
11.8644
max virtual memory
3.711678E7
max residence set size
1.4874436E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) 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(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 36 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 7 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 513 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 186 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 183 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 98 ms] (22) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: b(b(b(x1))) -> a(x1) a(a(x1)) -> a(b(a(x1))) b(c(x1)) -> c(a(a(x1))) a(c(x1)) -> c(b(b(x1))) a(a(a(x1))) -> b(a(a(x1))) 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(c(x_1)) -> c(encArg(x_1)) encArg(cons_b(x_1)) -> b(encArg(x_1)) encArg(cons_a(x_1)) -> a(encArg(x_1)) encode_b(x_1) -> b(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_c(x_1) -> c(encArg(x_1)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: b(b(b(x1))) -> a(x1) a(a(x1)) -> a(b(a(x1))) b(c(x1)) -> c(a(a(x1))) a(c(x1)) -> c(b(b(x1))) a(a(a(x1))) -> b(a(a(x1))) The (relative) TRS S consists of the following rules: encArg(c(x_1)) -> c(encArg(x_1)) encArg(cons_b(x_1)) -> b(encArg(x_1)) encArg(cons_a(x_1)) -> a(encArg(x_1)) encode_b(x_1) -> b(encArg(x_1)) encode_a(x_1) -> a(encArg(x_1)) encode_c(x_1) -> c(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(n^1, INF). The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS