Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903474
details
property
value
status
complete
benchmark
Ex4_4_Luc96b_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)
295.060217857 seconds
cpu usage
345.368130963
max memory
5.42980096E9
stage attributes
key
value
output-size
2234
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: active(f(X1,X2)) -> f(active(X1),X2) active(f(g(X),Y)) -> mark(f(X,f(g(X),Y))) active(g(X)) -> g(active(X)) f(mark(X1),X2) -> mark(f(X1,X2)) f(ok(X1),ok(X2)) -> ok(f(X1,X2)) g(mark(X)) -> mark(g(X)) g(ok(X)) -> ok(g(X)) proper(f(X1,X2)) -> f(proper(X1),proper(X2)) proper(g(X)) -> g(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/2,g/1,proper/1,top/1} / {mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,f,g,proper,top} and constructors {mark,ok} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(f(X1,X2)) -> f(active(X1),X2) active(f(g(X),Y)) -> mark(f(X,f(g(X),Y))) active(g(X)) -> g(active(X)) f(mark(X1),X2) -> mark(f(X1,X2)) f(ok(X1),ok(X2)) -> ok(f(X1,X2)) g(mark(X)) -> mark(g(X)) g(ok(X)) -> ok(g(X)) proper(f(X1,X2)) -> f(proper(X1),proper(X2)) proper(g(X)) -> g(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/2,g/1,proper/1,top/1} / {mark/1,ok/1} - Obligation: runtime complexity wrt. defined symbols {active,f,g,proper,top} and constructors {mark,ok} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x,y){x -> mark(x)} = f(mark(x),y) ->^+ mark(f(x,y)) = C[f(x,y) = f(x,y){}] WORST_CASE(Omega(n^1),?)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127