Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903632
details
property
value
status
timeout (wallclock)
benchmark
MYNAT_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.131222963 seconds
cpu usage
600.819344862
max memory
3.7706256384E10
stage attributes
unavailable
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),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__and(X1,X2) -> and(X1,X2) a__and(tt(),X) -> mark(X) a__plus(N,0()) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0()) -> 0() a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__x(X1,X2) -> x(X1,X2) mark(0()) -> 0() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) - Signature: {a__and/2,a__plus/2,a__x/2,mark/1} / {0/0,and/2,plus/2,s/1,tt/0,x/2} - Obligation: runtime complexity wrt. defined symbols {a__and,a__plus,a__x,mark} and constructors {0,and,plus,s,tt,x} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__and(X1,X2) -> and(X1,X2) a__and(tt(),X) -> mark(X) a__plus(N,0()) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0()) -> 0() a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__x(X1,X2) -> x(X1,X2) mark(0()) -> 0() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) - Signature: {a__and/2,a__plus/2,a__x/2,mark/1} / {0/0,and/2,plus/2,s/1,tt/0,x/2} - Obligation: runtime complexity wrt. defined symbols {a__and,a__plus,a__x,mark} and constructors {0,and,plus,s,tt,x} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> and(x,y)} = mark(and(x,y)) ->^+ a__and(mark(x),y) = C[mark(x) = mark(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 Full Rewri 10127