Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903023
details
property
value
status
complete
benchmark
2.39.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
7.77983617783 seconds
cpu usage
20.024265868
max memory
3.523305472E9
stage attributes
key
value
output-size
33574
starexec-result
WORST_CASE(Omega(n^2), O(n^2))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), O(n^2)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (12) CpxRNTS (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 340 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 87 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 122 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 52 ms] (28) CpxRNTS (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 118 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 43 ms] (34) CpxRNTS (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 190 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 43 ms] (40) CpxRNTS (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 283 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 96 ms] (46) CpxRNTS (47) FinalProof [FINISHED, 0 ms] (48) BOUNDS(1, n^2) (49) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (50) CpxTRS (51) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (52) typed CpxTrs (53) OrderProof [LOWER BOUND(ID), 0 ms] (54) typed CpxTrs (55) RewriteLemmaProof [LOWER BOUND(ID), 317 ms] (56) BEST (57) proven lower bound (58) LowerBoundPropagationProof [FINISHED, 0 ms] (59) BOUNDS(n^1, INF) (60) typed CpxTrs (61) RewriteLemmaProof [LOWER BOUND(ID), 18 ms] (62) proven lower bound (63) LowerBoundPropagationProof [FINISHED, 0 ms] (64) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). The TRS R consists of the following rules: rev(nil) -> nil rev(.(x, y)) -> ++(rev(y), .(x, nil)) car(.(x, y)) -> x cdr(.(x, y)) -> y null(nil) -> true null(.(x, y)) -> false ++(nil, y) -> y ++(.(x, y), z) -> .(x, ++(y, z)) S is empty. Rewrite Strategy: FULL
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127