Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904833
details
property
value
status
complete
benchmark
graphcolour1_typed.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Frederiksen_Others
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
30.485574007 seconds
cpu usage
121.379470041
max memory
5.4388736E8
stage attributes
key
value
output-size
1190796
starexec-result
WORST_CASE(Omega(n^1),O(n^4))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^4)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^4)) + Considered Problem: - Strict TRS: colornode(Cons(x,xs),N(n,ns),colorednodes) -> colornode[Ite][True][Ite](possible(x,ns,colorednodes) ,Cons(x,xs) ,N(n,ns) ,colorednodes) colornode(Nil(),node,colorednodes) -> NotPossible() colorof(node,Cons(CN(cl,N(name,adjs)),xs)) -> colorof[Ite][True][Ite](!EQ(name,node) ,node ,Cons(CN(cl,N(name,adjs)),xs)) colorof(node,Nil()) -> NoColor() colorrest(cs,ncs,colorednodes,Cons(x,xs)) -> colorrest[Ite][True][Let](cs ,ncs ,colorednodes ,Cons(x,xs) ,colornode(ncs,x,colorednodes)) colorrest(cs,ncs,colorednodes,Nil()) -> colorednodes colorrestthetrick(cs1,cs,ncs,colorednodes,rest) -> colorrestthetrick[Ite](eqColorList(cs1,ncs) ,cs1 ,cs ,ncs ,colorednodes ,rest) eqColor(Blue(),Blue()) -> True() eqColor(Blue(),NoColor()) -> False() eqColor(Blue(),Red()) -> False() eqColor(Blue(),Yellow()) -> False() eqColor(NoColor(),b) -> False() eqColor(Red(),Blue()) -> False() eqColor(Red(),NoColor()) -> False() eqColor(Red(),Red()) -> True() eqColor(Red(),Yellow()) -> False() eqColor(Yellow(),Blue()) -> False() eqColor(Yellow(),NoColor()) -> False() eqColor(Yellow(),Red()) -> False() eqColor(Yellow(),Yellow()) -> True() eqColorList(Cons(c1,cs1),Nil()) -> False() eqColorList(Cons(Blue(),cs1),Cons(Blue(),cs2)) -> and(True(),eqColorList(cs1,cs2)) eqColorList(Cons(Blue(),cs1),Cons(NoColor(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Blue(),cs1),Cons(Red(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Blue(),cs1),Cons(Yellow(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(NoColor(),cs1),Cons(b,cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Red(),cs1),Cons(Blue(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Red(),cs1),Cons(NoColor(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Red(),cs1),Cons(Red(),cs2)) -> and(True(),eqColorList(cs1,cs2)) eqColorList(Cons(Red(),cs1),Cons(Yellow(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Yellow(),cs1),Cons(Blue(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Yellow(),cs1),Cons(NoColor(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Yellow(),cs1),Cons(Red(),cs2)) -> and(False(),eqColorList(cs1,cs2)) eqColorList(Cons(Yellow(),cs1),Cons(Yellow(),cs2)) -> and(True(),eqColorList(cs1,cs2)) eqColorList(Nil(),Cons(c2,cs2)) -> False() eqColorList(Nil(),Nil()) -> True() getAdjs(N(n,ns)) -> ns getColorListFromCN(CN(cl,n)) -> cl getNodeFromCN(CN(cl,n)) -> n getNodeName(N(name,adjs)) -> name graphcolour(Cons(x,xs),cs) -> reverse(colorrest(cs,cs,Cons(colornode(cs,x,Nil()),Nil()),xs)) isPossible(CN(cl,n)) -> True() isPossible(NotPossible()) -> False() notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() possible(color,Cons(x,xs),colorednodes) -> possible[Ite][True][Ite](eqColor(color,colorof(x,colorednodes)) ,color ,Cons(x,xs) ,colorednodes) possible(color,Nil(),colorednodes) -> True() revapp(Cons(x,xs),rest) -> revapp(xs,Cons(x,rest)) revapp(Nil(),rest) -> rest reverse(xs) -> revapp(xs,Nil()) - Weak TRS: !EQ(0(),0()) -> True() !EQ(0(),S(y)) -> False() !EQ(S(x),0()) -> False() !EQ(S(x),S(y)) -> !EQ(x,y) and(False(),False()) -> False() and(False(),True()) -> False() and(True(),False()) -> False() and(True(),True()) -> True() colornode[Ite][True][Ite](False(),Cons(x,xs),node,colorednodes) -> colornode(xs,node,colorednodes) colornode[Ite][True][Ite](True(),cs,node,colorednodes) -> CN(cs,node) colorof[Ite][True][Ite](False(),node,Cons(x,xs)) -> colorof(node,xs) colorof[Ite][True][Ite](True(),node,Cons(CN(Cons(x,xs),n),xs')) -> x colorrest[Ite][True][Let](cs,ncs,colorednodes,rest,CN(cl,n)) -> colorrest[Ite][True][Let][Ite](True() ,cs ,ncs ,colorednodes ,rest ,CN(cl,n)) colorrest[Ite][True][Let](cs,ncs,colorednodes,rest,NotPossible()) -> colorrest[Ite][True][Let][Ite](False() ,cs ,ncs ,colorednodes
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807