details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	297.721 seconds
cpu usage	970.895
user time	963.495
system time	7.40089
max virtual memory	1.9018636E7
max residence set size	1.4755252E7

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), 154 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 26 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) RcToIrcProof [BOTH BOUNDS(ID, ID), 2358 ms] (18) CpxRelTRS (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxWeightedTrs (21) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 57 ms] (22) CpxWeightedTrs (23) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (24) CpxTypedWeightedTrs (25) CompletionProof [UPPER BOUND(ID), 0 ms] (26) CpxTypedWeightedCompleteTrs (27) NarrowingProof [BOTH BOUNDS(ID, ID), 2974 ms] (28) CpxTypedWeightedCompleteTrs (29) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 138 ms] (30) CpxRNTS (31) SimplificationProof [BOTH BOUNDS(ID, ID), 117 ms] (32) CpxRNTS (33) CompletionProof [UPPER BOUND(ID), 0 ms] (34) CpxTypedWeightedCompleteTrs (35) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 33 ms] (36) CpxRNTS (37) CpxTrsToCdtProof [UPPER BOUND(ID), 1724 ms] (38) CdtProblem (39) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 13 ms] (40) CdtProblem (41) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 25 ms] (42) CdtProblem (43) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (44) CdtProblem (45) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 13.9 s] (46) CdtProblem (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 4387 ms] (48) CdtProblem (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 4401 ms] (50) CdtProblem (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 4401 ms] (52) CdtProblem (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 4277 ms] (54) CdtProblem ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(1, INF). The TRS R consists of the following rules: 0(0(0(1(1(0(1(2(0(0(3(3(1(4(0(4(0(0(1(2(x1)))))))))))))))))))) -> 1(4(3(0(1(4(4(1(3(0(3(4(4(0(1(3(1(0(1(1(x1)))))))))))))))))))) 0(0(0(2(4(3(2(2(2(0(1(2(0(4(1(2(2(4(3(0(x1)))))))))))))))))))) -> 3(1(1(2(4(0(4(3(2(1(1(3(4(1(4(1(2(2(2(2(x1)))))))))))))))))))) 0(0(0(4(1(0(2(2(4(2(2(1(2(1(1(4(3(4(0(2(x1)))))))))))))))))))) -> 3(2(1(2(1(3(2(1(2(3(4(0(2(1(0(1(3(1(3(0(x1)))))))))))))))))))) 0(0(1(0(3(3(3(3(0(0(2(0(2(4(3(4(2(3(0(0(x1)))))))))))))))))))) -> 0(4(0(3(0(0(2(1(3(2(2(2(4(4(4(1(2(2(1(2(x1)))))))))))))))))))) 0(0(1(4(4(0(3(3(4(3(3(0(4(2(1(1(2(2(3(2(x1)))))))))))))))))))) -> 3(0(3(3(4(0(0(1(4(3(3(1(1(4(3(4(0(3(4(4(x1)))))))))))))))))))) 0(0(2(0(1(1(4(2(2(3(3(0(4(3(1(4(1(1(0(2(x1)))))))))))))))))))) -> 3(0(2(3(2(0(1(1(2(2(0(4(1(3(1(0(1(2(2(1(x1)))))))))))))))))))) 0(0(4(4(2(4(2(1(2(1(0(1(0(1(2(2(1(3(3(3(x1)))))))))))))))))))) -> 0(3(2(2(3(0(3(3(2(1(2(2(1(0(3(0(0(3(2(1(x1)))))))))))))))))))) 0(1(0(3(4(4(0(2(1(0(0(3(2(0(0(0(4(3(2(3(x1)))))))))))))))))))) -> 0(4(1(0(3(3(0(1(2(4(3(4(3(4(0(3(0(1(0(0(x1)))))))))))))))))))) 0(2(0(1(2(0(4(1(1(0(1(2(1(3(0(2(4(1(2(0(x1)))))))))))))))))))) -> 2(1(2(3(0(1(1(2(2(1(4(0(3(0(0(3(0(0(1(0(x1)))))))))))))))))))) 0(2(0(1(4(3(4(0(3(4(4(2(2(2(2(1(4(0(2(3(x1)))))))))))))))))))) -> 4(3(1(1(0(1(2(1(1(3(2(4(4(0(4(2(2(2(1(3(x1)))))))))))))))))))) 0(2(0(3(1(1(2(4(1(1(4(4(2(0(3(3(1(4(3(2(x1)))))))))))))))))))) -> 0(3(2(2(3(0(0(3(4(0(4(3(0(1(3(1(4(0(3(1(x1)))))))))))))))))))) 0(2(1(0(0(0(3(3(0(2(1(3(3(3(1(4(2(1(2(4(x1)))))))))))))))))))) -> 3(1(1(2(1(1(0(1(2(1(2(0(4(3(0(1(3(1(1(3(x1)))))))))))))))))))) 0(2(2(1(4(0(2(3(4(4(1(2(2(0(3(3(0(3(4(1(x1)))))))))))))))))))) -> 0(2(3(2(2(3(4(2(1(3(4(0(3(3(3(0(1(3(2(0(x1)))))))))))))))))))) 0(2(3(3(0(1(0(1(3(0(4(4(3(2(2(4(3(2(0(4(x1)))))))))))))))))))) -> 3(3(0(2(3(0(0(0(4(0(1(1(0(0(4(0(3(1(4(4(x1)))))))))))))))))))) 0(2(4(0(4(1(3(2(4(2(0(4(2(3(4(3(3(0(0(2(x1)))))))))))))))))))) -> 0(3(3(4(4(3(1(0(1(3(0(4(1(0(4(4(0(4(3(4(x1)))))))))))))))))))) 0(3(1(0(4(3(0(3(3(0(3(3(1(0(4(4(1(1(0(4(x1)))))))))))))))))))) -> 1(3(2(0(0(1(1(1(4(0(1(2(2(3(1(1(4(1(0(4(x1)))))))))))))))))))) 0(4(1(1(4(3(4(2(3(0(0(0(4(3(2(1(2(4(3(2(x1)))))))))))))))))))) -> 1(3(1(1(4(3(4(3(0(2(0(1(1(1(4(1(4(1(3(3(x1)))))))))))))))))))) 0(4(2(3(4(0(1(0(3(1(4(1(3(3(3(0(4(3(3(1(x1)))))))))))))))))))) -> 3(2(1(0(2(0(3(4(0(0(2(0(1(1(1(3(3(3(2(0(x1)))))))))))))))))))) 0(4(3(1(0(3(0(4(2(3(1(1(1(1(2(4(1(3(4(4(x1)))))))))))))))))))) -> 0(0(1(4(1(4(0(3(0(1(2(4(1(0(1(4(3(0(0(4(x1)))))))))))))))))))) 0(4(4(0(3(4(0(0(4(1(4(0(4(4(2(0(4(2(1(3(x1)))))))))))))))))))) -> 4(3(4(1(2(3(1(4(3(2(1(0(1(1(4(1(1(2(3(2(x1)))))))))))))))))))) 1(0(1(3(2(3(1(2(3(3(2(4(3(0(1(1(4(1(4(4(x1)))))))))))))))))))) -> 0(1(1(1(0(2(1(0(0(1(2(3(4(2(1(0(1(4(4(4(x1)))))))))))))))))))) 1(0(2(2(3(3(4(4(0(3(2(2(3(2(2(1(3(0(1(2(x1)))))))))))))))))))) -> 4(3(0(0(1(3(4(0(1(2(2(4(1(0(0(1(0(4(2(1(x1)))))))))))))))))))) 1(1(4(1(2(2(3(3(2(0(3(1(3(4(0(1(0(4(3(3(x1)))))))))))))))))))) -> 1(1(1(0(2(1(2(0(1(2(1(1(1(1(3(2(4(4(2(3(x1)))))))))))))))))))) 1(2(0(1(1(4(4(2(2(0(1(1(2(0(0(1(1(2(2(3(x1)))))))))))))))))))) -> 3(1(0(1(3(0(3(4(4(1(4(4(0(1(3(1(1(2(4(3(x1)))))))))))))))))))) 1(2(0(2(3(1(3(4(2(2(3(4(4(3(3(1(1(0(4(4(x1)))))))))))))))))))) -> 3(4(0(3(3(4(1(4(1(4(0(1(3(2(0(3(0(3(1(4(x1)))))))))))))))))))) 1(2(1(0(2(0(1(1(2(4(1(4(2(0(3(3(4(4(4(1(x1)))))))))))))))))))) -> 0(0(2(3(4(3(0(1(3(0(1(2(0(0(3(0(0(0(4(0(x1)))))))))))))))))))) 1(2(3(1(0(0(0(4(3(0(0(1(4(2(2(4(3(1(0(2(x1)))))))))))))))))))) -> 3(4(4(1(4(1(2(4(0(0(1(2(3(0(0(4(4(0(1(1(x1)))))))))))))))))))) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS