Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714621
details
property
value
status
complete
benchmark
Ex15_Luc98_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0689380168915 seconds
cpu usage
0.054982775
max memory
3784704.0
stage attributes
key
value
output-size
11682
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__add(X1,X2)) -> add(X1,X2) activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(n__add(activate(X),activate(Y))) add(0,X) -> activate(X) add(X1,X2) -> n__add(X1,X2) and(false,Y) -> false and(true,X) -> activate(X) first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(activate(X),n__from(n__s(activate(X)))) from(X) -> n__from(X) if(false,X,Y) -> activate(Y) if(true,X,Y) -> activate(X) s(X) -> n__s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__add(X1,X2)) -> ADD(X1,X2) ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__from(X)) -> FROM(X) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ACTIVATE(X) ADD(s(X),Y) -> ACTIVATE(Y) ADD(s(X),Y) -> S(n__add(activate(X),activate(Y))) ADD(0,X) -> ACTIVATE(X) AND(true,X) -> ACTIVATE(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Y) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) FROM(X) -> ACTIVATE(X) IF(false,X,Y) -> ACTIVATE(Y) IF(true,X,Y) -> ACTIVATE(X) -> Rules: activate(n__add(X1,X2)) -> add(X1,X2) activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(n__add(activate(X),activate(Y))) add(0,X) -> activate(X) add(X1,X2) -> n__add(X1,X2) and(false,Y) -> false and(true,X) -> activate(X) first(s(X),cons(Y,Z)) -> cons(activate(Y),n__first(activate(X),activate(Z))) first(0,X) -> nil first(X1,X2) -> n__first(X1,X2) from(X) -> cons(activate(X),n__from(n__s(activate(X)))) from(X) -> n__from(X) if(false,X,Y) -> activate(Y) if(true,X,Y) -> activate(X) s(X) -> n__s(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__add(X1,X2)) -> ADD(X1,X2) ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__from(X)) -> FROM(X) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ACTIVATE(X) ADD(s(X),Y) -> ACTIVATE(Y) ADD(s(X),Y) -> S(n__add(activate(X),activate(Y))) ADD(0,X) -> ACTIVATE(X) AND(true,X) -> ACTIVATE(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Y) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) FROM(X) -> ACTIVATE(X) IF(false,X,Y) -> ACTIVATE(Y) IF(true,X,Y) -> ACTIVATE(X) -> Rules: activate(n__add(X1,X2)) -> add(X1,X2) activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(n__add(activate(X),activate(Y))) add(0,X) -> activate(X) add(X1,X2) -> n__add(X1,X2) and(false,Y) -> false
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472