Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902619
details
property
value
status
timeout (wallclock)
benchmark
cade05t.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
GTSSK07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.185112 seconds
cpu usage
735.906135926
max memory
2.9069791232E10
stage attributes
unavailable
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: cond(true(),x,y) -> s(minus(x,s(y))) equal(0(),0()) -> true() equal(0(),s(y)) -> false() equal(s(x),0()) -> false() equal(s(x),s(y)) -> equal(x,y) min(u,0()) -> 0() min(0(),v) -> 0() min(s(u),s(v)) -> s(min(u,v)) minus(x,y) -> cond(equal(min(x,y),y),x,y) - Signature: {cond/3,equal/2,min/2,minus/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {cond,equal,min,minus} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x,y) -> s(minus(x,s(y))) equal(0(),0()) -> true() equal(0(),s(y)) -> false() equal(s(x),0()) -> false() equal(s(x),s(y)) -> equal(x,y) min(u,0()) -> 0() min(0(),v) -> 0() min(s(u),s(v)) -> s(min(u,v)) minus(x,y) -> cond(equal(min(x,y),y),x,y) - Signature: {cond/3,equal/2,min/2,minus/2} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {cond,equal,min,minus} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: equal(x,y){x -> s(x),y -> s(y)} = equal(s(x),s(y)) ->^+ equal(x,y) = C[equal(x,y) = equal(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 Full Rewri 10127