Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS Innermost pair #487111770
details
property
value
status
complete
benchmark
thiemann18.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.645 seconds
cpu usage
1118.44
user time
1104.49
system time
13.9498
max virtual memory
3.7904168E7
max residence set size
1.4900708E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^3))
output
WORST_CASE(Omega(n^1), O(n^3)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^3). (0) CpxTRS (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxWeightedTrs (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTypedWeightedTrs (5) CompletionProof [UPPER BOUND(ID), 0 ms] (6) CpxTypedWeightedCompleteTrs (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 6 ms] (10) CpxRNTS (11) SimplificationProof [BOTH BOUNDS(ID, ID), 9 ms] (12) CpxRNTS (13) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) IntTrsBoundProof [UPPER BOUND(ID), 73 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 65 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 312 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 75 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 421 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 26 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 200 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 22 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 146 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (44) CpxRNTS (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 920 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 355 ms] (50) CpxRNTS (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 1604 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 522 ms] (56) CpxRNTS (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 4276 ms] (60) CpxRNTS (61) IntTrsBoundProof [UPPER BOUND(ID), 971 ms] (62) CpxRNTS (63) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (64) CpxRNTS (65) IntTrsBoundProof [UPPER BOUND(ID), 437 ms] (66) CpxRNTS (67) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (68) CpxRNTS (69) FinalProof [FINISHED, 0 ms] (70) BOUNDS(1, n^3) (71) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (72) TRS for Loop Detection (73) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (74) BEST (75) proven lower bound (76) LowerBoundPropagationProof [FINISHED, 0 ms] (77) BOUNDS(n^1, INF) (78) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^3). The TRS R consists of the following rules: eq(0, 0) -> true eq(0, s(m)) -> false eq(s(n), 0) -> false
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS Innermost