Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS pair #487102538
details
property
value
status
complete
benchmark
#3.12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
294.52 seconds
cpu usage
1099.53
user time
1085.53
system time
13.9955
max virtual memory
3.7508396E7
max residence set size
1.4779932E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^3), O(n^4))
output
WORST_CASE(Omega(n^3), O(n^4)) 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(n^3, n^4). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 190 ms] (4) CpxRelTRS (5) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxWeightedTrs (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedTrs (11) CompletionProof [UPPER BOUND(ID), 0 ms] (12) CpxTypedWeightedCompleteTrs (13) NarrowingProof [BOTH BOUNDS(ID, ID), 14 ms] (14) CpxTypedWeightedCompleteTrs (15) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 5 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 75 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 24 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 434 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 35 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 273 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 156 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 362 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 4 ms] (44) CpxRNTS (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 1141 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 460 ms] (50) CpxRNTS (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 557 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 198 ms] (56) CpxRNTS (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 180 ms] (60) CpxRNTS (61) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (62) CpxRNTS (63) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (64) CpxRNTS (65) IntTrsBoundProof [UPPER BOUND(ID), 130 ms] (66) CpxRNTS (67) IntTrsBoundProof [UPPER BOUND(ID), 4 ms] (68) CpxRNTS (69) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (70) CpxRNTS (71) IntTrsBoundProof [UPPER BOUND(ID), 345 ms] (72) CpxRNTS (73) IntTrsBoundProof [UPPER BOUND(ID), 198 ms] (74) CpxRNTS (75) FinalProof [FINISHED, 0 ms] (76) BOUNDS(1, n^4) (77) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (78) CpxRelTRS (79) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (80) typed CpxTrs (81) OrderProof [LOWER BOUND(ID), 0 ms] (82) typed CpxTrs (83) RewriteLemmaProof [LOWER BOUND(ID), 286 ms] (84) BEST (85) proven lower bound (86) LowerBoundPropagationProof [FINISHED, 0 ms] (87) BOUNDS(n^1, INF) (88) typed CpxTrs (89) RewriteLemmaProof [LOWER BOUND(ID), 38 ms] (90) BEST (91) proven lower bound (92) LowerBoundPropagationProof [FINISHED, 0 ms]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS