Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational_Complexity: TRS pair #487532561
details
property
value
status
timeout (wallclock)
benchmark
247020.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
301.008867025 seconds
cpu usage
1072.09788027
max memory
1.4360875008E10
stage attributes
unavailable
output
/export/starexec/sandbox2/solver/bin/starexec_run_rcdcRelativeAlsoLower /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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), 54 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), 0 ms] (10) typed CpxTrs (11) OrderProof [LOWER BOUND(ID), 0 ms] (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 547 ms] (14) BOUNDS(1, INF) (15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (16) CpxTRS (17) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms] (18) CpxRelTRS (19) RcToIrcProof [BOTH BOUNDS(ID, ID), 50.0 s] (20) CpxRelTRS (21) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (22) CpxWeightedTrs (23) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 15 ms] (24) CpxWeightedTrs (25) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (26) CpxTypedWeightedTrs (27) CompletionProof [UPPER BOUND(ID), 0 ms] (28) CpxTypedWeightedCompleteTrs (29) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (30) CpxTypedWeightedCompleteTrs (31) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) SimplificationProof [BOTH BOUNDS(ID, ID), 22 ms] (34) CpxRNTS (35) CompletionProof [UPPER BOUND(ID), 0 ms] (36) CpxTypedWeightedCompleteTrs (37) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (38) CpxRNTS (39) CpxTrsToCdtProof [UPPER BOUND(ID), 2434 ms] (40) CdtProblem (41) CdtLeafRemovalProof [ComplexityIfPolyImplication, 4 ms] (42) CdtProblem (43) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (44) CdtProblem (45) CdtGraphSplitRhsProof [BOTH BOUNDS(ID, ID), 0 ms] (46) CdtProblem (47) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (48) CdtProblem (49) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 12.3 s] (50) CdtProblem (51) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2563 ms] (52) CdtProblem (53) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (54) CdtProblem (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2489 ms] (56) CdtProblem (57) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (58) CdtProblem (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 2530 ms] (60) CdtProblem (61) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 9 ms] (62) CdtProblem (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 56.8 s] (64) 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(x1) -> 1(x1) 0(0(x1)) -> 0(x1) 3(4(5(x1))) -> 4(3(5(x1))) 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 1(0(0(1(0(0(1(0(1(0(1(1(0(1(1(0(1(1(1(1(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(0(0(0(1(0(0(1(1(0(0(0(0(0(1(0(1(1(1(0(0(0(0(0(1(0(1(0(1(1(0(1(0(1(0(1(0(0(1(1(0(0(0(0(1(0(1(0(0(0(0(1(0(1(0(1(0(1(0(1(0(1(1(0(0(1(1(0(1(1(1(0(0(0(0(0(1(0(1(0(1(1(0(1(0(0(1(1(1(1(0(1(0(1(0(0(1(0(1(1(1(1(0(0(1(1(1(0(0(1(1(0(1(1(0(0(0(1(0(0(0(1(1(0(1(1(1(1(1(1(0(1(1(0(1(1(1(1(0(1(0(1(1(0(0(1(0(1(1(1(0(0(1(1(1(1(0(0(0(0(0(0(1(1(0(1(1(0(1(0(1(0(0(1(0(0(0(1(0(1(1(0(0(1(1(1(0(0(0(0(0(1(1(1(0(0(1(1(0(1(0(0(0(0(1(0(0(1(0(0(0(0(1(0(0(1(1(1(1(0(1(1(0(0(0(1(1(0(0(1(0(1(1(1(1(0(0(0(1(1(1(1(1(0(1(0(1(1(0(1(0(1(0(0(0(0(0(1(1(0(1(0(0(0(1(0(0(1(1(0(0(1(1(1(0(0(0(1(1(0(1(0(1(0(1(0(1(1(0(0(1(1(1(1(0(1(1(0(1(1(0(0(1(1(1(1(0(0(1(1(0(0(1(0(1(1(0(1(1(1(0(0(1(0(0(0(0(0(0(0(1(1(1(0(0(1(1(0(1(1(0(0(0(0(1(0(1(1(0(0(1(0(1(1(1(1(0(1(0(0(0(0(1(1(1(0(1(0(1(1(0(0(0(1(0(0(0(0(1(0(0(1(0(0(0(1(0(1(0(1(1(1(0(0(0(0(0(0(1(1(0(1(1(1(1(0(0(0(1(0(0(0(0(0(1(0(1(0(1(1(1(1(1(1(1(1(1(1(1(1(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) 1(0(0(0(1(1(0(1(1(1(0(0(1(1(1(0(0(0(0(0(1(1(0(1(1(1(0(1(1(0(1(1(1(0(1(1(0(0(1(0(1(1(0(0(0(0(0(0(0(0(1(0(1(0(1(1(0(1(0(1(0(1(0(0(0(1(1(1(0(1(1(1(0(1(0(1(0(1(0(1(0(1(0(1(1(0(1(1(0(1(0(1(1(0(0(0(0(1(1(0(1(1(0(1(1(1(0(1(1(1(1(0(0(0(0(1(1(1(1(0(1(0(0(0(1(1(1(1(0(1(0(1(1(1(1(0(0(1(0(0(1(0(0(1(0(1(0(0(0(1(0(1(0(0(1(0(1(1(0(1(1(0(1(1(1(1(0(1(0(1(1(1(0(0(1(0(1(1(0(0(0(0(1(0(1(0(1(0(1(0(0(0(0(0(0(0(1(1(0(1(0(0(1(1(0(1(0(1(1(0(1(0(1(1(0(1(0(1(1(0(0(0(0(0(0(1(1(1(1(1(0(0(1(1(1(1(0(1(1(0(1(1(0(1(1(1(0(0(0(0(1(0(1(1(1(0(1(0(1(0(0(1(1(1(1(0(1(1(0(1(1(0(1(0(0(0(0(1(0(0(0(0(0(0(0(0(0(1(1(1(1(1(1(1(0(0(0(0(0(0(0(1(0(0(1(0(0(0(0(0(0(0(1(1(1(0(0(1(1(1(1(0(1(0(0(0(1(0(1(0(0(1(1(1(0(1(1(0(0(0(1(0(1(0(1(0(0(1(0(0(0(1(1(0(1(0(1(0(1(1(1(0(1(0(0(1(0(0(1(0(1(1(0(1(0(0(0(0(1(0(0(1(1(0(0(0(0(1(1(0(1(0(0(0(1(0(0(1(1(0(0(1(1(0(1(0(1(0(0(1(1(0(1(0(1(0(0(1(1(1(1(0(0(0(1(1(0(0(0(1(0(1(1(1(0(1(1(1(0(1(1(1(0(0(0(1(1(0(1(1(1(0(0(0(1(1(0(1(0(1(1(0(1(1(1(0(1(0(x1)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) -> 2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(2(x1))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational_Complexity: TRS