Derivational Complexity: TRS pair #487103816

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.531 seconds
cpu usage	334.814
user time	331.848
system time	2.96592
max virtual memory	5.670628E7
max residence set size	5347172.0

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), 164 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), 0 ms]
    (12) typed CpxTrs
    (13) RewriteLemmaProof [LOWER BOUND(ID), 331 ms]
    (14) BOUNDS(1, INF)
(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), 325 ms]
            (32) CpxRNTS
            (33) SimplificationProof [BOTH BOUNDS(ID, ID), 4 ms]
            (34) CpxRNTS
            (35) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
            (36) CpxRNTS
            (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (38) CpxRNTS
            (39) IntTrsBoundProof [UPPER BOUND(ID), 36 ms]
            (40) CpxRNTS
            (41) IntTrsBoundProof [UPPER BOUND(ID), 5 ms]
            (42) CpxRNTS
            (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (44) CpxRNTS
            (45) IntTrsBoundProof [UPPER BOUND(ID), 99 ms]
            (46) CpxRNTS
            (47) IntTrsBoundProof [UPPER BOUND(ID), 15 ms]
            (48) CpxRNTS
            (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (50) CpxRNTS
            (51) IntTrsBoundProof [UPPER BOUND(ID), 3519 ms]
            (52) CpxRNTS
            (53) IntTrsBoundProof [UPPER BOUND(ID), 1170 ms]
            (54) CpxRNTS
        (55) CompletionProof [UPPER BOUND(ID), 0 ms]
        (56) CpxTypedWeightedCompleteTrs
            (57) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (58) CpxRNTS
    (59) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
    (60) CdtProblem
        (61) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (62) CdtProblem
        (63) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (64) CdtProblem
        (65) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (66) CdtProblem
        (67) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
        (68) CdtProblem
        (69) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 74 ms]
        (70) CdtProblem
        (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (72) CdtProblem
        (73) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (74) CdtProblem
        (75) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (76) CdtProblem
        (77) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (78) CdtProblem
        (79) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 21 ms]
        (80) CdtProblem
        (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (82) CdtProblem
        (83) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (84) CdtProblem
        (85) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (86) CdtProblem
        (87) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 24 ms]
        (88) CdtProblem
        (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (90) CdtProblem
        (91) CdtRhsSimplificationProcessorProof [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