Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487523994
details
property
value
status
complete
benchmark
#4.30a.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
20.2246069908 seconds
cpu usage
20.177984016
max memory
4820992.0
stage attributes
key
value
output-size
6125
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> MINUS(s(x:S),s(y:S)) QUOT(s(x:S),s(y:S)) -> QUOT(minus(s(x:S),s(y:S)),s(y:S)) -> Rules: le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) Problem 1: SCC Processor: -> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) QUOT(s(x:S),s(y:S)) -> MINUS(s(x:S),s(y:S)) QUOT(s(x:S),s(y:S)) -> QUOT(minus(s(x:S),s(y:S)),s(y:S)) -> Rules: le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) ->->-> Rules: le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) ->->Cycle: ->->-> Pairs: QUOT(s(x:S),s(y:S)) -> QUOT(minus(s(x:S),s(y:S)),s(y:S)) ->->-> Rules: le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) ->->Cycle: ->->-> Pairs: LE(s(x:S),s(y:S)) -> LE(x:S,y:S) ->->-> Rules: le(0,y:S) -> ttrue le(s(x:S),0) -> ffalse le(s(x:S),s(y:S)) -> le(x:S,y:S) minus(s(x:S),s(y:S)) -> minus(x:S,y:S) minus(x:S,0) -> x:S quot(0,s(y:S)) -> 0 quot(s(x:S),s(y:S)) -> s(quot(minus(s(x:S),s(y:S)),s(y:S))) The problem is decomposed in 3 subproblems. Problem 1.1: Subterm Processor: -> Pairs: MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) -> Rules: le(0,y:S) -> ttrue
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost