Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903729
details
property
value
status
complete
benchmark
Ex14_Luc06_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.61629700661 seconds
cpu usage
3.550201933
max memory
1.89636608E8
stage attributes
key
value
output-size
4788
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(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, 23 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__h(X) -> a__g(mark(X), X) a__g(a, X) -> a__f(b, X) a__f(X, X) -> a__h(a__a) a__a -> b mark(h(X)) -> a__h(mark(X)) mark(g(X1, X2)) -> a__g(mark(X1), X2) mark(a) -> a__a mark(f(X1, X2)) -> a__f(mark(X1), X2) mark(b) -> b a__h(X) -> h(X) a__g(X1, X2) -> g(X1, X2) a__a -> a a__f(X1, X2) -> f(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__h(X) -> a__g(mark(X), X) a__g(a, X) -> a__f(b, X) a__f(X, X) -> a__h(a__a) a__a -> b mark(h(X)) -> a__h(mark(X)) mark(g(X1, X2)) -> a__g(mark(X1), X2) mark(a) -> a__a mark(f(X1, X2)) -> a__f(mark(X1), X2) mark(b) -> b a__h(X) -> h(X) a__g(X1, X2) -> g(X1, X2) a__a -> a a__f(X1, X2) -> f(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): The rewrite sequence mark(h(X)) ->^+ a__h(mark(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [X / h(X)]. The result substitution is [ ].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127