details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.511497020721 seconds
cpu usage	0.41235062
max memory	4853760.0

stage attributes

key	value
output-size	8073
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES a__2nd(cons(X:S,cons(Y:S,Z:S))) -> mark(Y:S) a__2nd(X:S) -> 2nd(X:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(2nd(X:S)) -> a__2nd(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__2ND(cons(X:S,cons(Y:S,Z:S))) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(2nd(X:S)) -> A__2ND(mark(X:S)) MARK(2nd(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__2nd(cons(X:S,cons(Y:S,Z:S))) -> mark(Y:S) a__2nd(X:S) -> 2nd(X:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(2nd(X:S)) -> a__2nd(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__2ND(cons(X:S,cons(Y:S,Z:S))) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(2nd(X:S)) -> A__2ND(mark(X:S)) MARK(2nd(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__2nd(cons(X:S,cons(Y:S,Z:S))) -> mark(Y:S) a__2nd(X:S) -> 2nd(X:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(2nd(X:S)) -> a__2nd(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__2ND(cons(X:S,cons(Y:S,Z:S))) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(2nd(X:S)) -> A__2ND(mark(X:S)) MARK(2nd(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__2nd(cons(X:S,cons(Y:S,Z:S))) -> mark(Y:S) a__2nd(X:S) -> 2nd(X:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(2nd(X:S)) -> a__2nd(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) Problem 1: Reduction Pairs Processor: -> Pairs: A__2ND(cons(X:S,cons(Y:S,Z:S))) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(2nd(X:S)) -> A__2ND(mark(X:S)) MARK(2nd(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: popout

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

job log

popout

actions

all output return to TRS Innermost