Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903215
details
property
value
status
complete
benchmark
PALINDROME_nosorts_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.179487943649 seconds
cpu usage
0.70873616
max memory
3.8559744E7
stage attributes
key
value
output-size
10509
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /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: U11(mark(X)) -> mark(U11(X)) U11(ok(X)) -> ok(U11(X)) U12(mark(X)) -> mark(U12(X)) U12(ok(X)) -> ok(U12(X)) __(X1,mark(X2)) -> mark(__(X1,X2)) __(mark(X1),X2) -> mark(__(X1,X2)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) active(U11(X)) -> U11(active(X)) active(U11(tt())) -> mark(U12(tt())) active(U12(X)) -> U12(active(X)) active(U12(tt())) -> mark(tt()) active(__(X,nil())) -> mark(X) active(__(X1,X2)) -> __(X1,active(X2)) active(__(X1,X2)) -> __(active(X1),X2) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil(),X)) -> mark(X) active(isNePal(X)) -> isNePal(active(X)) active(isNePal(__(I,__(P,I)))) -> mark(U11(tt())) isNePal(mark(X)) -> mark(isNePal(X)) isNePal(ok(X)) -> ok(isNePal(X)) proper(U11(X)) -> U11(proper(X)) proper(U12(X)) -> U12(proper(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(isNePal(X)) -> isNePal(proper(X)) proper(nil()) -> ok(nil()) proper(tt()) -> ok(tt()) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {U11/1,U12/1,__/2,active/1,isNePal/1,proper/1,top/1} / {mark/1,nil/0,ok/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,__,active,isNePal,proper,top} and constructors {mark,nil ,ok,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(mark(X)) -> mark(U11(X)) U11(ok(X)) -> ok(U11(X)) U12(mark(X)) -> mark(U12(X)) U12(ok(X)) -> ok(U12(X)) __(X1,mark(X2)) -> mark(__(X1,X2)) __(mark(X1),X2) -> mark(__(X1,X2)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) active(U11(X)) -> U11(active(X)) active(U11(tt())) -> mark(U12(tt())) active(U12(X)) -> U12(active(X)) active(U12(tt())) -> mark(tt()) active(__(X,nil())) -> mark(X) active(__(X1,X2)) -> __(X1,active(X2)) active(__(X1,X2)) -> __(active(X1),X2) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil(),X)) -> mark(X) active(isNePal(X)) -> isNePal(active(X)) active(isNePal(__(I,__(P,I)))) -> mark(U11(tt())) isNePal(mark(X)) -> mark(isNePal(X)) isNePal(ok(X)) -> ok(isNePal(X)) proper(U11(X)) -> U11(proper(X)) proper(U12(X)) -> U12(proper(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(isNePal(X)) -> isNePal(proper(X)) proper(nil()) -> ok(nil()) proper(tt()) -> ok(tt()) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {U11/1,U12/1,__/2,active/1,isNePal/1,proper/1,top/1} / {mark/1,nil/0,ok/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,__,active,isNePal,proper,top} and constructors {mark,nil ,ok,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: U11(x){x -> mark(x)} = U11(mark(x)) ->^+ mark(U11(x)) = C[U11(x) = U11(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: U11(mark(X)) -> mark(U11(X)) U11(ok(X)) -> ok(U11(X)) U12(mark(X)) -> mark(U12(X)) U12(ok(X)) -> ok(U12(X)) __(X1,mark(X2)) -> mark(__(X1,X2)) __(mark(X1),X2) -> mark(__(X1,X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127