Derivational Complexity: TRS pair #487101976

details

property	value
status	complete
benchmark	jw47.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	Zantema_05

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.577 seconds
cpu usage	1138.65
user time	1128.79
system time	9.86203
max virtual memory	1.8839256E7
max residence set size	1.4139468E7

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), 89 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), 2721 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) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
    (22) CdtProblem
        (23) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (24) CdtProblem
        (25) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (26) CdtProblem
        (27) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
        (28) CdtProblem
        (29) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
        (30) CdtProblem
        (31) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
        (32) CdtProblem
        (33) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (34) CdtProblem
        (35) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (36) CdtProblem
        (37) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (38) CdtProblem
        (39) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (40) CdtProblem
        (41) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (42) CdtProblem
        (43) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (44) CdtProblem
        (45) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (46) CdtProblem
        (47) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (48) CdtProblem
        (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (50) CdtProblem
        (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (52) CdtProblem
        (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 3 ms]
        (54) CdtProblem
        (55) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (56) CdtProblem
        (57) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (58) CdtProblem
        (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (60) CdtProblem
        (61) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (62) CdtProblem
        (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (64) CdtProblem
        (65) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (66) CdtProblem
        (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (68) CdtProblem
        (69) CdtRewritingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (70) CdtProblem
        (71) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (72) CdtProblem
        (73) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (74) CdtProblem
        (75) CdtRewritingProof [BOTH BOUNDS(ID, ID), 17 ms]
        (76) CdtProblem
        (77) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (78) CdtProblem
        (79) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 116 ms]
        (80) CdtProblem
        (81) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 223 ms]
        (82) CdtProblem
        (83) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (84) CdtProblem
        (85) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 392 ms]
        (86) CdtProblem
        (87) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 1952 ms]
        (88) CdtProblem
        (89) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 3179 ms]
        (90) CdtProblem
        (91) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 39 ms]
        (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS