Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS pair #487103838
details
property
value
status
complete
benchmark
Ex16_Luc06_L.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)
1.62146 seconds
cpu usage
3.71587
user time
3.56707
system time
0.148798
max virtual memory
1.8544664E7
max residence set size
246940.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), 42 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: f(X) -> f(a) b -> a 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(a) -> a encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_b) -> b encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_b -> b ---------------------------------------- (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: f(X) -> f(a) b -> a The (relative) TRS S consists of the following rules: encArg(a) -> a encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_b) -> b encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_b -> b 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). The TRS R consists of the following rules: f(X) -> f(a) b -> a The (relative) TRS S consists of the following rules: encArg(a) -> a encArg(cons_f(x_1)) -> f(encArg(x_1)) encArg(cons_b) -> b encode_f(x_1) -> f(encArg(x_1)) encode_a -> a encode_b -> b Rewrite Strategy: FULL ---------------------------------------- (5) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS