Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716021
details
property
value
status
complete
benchmark
MYNAT_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
28.3377149105 seconds
cpu usage
27.157661789
max memory
1.5806464E7
stage attributes
key
value
output-size
34158
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 M N X X1 X2) (RULES a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0) -> 0 a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__x(X1,X2) -> x(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) A__X(N,s(M)) -> A__PLUS(a__x(mark(N),mark(M)),mark(N)) A__X(N,s(M)) -> A__X(mark(N),mark(M)) A__X(N,s(M)) -> MARK(M) A__X(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) MARK(x(X1,X2)) -> A__X(mark(X1),mark(X2)) MARK(x(X1,X2)) -> MARK(X1) MARK(x(X1,X2)) -> MARK(X2) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0) -> 0 a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__x(X1,X2) -> x(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) Problem 1: SCC Processor: -> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) A__X(N,s(M)) -> A__PLUS(a__x(mark(N),mark(M)),mark(N)) A__X(N,s(M)) -> A__X(mark(N),mark(M)) A__X(N,s(M)) -> MARK(M) A__X(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) MARK(x(X1,X2)) -> A__X(mark(X1),mark(X2)) MARK(x(X1,X2)) -> MARK(X1) MARK(x(X1,X2)) -> MARK(X2) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) a__x(N,0) -> 0 a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N)) a__x(X1,X2) -> x(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472