Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903394
details
property
value
status
complete
benchmark
Ex6_Luc98_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0144829750061 seconds
cpu usage
0.020334682
max memory
2940928.0
stage attributes
key
value
output-size
4094
starexec-result
WORST_CASE(?,O(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(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1} / {0/0,cons/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {first,from} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: ToInnermost WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1} / {0/0,cons/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {first,from} and constructors {0,cons,nil,s} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules * Step 3: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1} / {0/0,cons/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {first,from} and constructors {0,cons,nil,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs first#(0(),X) -> c_1() first#(s(X),cons(Y)) -> c_2() from#(X) -> c_3() Weak DPs and mark the set of starting terms. * Step 4: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: first#(0(),X) -> c_1() first#(s(X),cons(Y)) -> c_2() from#(X) -> c_3() - Weak TRS: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1,first#/2,from#/1} / {0/0,cons/1,nil/0,s/1,c_1/0,c_2/0,c_3/0} - Obligation: innermost runtime complexity wrt. defined symbols {first#,from#} and constructors {0,cons,nil,s} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: first#(0(),X) -> c_1() first#(s(X),cons(Y)) -> c_2() from#(X) -> c_3() * Step 5: Trivial WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: first#(0(),X) -> c_1() first#(s(X),cons(Y)) -> c_2() from#(X) -> c_3() - Signature: {first/2,from/1,first#/2,from#/1} / {0/0,cons/1,nil/0,s/1,c_1/0,c_2/0,c_3/0} - Obligation: innermost runtime complexity wrt. defined symbols {first#,from#} and constructors {0,cons,nil,s} + Applied Processor: Trivial + Details: Consider the dependency graph 1:S:first#(0(),X) -> c_1() 2:S:first#(s(X),cons(Y)) -> c_2() 3:S:from#(X) -> c_3()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127