Derivational Complexity: TRS Innermost pair #487105788

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	292.707 seconds
cpu usage	913.658
user time	905.081
system time	8.57727
max virtual memory	3.766678E7
max residence set size	1.4950328E7

stage attributes

key	value
starexec-result	KILLED

output

KILLED
proof of /export/starexec/sandbox/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), 22 ms]
(4) CpxRelTRS
(5) RenamingProof [BOTH BOUNDS(ID, ID), 0 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) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(12) TRS for Loop Detection
(13) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(14) CpxTRS
(15) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(16) CpxRelTRS
    (17) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (18) CpxWeightedTrs
    (19) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxTypedWeightedTrs
    (21) CompletionProof [UPPER BOUND(ID), 7 ms]
    (22) CpxTypedWeightedCompleteTrs
        (23) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (24) CpxRNTS
    (25) CompletionProof [UPPER BOUND(ID), 5 ms]
    (26) CpxTypedWeightedCompleteTrs
        (27) NarrowingProof [BOTH BOUNDS(ID, ID), 284 ms]
        (28) CpxTypedWeightedCompleteTrs
        (29) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 42 ms]
        (30) CpxRNTS
        (31) InliningProof [UPPER BOUND(ID), 283 ms]
        (32) CpxRNTS
        (33) SimplificationProof [BOTH BOUNDS(ID, ID), 50 ms]
        (34) CpxRNTS
(35) CpxTrsToCdtProof [UPPER BOUND(ID), 21 ms]
(36) CdtProblem
    (37) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (38) CdtProblem
    (39) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 34 ms]
    (40) CdtProblem
    (41) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (42) CdtProblem
    (43) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 133 ms]
    (44) CdtProblem
    (45) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 23 ms]
    (46) CdtProblem
    (47) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 1817 ms]
    (48) CdtProblem
        (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 32 ms]
        (50) CdtProblem
        (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 21 ms]
        (52) CdtProblem
        (53) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 1303 ms]
        (54) CdtProblem
            (55) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 1151 ms]
            (56) CdtProblem
            (57) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 1080 ms]
            (58) CdtProblem
            (59) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 1047 ms]
            (60) CdtProblem
            (61) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1 ms]
            (62) CdtProblem
            (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 14 ms]
            (64) CdtProblem
            (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (66) CdtProblem
            (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (68) CdtProblem
            (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 25 ms]
            (70) CdtProblem
            (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 27 ms]
            (72) CdtProblem
            (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 29 ms]
            (74) CdtProblem
            (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (76) CdtProblem
            (77) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1 ms]
            (78) CdtProblem
            (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 35 ms]
            (80) CdtProblem
            (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (82) CdtProblem
            (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 31 ms]
            (84) CdtProblem
            (85) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 13 ms]
            (86) CdtProblem
            (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 12 ms]
            (88) CdtProblem
            (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (90) CdtProblem
            (91) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
            (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS Innermost