Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902937
details
property
value
status
complete
benchmark
#4.7.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.39875793457 seconds
cpu usage
1.496222685
max memory
4.8726016E7
stage attributes
key
value
output-size
9463
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: 0() -> 1() f(s(x)) -> f(g(x,x)) g(0(),1()) -> s(0()) - Signature: {0/0,f/1,g/2} / {1/0,s/1} - Obligation: runtime complexity wrt. defined symbols {0,f,g} and constructors {1,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0() -> 1() f(s(x)) -> f(g(x,x)) g(0(),1()) -> s(0()) - Signature: {0/0,f/1,g/2} / {1/0,s/1} - Obligation: runtime complexity wrt. defined symbols {0,f,g} and constructors {1,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs 0#() -> c_1() f#(s(x)) -> c_2(f#(g(x,x))) g#(0(),1()) -> c_3(0#()) Weak DPs and mark the set of starting terms. * Step 3: UsableRules WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 0#() -> c_1() f#(s(x)) -> c_2(f#(g(x,x))) g#(0(),1()) -> c_3(0#()) - Strict TRS: 0() -> 1() f(s(x)) -> f(g(x,x)) g(0(),1()) -> s(0()) - Signature: {0/0,f/1,g/2,0#/0,f#/1,g#/2} / {1/0,s/1,c_1/0,c_2/1,c_3/1} - Obligation: runtime complexity wrt. defined symbols {0#,f#,g#} and constructors {1,s} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: 0() -> 1() g(0(),1()) -> s(0()) 0#() -> c_1() f#(s(x)) -> c_2(f#(g(x,x))) * Step 4: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: 0#() -> c_1() f#(s(x)) -> c_2(f#(g(x,x))) - Strict TRS: 0() -> 1() g(0(),1()) -> s(0()) - Signature: {0/0,f/1,g/2,0#/0,f#/1,g#/2} / {1/0,s/1,c_1/0,c_2/1,c_3/1} - Obligation: runtime complexity wrt. defined symbols {0#,f#,g#} and constructors {1,s} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1} by application of Pre({1}) = {}. Here rules are labelled as follows: 1: 0#() -> c_1() 2: f#(s(x)) -> c_2(f#(g(x,x))) * Step 5: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: f#(s(x)) -> c_2(f#(g(x,x))) - Strict TRS: 0() -> 1() g(0(),1()) -> s(0()) - Weak DPs: 0#() -> c_1() - Signature: {0/0,f/1,g/2,0#/0,f#/1,g#/2} / {1/0,s/1,c_1/0,c_2/1,c_3/1} - Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127