Derivational Complexity: TRS pair #487102836

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	298.232 seconds
cpu usage	1096.36
user time	1085.06
system time	11.2971
max virtual memory	1.8883592E7
max residence set size	1.4901412E7

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), 56 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), 0 ms]
    (10) typed CpxTrs
    (11) RewriteLemmaProof [LOWER BOUND(ID), 76.3 s]
    (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), 171 ms]
    (20) CpxRelTRS
    (21) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (22) CpxWeightedTrs
        (23) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (24) CpxWeightedTrs
        (25) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (26) CpxTypedWeightedTrs
        (27) CompletionProof [UPPER BOUND(ID), 0 ms]
        (28) CpxTypedWeightedCompleteTrs
            (29) NarrowingProof [BOTH BOUNDS(ID, ID), 704 ms]
            (30) CpxTypedWeightedCompleteTrs
            (31) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 14 ms]
            (32) CpxRNTS
            (33) SimplificationProof [BOTH BOUNDS(ID, ID), 5 ms]
            (34) CpxRNTS
        (35) CompletionProof [UPPER BOUND(ID), 0 ms]
        (36) CpxTypedWeightedCompleteTrs
            (37) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 11 ms]
            (38) CpxRNTS
    (39) CpxTrsToCdtProof [UPPER BOUND(ID), 45 ms]
    (40) CdtProblem
        (41) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (42) CdtProblem
        (43) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 63 ms]
        (44) CdtProblem
        (45) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (46) CdtProblem
        (47) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (48) CdtProblem
        (49) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 200 ms]
        (50) CdtProblem
        (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 57 ms]
        (52) CdtProblem
        (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (54) CdtProblem
        (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (56) CdtProblem
        (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (58) CdtProblem
        (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 40 ms]
        (60) CdtProblem
        (61) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 213 ms]
        (64) CdtProblem
        (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 69 ms]
        (66) CdtProblem
        (67) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (68) CdtProblem
        (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 22 ms]
        (70) CdtProblem
        (71) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 237 ms]
        (72) CdtProblem
        (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 415 ms]
        (74) CdtProblem
        (75) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 21 ms]
        (76) CdtProblem
        (77) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 113 ms]
        (78) CdtProblem
        (79) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 76 ms]
        (80) CdtProblem
        (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 72 ms]
        (82) CdtProblem
        (83) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 358 ms]
        (84) CdtProblem
        (85) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (86) CdtProblem
        (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 104 ms]
        (88) CdtProblem
        (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 408 ms]
        (90) CdtProblem
        (91) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 32 ms]
        (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS