Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903369
details
property
value
status
complete
benchmark
Ex1_GM03_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.58359909058 seconds
cpu usage
3.646143663
max memory
2.15789568E8
stage attributes
key
value
output-size
5675
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, 25 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: p(0) -> 0 p(s(X)) -> X leq(0, Y) -> true leq(s(X), 0) -> false leq(s(X), s(Y)) -> leq(X, Y) if(true, X, Y) -> activate(X) if(false, X, Y) -> activate(Y) diff(X, Y) -> if(leq(X, Y), n__0, n__s(n__diff(n__p(X), Y))) 0 -> n__0 s(X) -> n__s(X) diff(X1, X2) -> n__diff(X1, X2) p(X) -> n__p(X) activate(n__0) -> 0 activate(n__s(X)) -> s(activate(X)) activate(n__diff(X1, X2)) -> diff(activate(X1), activate(X2)) activate(n__p(X)) -> p(activate(X)) activate(X) -> X 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: p(0) -> 0 p(s(X)) -> X leq(0, Y) -> true leq(s(X), 0) -> false leq(s(X), s(Y)) -> leq(X, Y) if(true, X, Y) -> activate(X) if(false, X, Y) -> activate(Y) diff(X, Y) -> if(leq(X, Y), n__0, n__s(n__diff(n__p(X), Y))) 0 -> n__0 s(X) -> n__s(X) diff(X1, X2) -> n__diff(X1, X2) p(X) -> n__p(X) activate(n__0) -> 0 activate(n__s(X)) -> s(activate(X)) activate(n__diff(X1, X2)) -> diff(activate(X1), activate(X2)) activate(n__p(X)) -> p(activate(X)) activate(X) -> X 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): The rewrite sequence activate(n__p(X)) ->^+ p(activate(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127