Derivational Complexity: TRS Innermost pair #487108640

details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.781 seconds
cpu usage	1062.45
user time	1047.98
system time	14.4702
max virtual memory	3.8311276E7
max residence set size	1.4891204E7

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 (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), 45 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), 4 ms]
    (10) typed CpxTrs
    (11) OrderProof [LOWER BOUND(ID), 0 ms]
    (12) typed CpxTrs
    (13) RewriteLemmaProof [LOWER BOUND(ID), 1903 ms]
    (14) BOUNDS(1, INF)
(15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(16) CpxTRS
(17) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(18) CpxRelTRS
    (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (20) CpxWeightedTrs
    (21) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (22) CpxTypedWeightedTrs
    (23) CompletionProof [UPPER BOUND(ID), 0 ms]
    (24) CpxTypedWeightedCompleteTrs
        (25) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (26) CpxTypedWeightedCompleteTrs
        (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 1 ms]
        (28) CpxRNTS
        (29) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (30) CpxRNTS
        (31) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
        (32) CpxRNTS
        (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (34) CpxRNTS
        (35) IntTrsBoundProof [UPPER BOUND(ID), 301 ms]
        (36) CpxRNTS
        (37) IntTrsBoundProof [UPPER BOUND(ID), 46 ms]
        (38) CpxRNTS
        (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (40) CpxRNTS
        (41) IntTrsBoundProof [UPPER BOUND(ID), 259 ms]
        (42) CpxRNTS
        (43) IntTrsBoundProof [UPPER BOUND(ID), 45 ms]
        (44) CpxRNTS
        (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (46) CpxRNTS
        (47) IntTrsBoundProof [UPPER BOUND(ID), 35 ms]
        (48) CpxRNTS
        (49) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
        (50) CpxRNTS
        (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (52) CpxRNTS
        (53) IntTrsBoundProof [UPPER BOUND(ID), 85 ms]
        (54) CpxRNTS
        (55) IntTrsBoundProof [UPPER BOUND(ID), 21 ms]
        (56) CpxRNTS
        (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
        (58) CpxRNTS
        (59) IntTrsBoundProof [UPPER BOUND(ID), 3086 ms]
        (60) CpxRNTS
        (61) IntTrsBoundProof [UPPER BOUND(ID), 798 ms]
        (62) CpxRNTS
    (63) CompletionProof [UPPER BOUND(ID), 0 ms]
    (64) CpxTypedWeightedCompleteTrs
        (65) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 14 ms]
        (66) CpxRNTS
(67) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(68) CdtProblem
    (69) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
    (70) CdtProblem
    (71) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
    (72) CdtProblem
    (73) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (74) CdtProblem
    (75) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms]
    (76) CdtProblem
    (77) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 10 ms]
    (78) CdtProblem
    (79) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 128 ms]
    (80) CdtProblem
    (81) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 56 ms]
    (82) CdtProblem
    (83) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 28 ms]
    (84) CdtProblem
    (85) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 190 ms]
    (86) CdtProblem
    (87) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (88) CdtProblem
    (89) CdtLeafRemovalProof [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 Innermost