Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904190
details
property
value
status
complete
benchmark
deeprev_typed.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.447848081589 seconds
cpu usage
1.733154825
max memory
4.0615936E7
stage attributes
key
value
output-size
6921
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: deeprev(C(x1,x2)) -> deeprevapp(C(x1,x2),N()) deeprev(N()) -> N() deeprev(V(n)) -> V(n) deeprevapp(C(x1,x2),rest) -> deeprevapp(x2,C(x1,rest)) deeprevapp(N(),rest) -> rest deeprevapp(V(n),rest) -> revconsapp(rest,V(n)) first(C(x1,x2)) -> x1 first(V(n)) -> N() goal(x) -> deeprev(x) isEmptyT(C(x1,x2)) -> False() isEmptyT(N()) -> True() isEmptyT(V(n)) -> False() isNotEmptyT(C(x1,x2)) -> True() isNotEmptyT(N()) -> False() isNotEmptyT(V(n)) -> False() isVal(C(x1,x2)) -> False() isVal(N()) -> False() isVal(V(n)) -> True() revconsapp(C(x1,x2),r) -> revconsapp(x2,C(x1,r)) revconsapp(N(),r) -> r revconsapp(V(n),r) -> r second(C(x1,x2)) -> x2 second(V(n)) -> N() - Signature: {deeprev/1,deeprevapp/2,first/1,goal/1,isEmptyT/1,isNotEmptyT/1,isVal/1,revconsapp/2,second/1} / {C/2 ,False/0,N/0,True/0,V/1} - Obligation: innermost runtime complexity wrt. defined symbols {deeprev,deeprevapp,first,goal,isEmptyT,isNotEmptyT,isVal ,revconsapp,second} and constructors {C,False,N,True,V} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: deeprev(C(x1,x2)) -> deeprevapp(C(x1,x2),N()) deeprev(N()) -> N() deeprev(V(n)) -> V(n) deeprevapp(C(x1,x2),rest) -> deeprevapp(x2,C(x1,rest)) deeprevapp(N(),rest) -> rest deeprevapp(V(n),rest) -> revconsapp(rest,V(n)) first(C(x1,x2)) -> x1 first(V(n)) -> N() goal(x) -> deeprev(x) isEmptyT(C(x1,x2)) -> False() isEmptyT(N()) -> True() isEmptyT(V(n)) -> False() isNotEmptyT(C(x1,x2)) -> True() isNotEmptyT(N()) -> False() isNotEmptyT(V(n)) -> False() isVal(C(x1,x2)) -> False() isVal(N()) -> False() isVal(V(n)) -> True() revconsapp(C(x1,x2),r) -> revconsapp(x2,C(x1,r)) revconsapp(N(),r) -> r revconsapp(V(n),r) -> r second(C(x1,x2)) -> x2 second(V(n)) -> N() - Signature: {deeprev/1,deeprevapp/2,first/1,goal/1,isEmptyT/1,isNotEmptyT/1,isVal/1,revconsapp/2,second/1} / {C/2 ,False/0,N/0,True/0,V/1} - Obligation: innermost runtime complexity wrt. defined symbols {deeprev,deeprevapp,first,goal,isEmptyT,isNotEmptyT,isVal ,revconsapp,second} and constructors {C,False,N,True,V} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: deeprevapp(y,z){y -> C(x,y)} = deeprevapp(C(x,y),z) ->^+ deeprevapp(y,C(x,z)) = C[deeprevapp(y,C(x,z)) = deeprevapp(y,z){z -> C(x,z)}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: deeprev(C(x1,x2)) -> deeprevapp(C(x1,x2),N()) deeprev(N()) -> N() deeprev(V(n)) -> V(n) deeprevapp(C(x1,x2),rest) -> deeprevapp(x2,C(x1,rest)) deeprevapp(N(),rest) -> rest deeprevapp(V(n),rest) -> revconsapp(rest,V(n)) first(C(x1,x2)) -> x1 first(V(n)) -> N() goal(x) -> deeprev(x) isEmptyT(C(x1,x2)) -> False() isEmptyT(N()) -> True() isEmptyT(V(n)) -> False() isNotEmptyT(C(x1,x2)) -> True() isNotEmptyT(N()) -> False()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807