Derivational Complexity: TRS Innermost pair #487108740

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	297.002 seconds
cpu usage	1158.13
user time	1149.83
system time	8.30221
max virtual memory	1.98676E7
max residence set size	1.4917136E7

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 (innermost) 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), 904 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) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(12) TRS for Loop Detection
(13) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(14) CpxTRS
(15) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(16) CpxRelTRS
    (17) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (18) CpxWeightedTrs
    (19) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxTypedWeightedTrs
    (21) CompletionProof [UPPER BOUND(ID), 14 ms]
    (22) CpxTypedWeightedCompleteTrs
    (23) CompletionProof [UPPER BOUND(ID), 11 ms]
    (24) CpxTypedWeightedCompleteTrs
        (25) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 22 ms]
        (26) CpxRNTS
(27) CpxTrsToCdtProof [UPPER BOUND(ID), 100 ms]
(28) CdtProblem
    (29) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (30) CdtProblem
    (31) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 25 ms]
    (32) CdtProblem
    (33) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 27 ms]
    (34) CdtProblem
    (35) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (36) CdtProblem
    (37) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 389 ms]
    (38) CdtProblem
    (39) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 128 ms]
    (40) CdtProblem
    (41) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (42) CdtProblem
    (43) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (44) CdtProblem
    (45) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 116 ms]
    (46) CdtProblem
    (47) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (48) CdtProblem
    (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 256 ms]
    (50) CdtProblem
    (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 15 ms]
    (52) CdtProblem
    (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 379 ms]
    (54) CdtProblem
    (55) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 61 ms]
    (56) CdtProblem
    (57) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 144 ms]
    (58) CdtProblem
    (59) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 10 ms]
    (60) CdtProblem
    (61) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 186 ms]
    (62) CdtProblem
    (63) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 9 ms]
    (64) CdtProblem
    (65) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 545 ms]
    (66) CdtProblem
    (67) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 78 ms]
    (68) CdtProblem
    (69) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 240 ms]
    (70) CdtProblem
    (71) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 49 ms]
    (72) CdtProblem
    (73) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 257 ms]
    (74) CdtProblem
    (75) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 16 ms]
    (76) CdtProblem
    (77) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 677 ms]
    (78) CdtProblem
    (79) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 112 ms]
    (80) CdtProblem
    (81) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 309 ms]
    (82) CdtProblem
    (83) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 44 ms]
    (84) CdtProblem
    (85) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1720 ms]
    (86) CdtProblem
    (87) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 254 ms]
    (88) CdtProblem
    (89) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 1124 ms]
    (90) CdtProblem
    (91) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 182 ms]
    (92) CdtProblem

popout

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

job log

popout

actions all output return to Derivational Complexity: TRS Innermost