Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904189
details
property
value
status
complete
benchmark
filliatre.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.34021616 seconds
cpu usage
1138.68775965
max memory
6.005583872E9
stage attributes
key
value
output-size
2439
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),A()) -> f''(foldf(triple(cons(A(),a),nil(),c),b)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),C()) -> triple(a,b,cons(C(),c)) f''(triple(a,b,c)) -> foldf(triple(a,b,nil()),c) foldf(x,cons(y,z)) -> f(foldf(x,z),y) foldf(x,nil()) -> x g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() - Signature: {f/2,f'/2,f''/1,foldf/2,g/1} / {A/0,B/0,C/0,cons/2,nil/0,triple/3} - Obligation: innermost runtime complexity wrt. defined symbols {f,f',f'',foldf,g} and constructors {A,B,C,cons,nil ,triple} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),A()) -> f''(foldf(triple(cons(A(),a),nil(),c),b)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),C()) -> triple(a,b,cons(C(),c)) f''(triple(a,b,c)) -> foldf(triple(a,b,nil()),c) foldf(x,cons(y,z)) -> f(foldf(x,z),y) foldf(x,nil()) -> x g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() - Signature: {f/2,f'/2,f''/1,foldf/2,g/1} / {A/0,B/0,C/0,cons/2,nil/0,triple/3} - Obligation: innermost runtime complexity wrt. defined symbols {f,f',f'',foldf,g} and constructors {A,B,C,cons,nil ,triple} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: foldf(x,z){z -> cons(y,z)} = foldf(x,cons(y,z)) ->^+ f(foldf(x,z),y) = C[foldf(x,z) = foldf(x,z){}] 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