Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904970
details
property
value
status
complete
benchmark
2.44.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
1.37525582314 seconds
cpu usage
5.257930817
max memory
7.8180352E7
stage attributes
key
value
output-size
18489
starexec-result
WORST_CASE(?,O(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(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v())) =(.(x,y),nil()) -> false() =(nil(),.(y,z)) -> false() =(nil(),nil()) -> true() del(.(x,.(y,z))) -> f(=(x,y),x,y,z) f(false(),x,y,z) -> .(x,del(.(y,z))) f(true(),x,y,z) -> del(.(y,z)) - Signature: {=/2,del/1,f/4} / {./2,and/2,false/0,nil/0,true/0,u/0,v/0} - Obligation: innermost runtime complexity wrt. defined symbols {=,del,f} and constructors {.,and,false,nil,true,u,v} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v())) =(.(x,y),nil()) -> false() =(nil(),.(y,z)) -> false() =(nil(),nil()) -> true() del(.(x,.(y,z))) -> f(=(x,y),x,y,z) f(false(),x,y,z) -> .(x,del(.(y,z))) f(true(),x,y,z) -> del(.(y,z)) - Signature: {=/2,del/1,f/4} / {./2,and/2,false/0,nil/0,true/0,u/0,v/0} - Obligation: innermost runtime complexity wrt. defined symbols {=,del,f} and constructors {.,and,false,nil,true,u,v} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs =#(.(x,y),.(u(),v())) -> c_1(=#(x,u()),=#(y,v())) =#(.(x,y),nil()) -> c_2() =#(nil(),.(y,z)) -> c_3() =#(nil(),nil()) -> c_4() del#(.(x,.(y,z))) -> c_5(f#(=(x,y),x,y,z),=#(x,y)) f#(false(),x,y,z) -> c_6(del#(.(y,z))) f#(true(),x,y,z) -> c_7(del#(.(y,z))) Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: =#(.(x,y),.(u(),v())) -> c_1(=#(x,u()),=#(y,v())) =#(.(x,y),nil()) -> c_2() =#(nil(),.(y,z)) -> c_3() =#(nil(),nil()) -> c_4() del#(.(x,.(y,z))) -> c_5(f#(=(x,y),x,y,z),=#(x,y)) f#(false(),x,y,z) -> c_6(del#(.(y,z))) f#(true(),x,y,z) -> c_7(del#(.(y,z))) - Weak TRS: =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v())) =(.(x,y),nil()) -> false() =(nil(),.(y,z)) -> false() =(nil(),nil()) -> true() del(.(x,.(y,z))) -> f(=(x,y),x,y,z) f(false(),x,y,z) -> .(x,del(.(y,z))) f(true(),x,y,z) -> del(.(y,z)) - Signature: {=/2,del/1,f/4,=#/2,del#/1,f#/4} / {./2,and/2,false/0,nil/0,true/0,u/0,v/0,c_1/2,c_2/0,c_3/0,c_4/0,c_5/2 ,c_6/1,c_7/1} - Obligation: innermost runtime complexity wrt. defined symbols {=#,del#,f#} and constructors {.,and,false,nil,true,u,v} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,2,3,4} by application of Pre({1,2,3,4}) = {5}. Here rules are labelled as follows: 1: =#(.(x,y),.(u(),v())) -> c_1(=#(x,u()),=#(y,v())) 2: =#(.(x,y),nil()) -> c_2() 3: =#(nil(),.(y,z)) -> c_3() 4: =#(nil(),nil()) -> c_4() 5: del#(.(x,.(y,z))) -> c_5(f#(=(x,y),x,y,z),=#(x,y)) 6: f#(false(),x,y,z) -> c_6(del#(.(y,z))) 7: f#(true(),x,y,z) -> c_7(del#(.(y,z))) * Step 4: RemoveWeakSuffixes WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: del#(.(x,.(y,z))) -> c_5(f#(=(x,y),x,y,z),=#(x,y)) f#(false(),x,y,z) -> c_6(del#(.(y,z))) f#(true(),x,y,z) -> c_7(del#(.(y,z)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807