Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS pair #487104110
details
property
value
status
complete
benchmark
Ex5_Zan97_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_04
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
291.566 seconds
cpu usage
1121.3
user time
1108.92
system time
12.375
max virtual memory
3.7248548E7
max residence set size
1.494862E7
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), 244 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 1 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 922 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), 778 ms] (18) 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: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) 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) -> c encArg(f(x_1)) -> f(encArg(x_1)) encArg(true) -> true encArg(false) -> false encArg(if(x_1, x_2, x_3)) -> if(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_a__f(x_1)) -> a__f(encArg(x_1)) encArg(cons_a__if(x_1, x_2, x_3)) -> a__if(encArg(x_1), encArg(x_2), encArg(x_3)) encArg(cons_mark(x_1)) -> mark(encArg(x_1)) encode_a__f(x_1) -> a__f(encArg(x_1)) encode_a__if(x_1, x_2, x_3) -> a__if(encArg(x_1), encArg(x_2), encArg(x_3)) encode_mark(x_1) -> mark(encArg(x_1)) encode_c -> c encode_f(x_1) -> f(encArg(x_1)) encode_true -> true encode_false -> false encode_if(x_1, x_2, x_3) -> if(encArg(x_1), encArg(x_2), encArg(x_3)) ---------------------------------------- (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: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) The (relative) TRS S consists of the following rules: encArg(c) -> c encArg(f(x_1)) -> f(encArg(x_1)) encArg(true) -> true encArg(false) -> false encArg(if(x_1, x_2, x_3)) -> if(encArg(x_1), encArg(x_2), encArg(x_3))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS