Derivational Complexity: TRS pair #487100926

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.672 seconds
cpu usage	1081.35
user time	1068.5
system time	12.8539
max virtual memory	3.75835E7
max residence set size	1.3755636E7

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), 46 ms]
(4) CpxRelTRS
(5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(6) CpxRelTRS
    (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 10 ms]
    (8) typed CpxTrs
    (9) OrderProof [LOWER BOUND(ID), 0 ms]
    (10) typed CpxTrs
    (11) RewriteLemmaProof [LOWER BOUND(ID), 465 ms]
    (12) BOUNDS(1, INF)
(13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(14) TRS for Loop Detection
(15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(16) CpxTRS
(17) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(18) CpxRelTRS
    (19) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxRelTRS
    (21) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 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), 0 ms]
            (28) CpxTypedWeightedCompleteTrs
            (29) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (30) CpxRNTS
            (31) InliningProof [UPPER BOUND(ID), 1391 ms]
            (32) CpxRNTS
            (33) SimplificationProof [BOTH BOUNDS(ID, ID), 9 ms]
            (34) CpxRNTS
        (35) CompletionProof [UPPER BOUND(ID), 0 ms]
        (36) CpxTypedWeightedCompleteTrs
            (37) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (38) CpxRNTS
    (39) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
    (40) CdtProblem
        (41) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (42) CdtProblem
        (43) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (44) CdtProblem
        (45) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (46) CdtProblem
        (47) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 5 ms]
        (48) CdtProblem
        (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 6 ms]
        (50) CdtProblem
        (51) CdtNarrowingProof [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) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (64) CdtProblem
        (65) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (66) CdtProblem
        (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (68) CdtProblem
        (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (70) CdtProblem
        (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (72) CdtProblem
        (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (74) CdtProblem
        (75) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (76) CdtProblem
        (77) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (78) CdtProblem
        (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (80) CdtProblem
        (81) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (82) CdtProblem
        (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (84) CdtProblem
        (85) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (86) CdtProblem
        (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (88) CdtProblem
        (89) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (90) CdtProblem
        (91) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 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