details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.148113012314 seconds
cpu usage	0.120948189
max memory	4599808.0

stage attributes

key	value
output-size	12576
starexec-result	"YES"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES activate(n__first(X1:S,X2:S)) -> first(activate(X1:S),activate(X2:S)) activate(n__from(X:S)) -> from(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(0,X:S) -> nil first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(n__s(X:S))) from(X:S) -> n__from(X:S) s(X:S) -> n__s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X1:S) ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X2:S) ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(activate(X1:S),activate(X2:S)) ACTIVATE(n__from(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__from(X:S)) -> FROM(activate(X:S)) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> S(activate(X:S)) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) -> Rules: activate(n__first(X1:S,X2:S)) -> first(activate(X1:S),activate(X2:S)) activate(n__from(X:S)) -> from(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(0,X:S) -> nil first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(n__s(X:S))) from(X:S) -> n__from(X:S) s(X:S) -> n__s(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X1:S) ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X2:S) ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(activate(X1:S),activate(X2:S)) ACTIVATE(n__from(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__from(X:S)) -> FROM(activate(X:S)) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> S(activate(X:S)) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) -> Rules: activate(n__first(X1:S,X2:S)) -> first(activate(X1:S),activate(X2:S)) activate(n__from(X:S)) -> from(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(0,X:S) -> nil first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(n__s(X:S))) from(X:S) -> n__from(X:S) s(X:S) -> n__s(X:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X1:S) ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X2:S) ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(activate(X1:S),activate(X2:S)) ACTIVATE(n__from(X:S)) -> ACTIVATE(X:S) ACTIVATE(n__s(X:S)) -> ACTIVATE(X:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) ->->-> Rules: activate(n__first(X1:S,X2:S)) -> first(activate(X1:S),activate(X2:S)) activate(n__from(X:S)) -> from(activate(X:S)) activate(n__s(X:S)) -> s(activate(X:S)) activate(X:S) -> X:S first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(0,X:S) -> nil first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(n__s(X:S))) from(X:S) -> n__from(X:S) s(X:S) -> n__s(X:S) Problem 1: Reduction Pair Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X1:S) ACTIVATE(n__first(X1:S,X2:S)) -> ACTIVATE(X2:S) ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(activate(X1:S),activate(X2:S)) ACTIVATE(n__from(X:S)) -> ACTIVATE(X:S) popout

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

job log

popout

actions

all output return to TRS Standard