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