Derivational Complexity: TRS pair #487103506

details

property	value
status	complete
benchmark	157150.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	ICFP_2010

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.958 seconds
cpu usage	1156.85
user time	1150.08
system time	6.77293
max virtual memory	1.8951164E7
max residence set size	1.4852432E7

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), 125 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), 16 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) RcToIrcProof [BOTH BOUNDS(ID, ID), 841 ms]
    (18) CpxRelTRS
    (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxWeightedTrs
        (21) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 35 ms]
        (22) CpxWeightedTrs
        (23) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (24) CpxTypedWeightedTrs
        (25) CompletionProof [UPPER BOUND(ID), 0 ms]
        (26) CpxTypedWeightedCompleteTrs
            (27) NarrowingProof [BOTH BOUNDS(ID, ID), 39.7 s]
            (28) CpxTypedWeightedCompleteTrs
            (29) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 56 ms]
            (30) CpxRNTS
            (31) SimplificationProof [BOTH BOUNDS(ID, ID), 40 ms]
            (32) CpxRNTS
        (33) CompletionProof [UPPER BOUND(ID), 0 ms]
        (34) CpxTypedWeightedCompleteTrs
            (35) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 21 ms]
            (36) CpxRNTS
    (37) CpxTrsToCdtProof [UPPER BOUND(ID), 632 ms]
    (38) CdtProblem
        (39) CdtLeafRemovalProof [ComplexityIfPolyImplication, 16 ms]
        (40) CdtProblem
        (41) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 772 ms]
        (42) CdtProblem
        (43) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 41 ms]
        (44) CdtProblem
        (45) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (46) CdtProblem
        (47) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 3949 ms]
        (48) CdtProblem
        (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1193 ms]
        (50) CdtProblem
        (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (52) CdtProblem
        (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1152 ms]
        (54) CdtProblem
        (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1048 ms]
        (56) CdtProblem
        (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (58) CdtProblem
        (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2891 ms]
        (60) CdtProblem
        (61) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 15 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2266 ms]
        (64) CdtProblem
        (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2778 ms]
        (66) CdtProblem
        (67) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 16 ms]
        (68) CdtProblem
        (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2375 ms]
        (70) CdtProblem
        (71) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 29 ms]
        (72) CdtProblem
        (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2413 ms]
        (74) CdtProblem
        (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2446 ms]
        (76) CdtProblem
        (77) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 29 ms]
        (78) CdtProblem
        (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2495 ms]
        (80) CdtProblem
        (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2286 ms]
        (82) CdtProblem
        (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 3709 ms]
        (84) CdtProblem
        (85) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 72 ms]
        (86) CdtProblem


----------------------------------------

(0)
Obligation:

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS