Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903315
details
property
value
status
complete
benchmark
Ex1_GM03_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.14608597755 seconds
cpu usage
3.907605378
max memory
2.49020416E8
stage attributes
key
value
output-size
6349
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/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(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 21 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__p(0) -> 0 a__p(s(X)) -> mark(X) a__leq(0, Y) -> true a__leq(s(X), 0) -> false a__leq(s(X), s(Y)) -> a__leq(mark(X), mark(Y)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__diff(X, Y) -> a__if(a__leq(mark(X), mark(Y)), 0, s(diff(p(X), Y))) mark(p(X)) -> a__p(mark(X)) mark(leq(X1, X2)) -> a__leq(mark(X1), mark(X2)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(diff(X1, X2)) -> a__diff(mark(X1), mark(X2)) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(true) -> true mark(false) -> false a__p(X) -> p(X) a__leq(X1, X2) -> leq(X1, X2) a__if(X1, X2, X3) -> if(X1, X2, X3) a__diff(X1, X2) -> diff(X1, X2) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__p(0) -> 0 a__p(s(X)) -> mark(X) a__leq(0, Y) -> true a__leq(s(X), 0) -> false a__leq(s(X), s(Y)) -> a__leq(mark(X), mark(Y)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) a__diff(X, Y) -> a__if(a__leq(mark(X), mark(Y)), 0, s(diff(p(X), Y))) mark(p(X)) -> a__p(mark(X)) mark(leq(X1, X2)) -> a__leq(mark(X1), mark(X2)) mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) mark(diff(X1, X2)) -> a__diff(mark(X1), mark(X2)) mark(0) -> 0 mark(s(X)) -> s(mark(X)) mark(true) -> true mark(false) -> false a__p(X) -> p(X) a__leq(X1, X2) -> leq(X1, X2) a__if(X1, X2, X3) -> if(X1, X2, X3) a__diff(X1, X2) -> diff(X1, X2) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1):
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127