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