Derivational Complexity: TRS Innermost pair #487104996

details

property	value
status	complete
benchmark	size-12-alpha-3-num-465.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n146.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.632 seconds
cpu usage	739.855
user time	733.525
system time	6.33056
max virtual memory	3.7118836E7
max residence set size	7734256.0

stage attributes

key	value
starexec-result	KILLED

output

KILLED
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(1, INF).

(0) DCpxTrs
(1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxRelTRS
(3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 54 ms]
(4) CpxRelTRS
(5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(6) TRS for Loop Detection
(7) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(8) CpxRelTRS
    (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (10) typed CpxTrs
    (11) OrderProof [LOWER BOUND(ID), 0 ms]
    (12) typed CpxTrs
    (13) RewriteLemmaProof [LOWER BOUND(ID), 432 ms]
    (14) BOUNDS(1, INF)
(15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(16) CpxTRS
(17) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(18) CpxRelTRS
    (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxWeightedTrs
    (21) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (22) CpxTypedWeightedTrs
    (23) CompletionProof [UPPER BOUND(ID), 0 ms]
    (24) CpxTypedWeightedCompleteTrs
        (25) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (26) CpxTypedWeightedCompleteTrs
        (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 5 ms]
        (28) CpxRNTS
        (29) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (30) CpxRNTS
    (31) CompletionProof [UPPER BOUND(ID), 0 ms]
    (32) CpxTypedWeightedCompleteTrs
        (33) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 6 ms]
        (34) CpxRNTS
(35) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(36) CdtProblem
    (37) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (38) CdtProblem
    (39) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (40) CdtProblem
    (41) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 1 ms]
    (42) CdtProblem
    (43) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (44) CdtProblem
    (45) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
    (46) CdtProblem
    (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (48) CdtProblem
    (49) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (50) CdtProblem
    (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (52) CdtProblem
    (53) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (54) CdtProblem
    (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (56) CdtProblem
    (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (58) CdtProblem
    (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (60) CdtProblem
    (61) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (62) CdtProblem
    (63) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (64) CdtProblem
    (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (66) CdtProblem
    (67) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (68) CdtProblem
    (69) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (70) CdtProblem
    (71) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (72) CdtProblem
    (73) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (74) CdtProblem
    (75) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 6 ms]
    (76) CdtProblem
    (77) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (78) CdtProblem


----------------------------------------

(0)
Obligation:
The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   a(x1) -> b(c(b(x1)))
   a(b(x1)) -> x1
   c(c(b(x1))) -> a(c(c(x1)))

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS Innermost