Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904586
details
property
value
status
complete
benchmark
perfect.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
Mixed_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
1.7143239975 seconds
cpu usage
5.887918041
max memory
7.1409664E7
stage attributes
key
value
output-size
13968
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) - Signature: {f/4,perfectp/1} / {0/0,false/0,if/3,le/2,minus/2,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {f,perfectp} and constructors {0,false,if,le,minus,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) - Signature: {f/4,perfectp/1} / {0/0,false/0,if/3,le/2,minus/2,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {f,perfectp} and constructors {0,false,if,le,minus,s,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(0(),y,0(),u) -> c_1() f#(0(),y,s(z),u) -> c_2() f#(s(x),0(),z,u) -> c_3(f#(x,u,minus(z,s(x)),u)) f#(s(x),s(y),z,u) -> c_4(f#(s(x),minus(y,x),z,u),f#(x,u,z,u)) perfectp#(0()) -> c_5() perfectp#(s(x)) -> c_6(f#(x,s(0()),s(x),s(x))) Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: f#(0(),y,0(),u) -> c_1() f#(0(),y,s(z),u) -> c_2() f#(s(x),0(),z,u) -> c_3(f#(x,u,minus(z,s(x)),u)) f#(s(x),s(y),z,u) -> c_4(f#(s(x),minus(y,x),z,u),f#(x,u,z,u)) perfectp#(0()) -> c_5() perfectp#(s(x)) -> c_6(f#(x,s(0()),s(x),s(x))) - Weak TRS: f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) - Signature: {f/4,perfectp/1,f#/4,perfectp#/1} / {0/0,false/0,if/3,le/2,minus/2,s/1,true/0,c_1/0,c_2/0,c_3/1,c_4/2,c_5/0 ,c_6/1} - Obligation: innermost runtime complexity wrt. defined symbols {f#,perfectp#} and constructors {0,false,if,le,minus,s ,true} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,2,5} by application of Pre({1,2,5}) = {4,6}. Here rules are labelled as follows: 1: f#(0(),y,0(),u) -> c_1() 2: f#(0(),y,s(z),u) -> c_2() 3: f#(s(x),0(),z,u) -> c_3(f#(x,u,minus(z,s(x)),u)) 4: f#(s(x),s(y),z,u) -> c_4(f#(s(x),minus(y,x),z,u),f#(x,u,z,u)) 5: perfectp#(0()) -> c_5() 6: perfectp#(s(x)) -> c_6(f#(x,s(0()),s(x),s(x))) * Step 4: RemoveWeakSuffixes WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: f#(s(x),0(),z,u) -> c_3(f#(x,u,minus(z,s(x)),u)) f#(s(x),s(y),z,u) -> c_4(f#(s(x),minus(y,x),z,u),f#(x,u,z,u)) perfectp#(s(x)) -> c_6(f#(x,s(0()),s(x),s(x))) - Weak DPs: f#(0(),y,0(),u) -> c_1() f#(0(),y,s(z),u) -> c_2() perfectp#(0()) -> c_5() - Weak TRS:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807