Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903505
details
property
value
status
complete
benchmark
MYNAT_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
7.92958498001 seconds
cpu usage
25.85402306
max memory
3.95010048E9
stage attributes
key
value
output-size
11365
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
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^1), O(n^1)) 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^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 42 ms] (6) BOUNDS(1, n^1) (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (8) TRS for Loop Detection (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(and(tt, X)) -> mark(X) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(s(plus(N, M))) active(x(N, 0)) -> mark(0) active(x(N, s(M))) -> mark(plus(x(N, M), N)) active(and(X1, X2)) -> and(active(X1), X2) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(s(X)) -> s(active(X)) active(x(X1, X2)) -> x(active(X1), X2) active(x(X1, X2)) -> x(X1, active(X2)) and(mark(X1), X2) -> mark(and(X1, X2)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) s(mark(X)) -> mark(s(X)) x(mark(X1), X2) -> mark(x(X1, X2)) x(X1, mark(X2)) -> mark(x(X1, X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(plus(X1, X2)) -> plus(proper(X1), proper(X2)) proper(0) -> ok(0) proper(s(X)) -> s(proper(X)) proper(x(X1, X2)) -> x(proper(X1), proper(X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) plus(ok(X1), ok(X2)) -> ok(plus(X1, X2)) s(ok(X)) -> ok(s(X)) x(ok(X1), ok(X2)) -> ok(x(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) The following defined symbols can occur below the 0th argument of top: proper, active The following defined symbols can occur below the 0th argument of proper: proper, active The following defined symbols can occur below the 0th argument of active: proper, active Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: active(and(tt, X)) -> mark(X) active(plus(N, 0)) -> mark(N) active(plus(N, s(M))) -> mark(s(plus(N, M))) active(x(N, 0)) -> mark(0) active(x(N, s(M))) -> mark(plus(x(N, M), N)) active(and(X1, X2)) -> and(active(X1), X2) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(s(X)) -> s(active(X)) active(x(X1, X2)) -> x(active(X1), X2) active(x(X1, X2)) -> x(X1, active(X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(plus(X1, X2)) -> plus(proper(X1), proper(X2)) proper(s(X)) -> s(proper(X)) proper(x(X1, X2)) -> x(proper(X1), proper(X2)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 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