Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966706
details
property
value
status
complete
benchmark
2.40.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n068.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0816979408264 seconds
cpu usage
0.019842768
max memory
1896448.0
stage attributes
key
value
output-size
2693
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 z:S) (RULES mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue ) Problem 1: Innermost Equivalent Processor: -> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: MEM(x:S,union(y:S,z:S)) -> MEM(x:S,y:S) MEM(x:S,union(y:S,z:S)) -> MEM(x:S,z:S) MEM(x:S,union(y:S,z:S)) -> OR(mem(x:S,y:S),mem(x:S,z:S)) -> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue Problem 1: SCC Processor: -> Pairs: MEM(x:S,union(y:S,z:S)) -> MEM(x:S,y:S) MEM(x:S,union(y:S,z:S)) -> MEM(x:S,z:S) MEM(x:S,union(y:S,z:S)) -> OR(mem(x:S,y:S),mem(x:S,z:S)) -> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MEM(x:S,union(y:S,z:S)) -> MEM(x:S,y:S) MEM(x:S,union(y:S,z:S)) -> MEM(x:S,z:S) ->->-> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue Problem 1: Subterm Processor: -> Pairs: MEM(x:S,union(y:S,z:S)) -> MEM(x:S,y:S) MEM(x:S,union(y:S,z:S)) -> MEM(x:S,z:S) -> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S)) or(ffalse,ffalse) -> ffalse or(ttrue,y:S) -> ttrue or(x:S,ttrue) -> ttrue ->Projection: pi(MEM) = 2 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: mem(x:S,nil) -> ffalse mem(x:S,set(y:S)) -> =(x:S,y:S) mem(x:S,union(y:S,z:S)) -> or(mem(x:S,y:S),mem(x:S,z:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard