Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487523978
details
property
value
status
complete
benchmark
#4.26.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.142944097519 seconds
cpu usage
0.081069122
max memory
3870720.0
stage attributes
key
value
output-size
4098
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 if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(x:S,y:S) -> if(le(x:S,y:S),x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: IF(ffalse,x:S,y:S) -> MINUS(p(x:S),y:S) IF(ffalse,x:S,y:S) -> P(x:S) LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(x:S,y:S) -> IF(le(x:S,y:S),x:S,y:S) MINUS(x:S,y:S) -> LE(x:S,y:S) -> Rules: if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(x:S,y:S) -> if(le(x:S,y:S),x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: IF(ffalse,x:S,y:S) -> MINUS(p(x:S),y:S) IF(ffalse,x:S,y:S) -> P(x:S) LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(x:S,y:S) -> IF(le(x:S,y:S),x:S,y:S) MINUS(x:S,y:S) -> LE(x:S,y:S) -> Rules: if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(x:S,y:S) -> if(le(x:S,y:S),x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) ->->-> Rules: if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(x:S,y:S) -> if(le(x:S,y:S),x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->->Cycle: ->->-> Pairs: IF(ffalse,x:S,y:S) -> MINUS(p(x:S),y:S) MINUS(x:S,y:S) -> IF(le(x:S,y:S),x:S,y:S) ->->-> Rules: if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(x:S,y:S) -> if(le(x:S,y:S),x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) -> Rules: if(ffalse,x:S,y:S) -> s(minus(p(x:S),y:S)) if(ttrue,x:S,y:S) -> 0 le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost