Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904131
details
property
value
status
complete
benchmark
ack_prolog.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.232370138 seconds
cpu usage
1103.25508013
max memory
3.422236672E9
stage attributes
key
value
output-size
1892
starexec-result
WORST_CASE(Omega(n^1),?)
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),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) - Signature: {ack_in/2,u11/1,u21/2,u22/1} / {0/0,ack_out/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {ack_in,u11,u21,u22} and constructors {0,ack_out,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u11(ack_out(n)) -> ack_out(n) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) - Signature: {ack_in/2,u11/1,u21/2,u22/1} / {0/0,ack_out/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {ack_in,u11,u21,u22} and constructors {0,ack_out,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: ack_in(s(x),y){y -> s(y)} = ack_in(s(x),s(y)) ->^+ u21(ack_in(s(x),y),x) = C[ack_in(s(x),y) = ack_in(s(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 Inner Rewri 22807