Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072609
details
property
value
status
complete
benchmark
9.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n173.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.109412 seconds
cpu usage
0.076489
user time
0.04605
system time
0.030439
max virtual memory
113188.0
max residence set size
5604.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond(ttrue,x:S,y:S,z:S) -> cond(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) gr(0,0) -> ffalse gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ) Problem 1: Innermost Equivalent Processor: -> Rules: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond(ttrue,x:S,y:S,z:S) -> cond(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) gr(0,0) -> ffalse gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: COND(ttrue,x:S,y:S,z:S) -> AND(gr(x:S,z:S),gr(y:S,z:S)) COND(ttrue,x:S,y:S,z:S) -> COND(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) COND(ttrue,x:S,y:S,z:S) -> GR(x:S,z:S) COND(ttrue,x:S,y:S,z:S) -> GR(y:S,z:S) COND(ttrue,x:S,y:S,z:S) -> P(x:S) COND(ttrue,x:S,y:S,z:S) -> P(y:S) GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond(ttrue,x:S,y:S,z:S) -> cond(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) gr(0,0) -> ffalse gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: COND(ttrue,x:S,y:S,z:S) -> AND(gr(x:S,z:S),gr(y:S,z:S)) COND(ttrue,x:S,y:S,z:S) -> COND(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) COND(ttrue,x:S,y:S,z:S) -> GR(x:S,z:S) COND(ttrue,x:S,y:S,z:S) -> GR(y:S,z:S) COND(ttrue,x:S,y:S,z:S) -> P(x:S) COND(ttrue,x:S,y:S,z:S) -> P(y:S) GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond(ttrue,x:S,y:S,z:S) -> cond(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) gr(0,0) -> ffalse gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: GR(s(x:S),s(y:S)) -> GR(x:S,y:S) ->->-> Rules: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond(ttrue,x:S,y:S,z:S) -> cond(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) gr(0,0) -> ffalse gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->->Cycle: ->->-> Pairs: COND(ttrue,x:S,y:S,z:S) -> COND(and(gr(x:S,z:S),gr(y:S,z:S)),p(x:S),p(y:S),z:S) ->->-> Rules: and(ffalse,x:S) -> ffalse
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard