Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487524146
details
property
value
status
complete
benchmark
PEANO_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.214032173157 seconds
cpu usage
0.180431067
max memory
4775936.0
stage attributes
key
value
output-size
18494
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 M:S N:S X:S X1:S X2:S) (RULES a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__PLUS(N:S,0) -> MARK(N:S) A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) A__PLUS(N:S,s(M:S)) -> MARK(M:S) A__PLUS(N:S,s(M:S)) -> MARK(N:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__PLUS(N:S,0) -> MARK(N:S) A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) A__PLUS(N:S,s(M:S)) -> MARK(M:S) A__PLUS(N:S,s(M:S)) -> MARK(N:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__PLUS(N:S,0) -> MARK(N:S) A__PLUS(N:S,s(M:S)) -> A__PLUS(mark(N:S),mark(M:S)) A__PLUS(N:S,s(M:S)) -> MARK(M:S) A__PLUS(N:S,s(M:S)) -> MARK(N:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__plus(N:S,0) -> mark(N:S) a__plus(N:S,s(M:S)) -> s(a__plus(mark(N:S),mark(M:S))) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost