Derivational Complexity: TRS Innermost pair #487105872

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.661 seconds
cpu usage	1123.12
user time	1109.78
system time	13.3426
max virtual memory	3.7643124E7
max residence set size	1.4860044E7

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), 222 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) RewriteLemmaProof [LOWER BOUND(ID), 285 ms]
    (12) BOUNDS(1, INF)
(13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(14) TRS for Loop Detection
(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), 305 ms]
        (26) CpxTypedWeightedCompleteTrs
        (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (28) CpxRNTS
        (29) InliningProof [UPPER BOUND(ID), 0 ms]
        (30) CpxRNTS
        (31) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (32) CpxRNTS
        (33) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
        (34) CpxRNTS
        (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (36) CpxRNTS
        (37) IntTrsBoundProof [UPPER BOUND(ID), 74 ms]
        (38) CpxRNTS
        (39) IntTrsBoundProof [UPPER BOUND(ID), 33 ms]
        (40) CpxRNTS
        (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (42) CpxRNTS
        (43) IntTrsBoundProof [UPPER BOUND(ID), 201 ms]
        (44) CpxRNTS
        (45) IntTrsBoundProof [UPPER BOUND(ID), 14 ms]
        (46) CpxRNTS
        (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (48) CpxRNTS
        (49) IntTrsBoundProof [UPPER BOUND(ID), 372 ms]
        (50) CpxRNTS
        (51) IntTrsBoundProof [UPPER BOUND(ID), 5 ms]
        (52) CpxRNTS
        (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (54) CpxRNTS
        (55) IntTrsBoundProof [UPPER BOUND(ID), 76 ms]
        (56) CpxRNTS
        (57) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
        (58) CpxRNTS
        (59) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (60) CpxRNTS
        (61) IntTrsBoundProof [UPPER BOUND(ID), 643 ms]
        (62) CpxRNTS
        (63) IntTrsBoundProof [UPPER BOUND(ID), 276 ms]
        (64) CpxRNTS
    (65) CompletionProof [UPPER BOUND(ID), 0 ms]
    (66) CpxTypedWeightedCompleteTrs
        (67) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (68) CpxRNTS
(69) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(70) CdtProblem
    (71) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (72) CdtProblem
    (73) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (74) CdtProblem
    (75) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (76) CdtProblem
    (77) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (78) CdtProblem
    (79) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 8 ms]
    (80) CdtProblem
    (81) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 108 ms]
    (82) CdtProblem
    (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (84) CdtProblem
    (85) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (86) CdtProblem
    (87) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (88) CdtProblem
    (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (90) CdtProblem
    (91) CdtLeafRemovalProof [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