Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715631
details
property
value
status
complete
benchmark
Ex9_Luc06_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0445649623871 seconds
cpu usage
0.027045109
max memory
2936832.0
stage attributes
key
value
output-size
3042
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 X3) (RULES a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(a,X,X) -> A__B A__F(a,X,X) -> A__F(X,a__b,b) MARK(b) -> A__B MARK(f(X1,X2,X3)) -> A__F(X1,mark(X2),X3) MARK(f(X1,X2,X3)) -> MARK(X2) -> Rules: a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) Problem 1: SCC Processor: -> Pairs: A__F(a,X,X) -> A__B A__F(a,X,X) -> A__F(X,a__b,b) MARK(b) -> A__B MARK(f(X1,X2,X3)) -> A__F(X1,mark(X2),X3) MARK(f(X1,X2,X3)) -> MARK(X2) -> Rules: a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(a,X,X) -> A__F(X,a__b,b) ->->-> Rules: a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) ->->Cycle: ->->-> Pairs: MARK(f(X1,X2,X3)) -> MARK(X2) ->->-> Rules: a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: A__F(a,X,X) -> A__F(X,a__b,b) -> Rules: a__b -> a a__b -> b a__f(a,X,X) -> a__f(X,a__b,b) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> a__b mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) -> Usable rules: a__b -> a a__b -> b ->Interpretation type:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472