Derivational Complexity: TRS pair #487104174

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.819 seconds
cpu usage	1133.7
user time	1124.17
system time	9.52726
max virtual memory	1.9217844E7
max residence set size	1.4760772E7

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 (full) 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), 476 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), 3 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) RcToIrcProof [BOTH BOUNDS(ID, ID), 85 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) CompletionProof [UPPER BOUND(ID), 5 ms]
        (26) CpxTypedWeightedCompleteTrs
            (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (28) CpxRNTS
    (29) CpxTrsToCdtProof [UPPER BOUND(ID), 44 ms]
    (30) CdtProblem
        (31) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (32) CdtProblem
        (33) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (34) CdtProblem
        (35) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (36) CdtProblem
        (37) CdtLeafRemovalProof [ComplexityIfPolyImplication, 5 ms]
        (38) CdtProblem
        (39) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 66 ms]
        (40) CdtProblem
        (41) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 38 ms]
        (42) CdtProblem
        (43) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (44) CdtProblem
        (45) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (46) CdtProblem
        (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 35 ms]
        (48) CdtProblem
        (49) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (50) CdtProblem
        (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 68 ms]
        (52) CdtProblem
        (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 14 ms]
        (54) CdtProblem
        (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 90 ms]
        (56) CdtProblem
        (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (58) CdtProblem
        (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 80 ms]
        (60) CdtProblem
        (61) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 30 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 37 ms]
        (64) CdtProblem
        (65) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (66) CdtProblem
        (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 40 ms]
        (68) CdtProblem
        (69) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 3 ms]
        (70) CdtProblem
        (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 459 ms]
        (72) CdtProblem
        (73) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 127 ms]
        (74) CdtProblem
        (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 720 ms]
        (76) CdtProblem
        (77) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 187 ms]
        (78) CdtProblem
        (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 924 ms]
        (80) CdtProblem
        (81) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 257 ms]
        (82) CdtProblem
        (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 364 ms]
        (84) CdtProblem
        (85) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 89 ms]
        (86) CdtProblem
        (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 9 ms]
        (88) CdtProblem
        (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 48 ms]
        (90) CdtProblem
        (91) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 27 ms]
        (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS