Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903227
details
property
value
status
complete
benchmark
PALINDROME_complete_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.186064959 seconds
cpu usage
756.553765656
max memory
7.93214976E8
stage attributes
key
value
output-size
9287
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(tt(),V) -> U12(isNeList(activate(V))) U12(tt()) -> tt() U21(tt(),V1,V2) -> U22(isList(activate(V1)),activate(V2)) U22(tt(),V2) -> U23(isList(activate(V2))) U23(tt()) -> tt() U31(tt(),V) -> U32(isQid(activate(V))) U32(tt()) -> tt() U41(tt(),V1,V2) -> U42(isList(activate(V1)),activate(V2)) U42(tt(),V2) -> U43(isNeList(activate(V2))) U43(tt()) -> tt() U51(tt(),V1,V2) -> U52(isNeList(activate(V1)),activate(V2)) U52(tt(),V2) -> U53(isList(activate(V2))) U53(tt()) -> tt() U61(tt(),V) -> U62(isQid(activate(V))) U62(tt()) -> tt() U71(tt(),V) -> U72(isNePal(activate(V))) U72(tt()) -> tt() __(X,nil()) -> X __(X1,X2) -> n____(X1,X2) __(__(X,Y),Z) -> __(X,__(Y,Z)) __(nil(),X) -> X a() -> n__a() activate(X) -> X activate(n____(X1,X2)) -> __(activate(X1),activate(X2)) activate(n__a()) -> a() activate(n__and(X1,X2)) -> and(activate(X1),X2) activate(n__e()) -> e() activate(n__i()) -> i() activate(n__isPal(X)) -> isPal(X) activate(n__isPalListKind(X)) -> isPalListKind(X) activate(n__nil()) -> nil() activate(n__o()) -> o() activate(n__u()) -> u() and(X1,X2) -> n__and(X1,X2) and(tt(),X) -> activate(X) e() -> n__e() i() -> n__i() isList(V) -> U11(isPalListKind(activate(V)),activate(V)) isList(n____(V1,V2)) -> U21(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) ,activate(V1) ,activate(V2)) isList(n__nil()) -> tt() isNeList(V) -> U31(isPalListKind(activate(V)),activate(V)) isNeList(n____(V1,V2)) -> U41(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) ,activate(V1) ,activate(V2)) isNeList(n____(V1,V2)) -> U51(and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) ,activate(V1) ,activate(V2)) isNePal(V) -> U61(isPalListKind(activate(V)),activate(V)) isNePal(n____(I,n____(P,I))) -> and(and(isQid(activate(I)),n__isPalListKind(activate(I))) ,n__and(n__isPal(activate(P)),n__isPalListKind(activate(P)))) isPal(V) -> U71(isPalListKind(activate(V)),activate(V)) isPal(X) -> n__isPal(X) isPal(n__nil()) -> tt() isPalListKind(X) -> n__isPalListKind(X) isPalListKind(n____(V1,V2)) -> and(isPalListKind(activate(V1)),n__isPalListKind(activate(V2))) isPalListKind(n__a()) -> tt() isPalListKind(n__e()) -> tt() isPalListKind(n__i()) -> tt() isPalListKind(n__nil()) -> tt() isPalListKind(n__o()) -> tt() isPalListKind(n__u()) -> tt() isQid(n__a()) -> tt() isQid(n__e()) -> tt() isQid(n__i()) -> tt() isQid(n__o()) -> tt() isQid(n__u()) -> tt() nil() -> n__nil() o() -> n__o() u() -> n__u() - Signature: {U11/2,U12/1,U21/3,U22/2,U23/1,U31/2,U32/1,U41/3,U42/2,U43/1,U51/3,U52/2,U53/1,U61/2,U62/1,U71/2,U72/1,__/2 ,a/0,activate/1,and/2,e/0,i/0,isList/1,isNeList/1,isNePal/1,isPal/1,isPalListKind/1,isQid/1,nil/0,o/0 ,u/0} / {n____/2,n__a/0,n__and/2,n__e/0,n__i/0,n__isPal/1,n__isPalListKind/1,n__nil/0,n__o/0,n__u/0,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,U21,U22,U23,U31,U32,U41,U42,U43,U51,U52,U53,U61,U62,U71 ,U72,__,a,activate,and,e,i,isList,isNeList,isNePal,isPal,isPalListKind,isQid,nil,o ,u} and constructors {n____,n__a,n__and,n__e,n__i,n__isPal,n__isPalListKind,n__nil,n__o,n__u,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(tt(),V) -> U12(isNeList(activate(V))) U12(tt()) -> tt() U21(tt(),V1,V2) -> U22(isList(activate(V1)),activate(V2)) U22(tt(),V2) -> U23(isList(activate(V2)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127