Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711110
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
n014.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0167200565338 seconds
cpu usage
0.014434124
max memory
1630208.0
stage attributes
key
value
output-size
2314
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 x y z) (RULES mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true ) Problem 1: Innermost Equivalent Processor: -> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true -> 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,union(y,z)) -> MEM(x,y) MEM(x,union(y,z)) -> MEM(x,z) MEM(x,union(y,z)) -> OR(mem(x,y),mem(x,z)) -> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true Problem 1: SCC Processor: -> Pairs: MEM(x,union(y,z)) -> MEM(x,y) MEM(x,union(y,z)) -> MEM(x,z) MEM(x,union(y,z)) -> OR(mem(x,y),mem(x,z)) -> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MEM(x,union(y,z)) -> MEM(x,y) MEM(x,union(y,z)) -> MEM(x,z) ->->-> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true Problem 1: Subterm Processor: -> Pairs: MEM(x,union(y,z)) -> MEM(x,y) MEM(x,union(y,z)) -> MEM(x,z) -> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z)) or(false,false) -> false or(true,y) -> true or(x,true) -> true ->Projection: pi(MEM) = 2 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: mem(x,nil) -> false mem(x,set(y)) -> =(x,y) mem(x,union(y,z)) -> or(mem(x,y),mem(x,z))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472