Runtime Complexity: TRS pair #487111184

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	n147.star.cs.uiowa.edu
space	Strategy_removed_mixed_05

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.535 seconds
cpu usage	620.481
user time	617.729
system time	2.75178
max virtual memory	1.88232E7
max residence set size	5193876.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 Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF).

(0) CpxTRS
(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxTRS
    (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (4) typed CpxTrs
    (5) OrderProof [LOWER BOUND(ID), 0 ms]
    (6) typed CpxTrs
(7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(8) TRS for Loop Detection
(9) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(10) CpxTRS
(11) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms]
(12) CpxRelTRS
    (13) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms]
    (14) CpxRelTRS
    (15) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
    (16) CpxWeightedTrs
        (17) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
        (18) CpxTypedWeightedTrs
        (19) CompletionProof [UPPER BOUND(ID), 0 ms]
        (20) CpxTypedWeightedCompleteTrs
            (21) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
            (22) CpxTypedWeightedCompleteTrs
            (23) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (24) CpxRNTS
            (25) InliningProof [UPPER BOUND(ID), 234 ms]
            (26) CpxRNTS
            (27) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
            (28) CpxRNTS
            (29) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
            (30) CpxRNTS
            (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (32) CpxRNTS
            (33) IntTrsBoundProof [UPPER BOUND(ID), 93 ms]
            (34) CpxRNTS
            (35) IntTrsBoundProof [UPPER BOUND(ID), 6 ms]
            (36) CpxRNTS
            (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
            (38) CpxRNTS
            (39) IntTrsBoundProof [UPPER BOUND(ID), 3403 ms]
            (40) CpxRNTS
            (41) IntTrsBoundProof [UPPER BOUND(ID), 1103 ms]
            (42) CpxRNTS
        (43) CompletionProof [UPPER BOUND(ID), 0 ms]
        (44) CpxTypedWeightedCompleteTrs
            (45) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
            (46) CpxRNTS
    (47) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
    (48) CdtProblem
        (49) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (50) CdtProblem
        (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
        (52) CdtProblem
        (53) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
        (54) CdtProblem
        (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
        (56) CdtProblem
        (57) CdtLeafRemovalProof [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) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
        (70) CdtProblem
        (71) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
        (72) CdtProblem
        (73) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (74) CdtProblem
        (75) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (76) CdtProblem
        (77) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (78) CdtProblem
        (79) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms]
        (80) CdtProblem


----------------------------------------

(0)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   f(x, x) -> f(i(x), g(g(x)))

popout

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

job log

popout

actions all output return to Runtime Complexity: TRS