Derivational Complexity: TRS pair #487104182

details

property	value
status	complete
benchmark	PALINDROME_nokinds_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)	293.989 seconds
cpu usage	1153.43
user time	1143.34
system time	10.0885
max virtual memory	1.938468E7
max residence set size	1.4813068E7

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 (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), 821 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), 11 ms]
    (12) typed CpxTrs
(13) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(14) CpxTRS
(15) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(16) CpxRelTRS
    (17) RcToIrcProof [BOTH BOUNDS(ID, ID), 169 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), 12 ms]
        (24) CpxTypedWeightedCompleteTrs
            (25) NarrowingProof [BOTH BOUNDS(ID, ID), 44.7 s]
            (26) CpxTypedWeightedCompleteTrs
            (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 18 ms]
            (28) CpxRNTS
            (29) SimplificationProof [BOTH BOUNDS(ID, ID), 10 ms]
            (30) CpxRNTS
        (31) CompletionProof [UPPER BOUND(ID), 7 ms]
        (32) CpxTypedWeightedCompleteTrs
            (33) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 33 ms]
            (34) CpxRNTS
    (35) CpxTrsToCdtProof [UPPER BOUND(ID), 38 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), 4 ms]
        (42) CdtProblem
        (43) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (44) CdtProblem
        (45) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 140 ms]
        (46) CdtProblem
        (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 59 ms]
        (48) CdtProblem
        (49) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (50) CdtProblem
        (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 45 ms]
        (52) CdtProblem
        (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (54) CdtProblem
        (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 129 ms]
        (56) CdtProblem
        (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 36 ms]
        (58) CdtProblem
        (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 52 ms]
        (60) CdtProblem
        (61) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 12 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 192 ms]
        (64) CdtProblem
        (65) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 47 ms]
        (66) CdtProblem
        (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 95 ms]
        (68) CdtProblem
        (69) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 23 ms]
        (70) CdtProblem
        (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 80 ms]
        (72) CdtProblem
        (73) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 12 ms]
        (74) CdtProblem
        (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (76) CdtProblem
        (77) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 11 ms]
        (78) CdtProblem
        (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 265 ms]
        (80) CdtProblem
        (81) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 70 ms]
        (82) CdtProblem
        (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 117 ms]
        (84) CdtProblem
        (85) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 15 ms]
        (86) CdtProblem
        (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 103 ms]
        (88) CdtProblem
        (89) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (90) CdtProblem
        (91) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 411 ms]
        (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS