Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711756
details
property
value
status
complete
benchmark
23.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0488460063934 seconds
cpu usage
0.040840301
max memory
3354624.0
stage attributes
key
value
output-size
2710
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 y) (RULES g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) ) Problem 1: Dependency Pairs Processor: -> Pairs: G(f(x,y),0) -> G(x,0) G(f(x,y),0) -> G(y,0) G(s(x),y) -> G(f(x,y),0) G(x,s(y)) -> G(f(x,y),0) -> Rules: g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) Problem 1: SCC Processor: -> Pairs: G(f(x,y),0) -> G(x,0) G(f(x,y),0) -> G(y,0) G(s(x),y) -> G(f(x,y),0) G(x,s(y)) -> G(f(x,y),0) -> Rules: g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(f(x,y),0) -> G(x,0) G(f(x,y),0) -> G(y,0) G(s(x),y) -> G(f(x,y),0) ->->-> Rules: g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) Problem 1: Reduction Pair Processor: -> Pairs: G(f(x,y),0) -> G(x,0) G(f(x,y),0) -> G(y,0) G(s(x),y) -> G(f(x,y),0) -> Rules: g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0] = 0 [f](X1,X2) = 2.X1 + X2 + 2 [s](X) = 2.X + 2 [G](X1,X2) = 2.X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: G(f(x,y),0) -> G(y,0) G(s(x),y) -> G(f(x,y),0) -> Rules: g(0,f(x,x)) -> x g(f(x,y),0) -> f(g(x,0),g(y,0)) g(s(x),y) -> g(f(x,y),0) g(x,s(y)) -> g(f(x,y),0) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472