Derivational Complexity: TRS Innermost pair #487109076

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	294.667 seconds
cpu usage	1139.15
user time	1126.25
system time	12.9084
max virtual memory	1.8973884E7
max residence set size	1.4989156E7

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), 197 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), 3410 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), 180 ms]
        (26) CpxTypedWeightedCompleteTrs
        (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
        (28) CpxRNTS
        (29) SimplificationProof [BOTH BOUNDS(ID, ID), 8 ms]
        (30) CpxRNTS
    (31) CompletionProof [UPPER BOUND(ID), 0 ms]
    (32) CpxTypedWeightedCompleteTrs
        (33) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 16 ms]
        (34) CpxRNTS
(35) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(36) CdtProblem
    (37) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (38) CdtProblem
    (39) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (40) CdtProblem
    (41) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 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) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (50) CdtProblem
    (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (52) CdtProblem
    (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (54) CdtProblem
    (55) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (56) CdtProblem
    (57) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (58) CdtProblem
    (59) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (60) CdtProblem
    (61) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 12 ms]
    (62) CdtProblem
    (63) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 8 ms]
    (64) CdtProblem
    (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (66) CdtProblem
    (67) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (68) CdtProblem
    (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 12 ms]
    (70) CdtProblem
    (71) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (72) CdtProblem
    (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (74) CdtProblem
    (75) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (76) CdtProblem
    (77) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (78) CdtProblem
    (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 13 ms]
    (80) CdtProblem
    (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (82) CdtProblem
    (83) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (84) CdtProblem
    (85) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (86) CdtProblem
    (87) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (88) CdtProblem
    (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (90) CdtProblem
    (91) CdtLeafRemovalProof [ComplexityIfPolyImplication, 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