details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.885 seconds
cpu usage	883.818
user time	877.217
system time	6.60144
max virtual memory	1.888442E7
max residence set size	1.4708536E7

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), 38 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) RcToIrcProof [BOTH BOUNDS(ID, ID), 1420 ms] (18) CpxRelTRS (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxWeightedTrs (21) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 35 ms] (22) CpxWeightedTrs (23) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (24) CpxTypedWeightedTrs (25) CompletionProof [UPPER BOUND(ID), 3 ms] (26) CpxTypedWeightedCompleteTrs (27) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 8 ms] (28) CpxRNTS (29) CompletionProof [UPPER BOUND(ID), 4 ms] (30) CpxTypedWeightedCompleteTrs (31) NarrowingProof [BOTH BOUNDS(ID, ID), 1562 ms] (32) CpxTypedWeightedCompleteTrs (33) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 17 ms] (34) CpxRNTS (35) SimplificationProof [BOTH BOUNDS(ID, ID), 43 ms] (36) CpxRNTS (37) CpxTrsToCdtProof [UPPER BOUND(ID), 1157 ms] (38) CdtProblem (39) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (40) CdtProblem (41) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 12 ms] (42) CdtProblem (43) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (44) CdtProblem (45) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 7404 ms] (46) CdtProblem (47) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2282 ms] (48) CdtProblem (49) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2308 ms] (50) CdtProblem (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2298 ms] (52) CdtProblem (53) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2300 ms] (54) CdtProblem (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 5615 ms] (56) 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(2(2(0(1(2(1(3(1(3(3(1(3(1(3(x1)))))))))))))))))) -> 0(3(3(3(2(1(1(0(1(0(0(3(1(3(1(2(2(1(x1)))))))))))))))))) 0(0(1(0(0(2(1(0(1(1(3(2(2(0(1(3(3(0(x1)))))))))))))))))) -> 0(0(2(2(0(0(1(1(1(3(1(0(0(3(1(2(3(0(x1)))))))))))))))))) 0(0(1(0(3(3(3(3(3(0(3(0(0(1(0(1(1(0(x1)))))))))))))))))) -> 0(0(3(3(0(0(3(0(3(0(0(1(1(1(3(1(3(0(x1)))))))))))))))))) 0(0(1(2(0(2(0(0(2(0(0(2(2(3(1(2(0(1(x1)))))))))))))))))) -> 0(3(1(0(0(0(0(2(0(2(2(2(0(2(1(2(0(1(x1)))))))))))))))))) 0(0(1(2(3(3(2(3(0(0(2(2(0(2(1(2(0(1(x1)))))))))))))))))) -> 0(0(2(3(1(1(2(2(0(3(3(1(2(2(0(0(0(2(x1)))))))))))))))))) 0(0(2(0(3(0(3(1(3(2(3(1(2(0(1(1(0(0(x1)))))))))))))))))) -> 0(3(2(2(1(1(0(1(3(0(3(1(3(2(0(0(0(0(x1)))))))))))))))))) 0(0(2(3(3(0(1(2(3(0(1(2(2(1(0(1(1(1(x1)))))))))))))))))) -> 0(0(0(2(2(1(1(2(1(0(3(3(3(2(1(0(1(1(x1)))))))))))))))))) 0(0(3(0(0(1(3(3(3(1(0(2(0(1(3(3(1(1(x1)))))))))))))))))) -> 0(3(0(1(1(1(0(3(1(3(0(3(0(1(2(0(3(3(x1)))))))))))))))))) 0(0(3(0(2(3(3(0(2(3(0(1(0(2(1(2(1(3(x1)))))))))))))))))) -> 0(3(2(1(0(3(0(2(2(3(2(1(0(0(3(3(0(1(x1)))))))))))))))))) 0(1(0(3(0(1(0(1(3(2(2(0(2(3(1(2(3(3(x1)))))))))))))))))) -> 0(1(0(0(3(3(1(3(2(1(0(0(3(3(2(2(2(1(x1)))))))))))))))))) 0(1(0(3(1(2(2(0(0(2(2(0(2(3(2(1(2(0(x1)))))))))))))))))) -> 0(0(2(2(2(1(0(2(1(0(3(2(2(2(1(0(3(0(x1)))))))))))))))))) 0(1(1(0(0(2(3(1(0(1(0(2(2(3(3(1(3(3(x1)))))))))))))))))) -> 0(1(3(1(0(3(1(2(1(0(0(2(2(0(3(1(3(3(x1)))))))))))))))))) 0(1(1(1(0(1(3(0(2(3(2(3(0(1(0(0(1(1(x1)))))))))))))))))) -> 0(1(2(0(3(0(1(0(2(3(3(1(0(1(1(0(1(1(x1)))))))))))))))))) 0(1(1(3(1(1(2(1(3(1(3(0(2(0(2(3(2(1(x1)))))))))))))))))) -> 0(1(1(0(2(2(1(1(3(3(1(1(3(2(2(0(1(3(x1)))))))))))))))))) 0(1(2(1(3(3(3(0(2(3(2(1(0(3(0(3(2(1(x1)))))))))))))))))) -> 0(1(0(3(0(0(3(1(3(2(2(2(1(2(3(3(1(3(x1)))))))))))))))))) 0(1(2(2(1(1(3(1(3(2(1(0(3(2(0(1(3(3(x1)))))))))))))))))) -> 0(1(2(2(3(0(3(2(1(1(2(1(3(0(1(1(3(3(x1)))))))))))))))))) 0(1(2(3(0(3(1(1(2(0(3(2(1(2(3(3(2(1(x1)))))))))))))))))) -> 0(0(3(3(1(3(3(2(2(1(0(1(2(2(2(1(3(1(x1)))))))))))))))))) 0(1(3(1(0(2(1(2(0(3(3(2(3(2(3(2(3(2(x1)))))))))))))))))) -> 0(3(3(2(3(2(1(3(2(0(3(0(1(1(2(2(3(2(x1)))))))))))))))))) 0(1(3(2(0(0(0(1(1(3(3(3(0(1(3(1(0(2(x1)))))))))))))))))) -> 0(2(3(3(1(0(3(1(0(3(1(2(0(0(3(1(1(0(x1)))))))))))))))))) 0(1(3(2(3(1(0(2(0(1(3(2(0(3(1(2(3(3(x1)))))))))))))))))) -> 0(1(0(2(0(3(3(3(2(3(1(2(3(0(2(1(3(1(x1)))))))))))))))))) 0(1(3(3(3(3(3(1(0(2(2(3(2(3(0(1(2(1(x1)))))))))))))))))) -> 0(3(1(0(3(3(1(2(2(3(0(3(2(2(1(3(1(3(x1)))))))))))))))))) 0(2(0(1(0(3(2(1(3(2(0(3(0(1(3(0(0(2(x1)))))))))))))))))) -> 0(1(0(3(2(1(0(3(1(0(3(2(0(0(3(2(0(2(x1)))))))))))))))))) 0(2(3(2(0(0(2(3(0(2(0(2(2(1(2(2(0(2(x1)))))))))))))))))) -> 0(3(0(0(0(3(0(2(2(2(2(2(0(2(1(2(2(2(x1)))))))))))))))))) 0(3(0(3(0(0(2(3(3(3(2(0(1(1(0(3(2(0(x1)))))))))))))))))) -> 0(3(0(0(0(3(3(0(3(1(3(3(2(1(2(2(0(0(x1)))))))))))))))))) 0(3(2(0(1(1(3(0(1(0(1(1(3(3(0(3(1(2(x1)))))))))))))))))) -> 0(3(2(1(3(0(3(0(1(0(1(1(3(1(0(3(1(2(x1)))))))))))))))))) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS