Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715826
details
property
value
status
complete
benchmark
Ex1_Luc02b_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0195229053497 seconds
cpu usage
0.01529815
max memory
1626112.0
stage attributes
key
value
output-size
4617
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 X X1 X2 Y Z) (RULES activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(X) -> X first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__from(X)) -> FROM(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) SEL(s(X),cons(Y,Z)) -> ACTIVATE(Z) SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z)) -> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(X) -> X first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__from(X)) -> FROM(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) SEL(s(X),cons(Y,Z)) -> ACTIVATE(Z) SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z)) -> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(X) -> X first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) ->->-> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(X) -> X first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) ->->Cycle: ->->-> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z)) ->->-> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(X) -> X first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) The problem is decomposed in 2 subproblems. Problem 1.1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472