Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716871
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
n048.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.101797103882 seconds
cpu usage
0.096263571
max memory
4747264.0
stage attributes
key
value
output-size
11194
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 X X1 X2 Y Z) (RULES activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) s(X) -> n__s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__first(X1,X2)) -> FIRST(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) -> Rules: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) s(X) -> n__s(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__first(X1,X2)) -> FIRST(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) -> Rules: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) s(X) -> n__s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__first(X1,X2)) -> FIRST(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> ACTIVATE(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) ->->-> Rules: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) s(X) -> n__s(X) Problem 1: Reduction Pair Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__first(X1,X2)) -> ACTIVATE(X2) ACTIVATE(n__first(X1,X2)) -> FIRST(activate(X1),activate(X2)) ACTIVATE(n__from(X)) -> ACTIVATE(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472