Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903586
details
property
value
status
complete
benchmark
PEANO_nosorts_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.822041988373 seconds
cpu usage
3.155704397
max memory
8.7298048E7
stage attributes
key
value
output-size
17717
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: U11(mark(X1),X2,X3) -> mark(U11(X1,X2,X3)) U11(ok(X1),ok(X2),ok(X3)) -> ok(U11(X1,X2,X3)) U12(mark(X1),X2,X3) -> mark(U12(X1,X2,X3)) U12(ok(X1),ok(X2),ok(X3)) -> ok(U12(X1,X2,X3)) active(U11(X1,X2,X3)) -> U11(active(X1),X2,X3) active(U11(tt(),M,N)) -> mark(U12(tt(),M,N)) active(U12(X1,X2,X3)) -> U12(active(X1),X2,X3) active(U12(tt(),M,N)) -> mark(s(plus(N,M))) active(plus(N,0())) -> mark(N) active(plus(N,s(M))) -> mark(U11(tt(),M,N)) active(plus(X1,X2)) -> plus(X1,active(X2)) active(plus(X1,X2)) -> plus(active(X1),X2) active(s(X)) -> s(active(X)) plus(X1,mark(X2)) -> mark(plus(X1,X2)) plus(mark(X1),X2) -> mark(plus(X1,X2)) plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) proper(0()) -> ok(0()) proper(U11(X1,X2,X3)) -> U11(proper(X1),proper(X2),proper(X3)) proper(U12(X1,X2,X3)) -> U12(proper(X1),proper(X2),proper(X3)) proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(tt()) -> ok(tt()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {U11/3,U12/3,active/1,plus/2,proper/1,s/1,top/1} / {0/0,mark/1,ok/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,active,plus,proper,s,top} and constructors {0,mark,ok,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(mark(X1),X2,X3) -> mark(U11(X1,X2,X3)) U11(ok(X1),ok(X2),ok(X3)) -> ok(U11(X1,X2,X3)) U12(mark(X1),X2,X3) -> mark(U12(X1,X2,X3)) U12(ok(X1),ok(X2),ok(X3)) -> ok(U12(X1,X2,X3)) active(U11(X1,X2,X3)) -> U11(active(X1),X2,X3) active(U11(tt(),M,N)) -> mark(U12(tt(),M,N)) active(U12(X1,X2,X3)) -> U12(active(X1),X2,X3) active(U12(tt(),M,N)) -> mark(s(plus(N,M))) active(plus(N,0())) -> mark(N) active(plus(N,s(M))) -> mark(U11(tt(),M,N)) active(plus(X1,X2)) -> plus(X1,active(X2)) active(plus(X1,X2)) -> plus(active(X1),X2) active(s(X)) -> s(active(X)) plus(X1,mark(X2)) -> mark(plus(X1,X2)) plus(mark(X1),X2) -> mark(plus(X1,X2)) plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) proper(0()) -> ok(0()) proper(U11(X1,X2,X3)) -> U11(proper(X1),proper(X2),proper(X3)) proper(U12(X1,X2,X3)) -> U12(proper(X1),proper(X2),proper(X3)) proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(tt()) -> ok(tt()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {U11/3,U12/3,active/1,plus/2,proper/1,s/1,top/1} / {0/0,mark/1,ok/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,active,plus,proper,s,top} and constructors {0,mark,ok,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: U11(x,y,z){x -> mark(x)} = U11(mark(x),y,z) ->^+ mark(U11(x,y,z)) = C[U11(x,y,z) = U11(x,y,z){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: U11(mark(X1),X2,X3) -> mark(U11(X1,X2,X3)) U11(ok(X1),ok(X2),ok(X3)) -> ok(U11(X1,X2,X3)) U12(mark(X1),X2,X3) -> mark(U12(X1,X2,X3)) U12(ok(X1),ok(X2),ok(X3)) -> ok(U12(X1,X2,X3)) active(U11(X1,X2,X3)) -> U11(active(X1),X2,X3) active(U11(tt(),M,N)) -> mark(U12(tt(),M,N)) active(U12(X1,X2,X3)) -> U12(active(X1),X2,X3) active(U12(tt(),M,N)) -> mark(s(plus(N,M))) active(plus(N,0())) -> mark(N) active(plus(N,s(M))) -> mark(U11(tt(),M,N)) active(plus(X1,X2)) -> plus(X1,active(X2)) active(plus(X1,X2)) -> plus(active(X1),X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127