Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903867
details
property
value
status
complete
benchmark
Ex15_Luc98_C.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)
10.8152461052 seconds
cpu usage
23.133590534
max memory
3.94635264E9
stage attributes
key
value
output-size
14494
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) 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(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, 130 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(true, X)) -> mark(X) active(and(false, Y)) -> mark(false) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(add(0, X)) -> mark(X) active(add(s(X), Y)) -> mark(s(add(X, Y))) active(first(0, X)) -> mark(nil) active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z))) active(from(X)) -> mark(cons(X, from(s(X)))) active(and(X1, X2)) -> and(active(X1), X2) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) active(add(X1, X2)) -> add(active(X1), X2) active(first(X1, X2)) -> first(active(X1), X2) active(first(X1, X2)) -> first(X1, active(X2)) and(mark(X1), X2) -> mark(and(X1, X2)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) add(mark(X1), X2) -> mark(add(X1, X2)) first(mark(X1), X2) -> mark(first(X1, X2)) first(X1, mark(X2)) -> mark(first(X1, X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(true) -> ok(true) proper(false) -> ok(false) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) proper(add(X1, X2)) -> add(proper(X1), proper(X2)) proper(0) -> ok(0) proper(s(X)) -> s(proper(X)) proper(first(X1, X2)) -> first(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) if(ok(X1), ok(X2), ok(X3)) -> ok(if(X1, X2, X3)) add(ok(X1), ok(X2)) -> ok(add(X1, X2)) s(ok(X)) -> ok(s(X)) first(ok(X1), ok(X2)) -> ok(first(X1, X2)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) from(ok(X)) -> ok(from(X)) 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(true, X)) -> mark(X) active(and(false, Y)) -> mark(false) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(add(0, X)) -> mark(X) active(add(s(X), Y)) -> mark(s(add(X, Y))) active(first(0, X)) -> mark(nil) active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z))) active(from(X)) -> mark(cons(X, from(s(X)))) active(and(X1, X2)) -> and(active(X1), X2) active(if(X1, X2, X3)) -> if(active(X1), X2, X3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127