TRS Condi 20667 pair #381733188

details

property	value
status	complete
benchmark	406.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n094.star.cs.uiowa.edu
space	COPS

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0166749954224 seconds
cpu usage	0.013365806
max memory	1384448.0

stage attributes

key	value
output-size	1828
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)
(RULES
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:
 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:
 F(x,y) -> G(x) | c(g(x)) -> c(a)
 F(x,y) -> H(x) | c(h(x)) -> c(a)
-> QPairs:
 Empty
-> Rules:
 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:
 F(x,y) -> G(x) | c(g(x)) -> c(a)
 F(x,y) -> H(x) | c(h(x)) -> c(a)
-> Rules:
 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 problem is decomposed in 2 subproblems.

Problem 1.1: 

SCC Processor:
-> Pairs:
 F(x,y) -> G(x) | c(g(x)) -> c(a)
 F(x,y) -> H(x) | c(h(x)) -> c(a)
-> QPairs:
 Empty
-> Rules:
 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:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

SCC Processor:
-> Pairs:
 F(x,y) -> G(x)
 F(x,y) -> H(x)
-> QPairs:
 F(x,y) -> G(x) | c(g(x)) -> c(a)
 F(x,y) -> H(x) | c(h(x)) -> c(a)
-> Rules:
 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:
 There is no strongly connected component

The problem is finite.

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Condi 20667