Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905043
details
property
value
status
complete
benchmark
Ex1_GL02a_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
1.54808592796 seconds
cpu usage
6.137907624
max memory
7.2261632E7
stage attributes
key
value
output-size
6932
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: a__eq(X,Y) -> false() a__eq(X1,X2) -> eq(X1,X2) a__eq(0(),0()) -> true() a__eq(s(X),s(Y)) -> a__eq(X,Y) a__inf(X) -> cons(X,inf(s(X))) a__inf(X) -> inf(X) a__length(X) -> length(X) a__length(cons(X,L)) -> s(length(L)) a__length(nil()) -> 0() a__take(X1,X2) -> take(X1,X2) a__take(0(),X) -> nil() a__take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(X1,X2) mark(eq(X1,X2)) -> a__eq(X1,X2) mark(false()) -> false() mark(inf(X)) -> a__inf(mark(X)) mark(length(X)) -> a__length(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(X) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(true()) -> true() - Signature: {a__eq/2,a__inf/1,a__length/1,a__take/2,mark/1} / {0/0,cons/2,eq/2,false/0,inf/1,length/1,nil/0,s/1,take/2 ,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__eq,a__inf,a__length,a__take,mark} and constructors {0 ,cons,eq,false,inf,length,nil,s,take,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__eq(X,Y) -> false() a__eq(X1,X2) -> eq(X1,X2) a__eq(0(),0()) -> true() a__eq(s(X),s(Y)) -> a__eq(X,Y) a__inf(X) -> cons(X,inf(s(X))) a__inf(X) -> inf(X) a__length(X) -> length(X) a__length(cons(X,L)) -> s(length(L)) a__length(nil()) -> 0() a__take(X1,X2) -> take(X1,X2) a__take(0(),X) -> nil() a__take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(X1,X2) mark(eq(X1,X2)) -> a__eq(X1,X2) mark(false()) -> false() mark(inf(X)) -> a__inf(mark(X)) mark(length(X)) -> a__length(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(X) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(true()) -> true() - Signature: {a__eq/2,a__inf/1,a__length/1,a__take/2,mark/1} / {0/0,cons/2,eq/2,false/0,inf/1,length/1,nil/0,s/1,take/2 ,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__eq,a__inf,a__length,a__take,mark} and constructors {0 ,cons,eq,false,inf,length,nil,s,take,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: a__eq(x,y){x -> s(x),y -> s(y)} = a__eq(s(x),s(y)) ->^+ a__eq(x,y) = C[a__eq(x,y) = a__eq(x,y){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a__eq(X,Y) -> false() a__eq(X1,X2) -> eq(X1,X2) a__eq(0(),0()) -> true() a__eq(s(X),s(Y)) -> a__eq(X,Y) a__inf(X) -> cons(X,inf(s(X))) a__inf(X) -> inf(X) a__length(X) -> length(X) a__length(cons(X,L)) -> s(length(L)) a__length(nil()) -> 0() a__take(X1,X2) -> take(X1,X2) a__take(0(),X) -> nil() a__take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(X1,X2) mark(eq(X1,X2)) -> a__eq(X1,X2) mark(false()) -> false()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807