Derivational Complexity: TRS Innermost pair #487109136

details

property	value
status	complete
benchmark	LISTUTILITIES_nosorts_noand_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)	296.889 seconds
cpu usage	1161.76
user time	1150.99
system time	10.7682
max virtual memory	1.9405468E7
max residence set size	1.524026E7

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), 1241 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), 13 ms]
    (10) typed CpxTrs
    (11) OrderProof [LOWER BOUND(ID), 0 ms]
    (12) typed CpxTrs
(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), 0 ms]
    (22) CpxTypedWeightedCompleteTrs
    (23) CompletionProof [UPPER BOUND(ID), 0 ms]
    (24) CpxTypedWeightedCompleteTrs
        (25) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 31 ms]
        (26) CpxRNTS
(27) CpxTrsToCdtProof [UPPER BOUND(ID), 116 ms]
(28) CdtProblem
    (29) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 12 ms]
    (30) CdtProblem
    (31) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (32) CdtProblem
    (33) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (34) CdtProblem
    (35) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (36) CdtProblem
    (37) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 575 ms]
    (38) CdtProblem
    (39) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 156 ms]
    (40) CdtProblem
    (41) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (42) CdtProblem
    (43) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 180 ms]
    (44) CdtProblem
    (45) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 7 ms]
    (46) CdtProblem
    (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 681 ms]
    (48) CdtProblem
    (49) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 75 ms]
    (50) CdtProblem
    (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1204 ms]
    (52) CdtProblem
    (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 134 ms]
    (54) CdtProblem
    (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 369 ms]
    (56) CdtProblem
    (57) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 57 ms]
    (58) CdtProblem
    (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 898 ms]
    (60) CdtProblem
    (61) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 72 ms]
    (62) CdtProblem
    (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1065 ms]
    (64) CdtProblem
    (65) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 88 ms]
    (66) CdtProblem
    (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1192 ms]
    (68) CdtProblem
    (69) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 161 ms]
    (70) CdtProblem
    (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1352 ms]
    (72) CdtProblem
    (73) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 183 ms]
    (74) CdtProblem
    (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1562 ms]
    (76) CdtProblem
    (77) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 198 ms]
    (78) CdtProblem
    (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 3193 ms]
    (80) CdtProblem
    (81) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 372 ms]
    (82) CdtProblem
    (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 3719 ms]
    (84) CdtProblem
    (85) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 472 ms]
    (86) CdtProblem
    (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 976 ms]
    (88) CdtProblem
    (89) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 463 ms]
    (90) CdtProblem
    (91) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2391 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