details

property	value
status	complete
benchmark	match.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n078.star.cs.uiowa.edu
space	Frederiksen_Others

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	4.8576130867 seconds
cpu usage	19.863738191
max memory	1.42032896E8

stage attributes

key	value
output-size	3993
starexec-result	WORST_CASE(?,O(n^2))

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^2)) * Step 1: Sum WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: loop(Cons(x,xs),Nil(),pp,ss) -> False() loop(Cons(x',xs'),Cons(x,xs),pp,ss) -> loop[Ite](!EQ(x',x),Cons(x',xs'),Cons(x,xs),pp,ss) loop(Nil(),s,pp,ss) -> True() match1(p,s) -> loop(p,s,p,s) - Weak TRS: !EQ(0(),0()) -> True() !EQ(0(),S(y)) -> False() !EQ(S(x),0()) -> False() !EQ(S(x),S(y)) -> !EQ(x,y) loop[Ite](False(),p,s,pp,Cons(x,xs)) -> loop(pp,xs,pp,xs) loop[Ite](True(),Cons(x',xs'),Cons(x,xs),pp,ss) -> loop(xs',xs,pp,ss) - Signature: {!EQ/2,loop/4,loop[Ite]/5,match1/2} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {!EQ,loop,loop[Ite],match1} and constructors {0,Cons,False ,Nil,S,True} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: loop(Cons(x,xs),Nil(),pp,ss) -> False() loop(Cons(x',xs'),Cons(x,xs),pp,ss) -> loop[Ite](!EQ(x',x),Cons(x',xs'),Cons(x,xs),pp,ss) loop(Nil(),s,pp,ss) -> True() match1(p,s) -> loop(p,s,p,s) - Weak TRS: !EQ(0(),0()) -> True() !EQ(0(),S(y)) -> False() !EQ(S(x),0()) -> False() !EQ(S(x),S(y)) -> !EQ(x,y) loop[Ite](False(),p,s,pp,Cons(x,xs)) -> loop(pp,xs,pp,xs) loop[Ite](True(),Cons(x',xs'),Cons(x,xs),pp,ss) -> loop(xs',xs,pp,ss) - Signature: {!EQ/2,loop/4,loop[Ite]/5,match1/2} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {!EQ,loop,loop[Ite],match1} and constructors {0,Cons,False ,Nil,S,True} + Applied Processor: Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing} + Details: Signatures used: ---------------- !EQ :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 1) 0 :: [] -(0)-> "A"(0, 0) Cons :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0) Cons :: ["A"(0, 0) x "A"(12, 0)] -(12)-> "A"(12, 0) Cons :: ["A"(0, 0) x "A"(15, 15)] -(15)-> "A"(0, 15) False :: [] -(0)-> "A"(1, 1) False :: [] -(0)-> "A"(0, 1) Nil :: [] -(0)-> "A"(12, 0) Nil :: [] -(0)-> "A"(0, 0) S :: ["A"(0, 0)] -(0)-> "A"(0, 0) True :: [] -(0)-> "A"(1, 1) True :: [] -(0)-> "A"(0, 1) loop :: ["A"(0, 0) x "A"(12, 0) x "A"(0, 5) x "A"(0, 15)] -(12)-> "A"(0, 1) loop[Ite] :: ["A"(1, 1) x "A"(0, 0) x "A"(12, 0) x "A"(0, 5) x "A"(0, 15)] -(2)-> "A"(0, 1) match1 :: ["A"(12, 15) x "A"(14, 15)] -(16)-> "A"(0, 1) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(1, 0) "0_A" :: [] -(0)-> "A"(0, 1) "Cons_A" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0) "Cons_A" :: ["A"(0, 0) x "A"(1, 1)] -(1)-> "A"(0, 1) "False_A" :: [] -(0)-> "A"(1, 0) "False_A" :: [] -(0)-> "A"(0, 1) "Nil_A" :: [] -(0)-> "A"(1, 0) "Nil_A" :: [] -(0)-> "A"(0, 1) "S_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0) "S_A" :: ["A"(1, 1)] -(1)-> "A"(0, 1) "True_A" :: [] -(0)-> "A"(1, 0) "True_A" :: [] -(0)-> "A"(0, 1) WORST_CASE(?,O(n^2)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807