Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Condi 20667 pair #381733100
details
property
value
status
complete
benchmark
407.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
COPS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.152599811554 seconds
cpu usage
0.083013002
max memory
4296704.0
stage attributes
key
value
output-size
1810
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR x y) (RULES b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x ) Problem 1: Valid CTRS Processor: -> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: B -> B F(x,y) -> G(x) | c(g(x)) -> c(a) F(x,y) -> H(x) | c(h(x)) -> c(a) -> QPairs: Empty -> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x Conditional Termination Problem 2: -> Pairs: F(x,y) -> G(x) F(x,y) -> H(x) -> QPairs: B -> B F(x,y) -> G(x) | c(g(x)) -> c(a) F(x,y) -> H(x) | c(h(x)) -> c(a) -> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x Problem 1: SCC Processor: -> Pairs: B -> B F(x,y) -> G(x) | c(g(x)) -> c(a) F(x,y) -> H(x) | c(h(x)) -> c(a) -> QPairs: Empty -> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B -> B ->->-> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x h(s(x)) -> x Problem 1: Infinite Processor: -> Pairs: B -> B -> QPairs: Empty -> Rules: b -> b f(x,y) -> g(x) | c(g(x)) -> c(a) f(x,y) -> h(x) | c(h(x)) -> c(a) g(s(x)) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Condi 20667