Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487524614
details
property
value
status
complete
benchmark
test75.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n153.star.cs.uiowa.edu
space
Mixed_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
20.3244240284 seconds
cpu usage
20.140215998
max memory
4116480.0
stage attributes
key
value
output-size
2258
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 X:S Y:S) (RULES f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: F(0,1,X:S) -> F(g(X:S,X:S),X:S,X:S) F(0,1,X:S) -> G(X:S,X:S) -> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S Problem 1: SCC Processor: -> Pairs: F(0,1,X:S) -> F(g(X:S,X:S),X:S,X:S) F(0,1,X:S) -> G(X:S,X:S) -> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,X:S) -> F(g(X:S,X:S),X:S,X:S) ->->-> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S Problem 1: Instantiation Processor: -> Pairs: F(0,1,X:S) -> F(g(X:S,X:S),X:S,X:S) -> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Instantiated Pairs: ->->Original Pair: F(0,1,X:S) -> F(g(X:S,X:S),X:S,X:S) ->-> Instantiated pairs: F(0,1,1) -> F(g(1,1),1,1) Problem 1: SCC Processor: -> Pairs: F(0,1,1) -> F(g(1,1),1,1) -> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,1) -> F(g(1,1),1,1) ->->-> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S Problem 1: Reduction Pairs Processor: -> Pairs: F(0,1,1) -> F(g(1,1),1,1) -> Rules: f(0,1,X:S) -> f(g(X:S,X:S),X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S -> Usable rules: g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost