SRS Standard pair #516973548

details

property	value
status	complete
benchmark	size-12-alpha-3-num-551.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n082.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.267513990402 seconds
cpu usage	0.194287761
max memory	4030464.0

stage attributes

key	value
output-size	3341
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 x1:S)
(RULES
a(b(x1:S)) -> x1:S
a(c(x1:S)) -> b(c(c(a(x1:S))))
b(c(x1:S)) -> a(b(x1:S))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(c(x1:S)) -> A(x1:S)
 A(c(x1:S)) -> B(c(c(a(x1:S))))
 B(c(x1:S)) -> A(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))

Problem 1: 

SCC Processor:
-> Pairs:
 A(c(x1:S)) -> A(x1:S)
 A(c(x1:S)) -> B(c(c(a(x1:S))))
 B(c(x1:S)) -> A(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A(c(x1:S)) -> A(x1:S)
 A(c(x1:S)) -> B(c(c(a(x1:S))))
 B(c(x1:S)) -> A(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
->->-> Rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 A(c(x1:S)) -> A(x1:S)
 A(c(x1:S)) -> B(c(c(a(x1:S))))
 B(c(x1:S)) -> A(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))
-> Usable rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X) = 2.X + 1/2
[b](X) = 1/2.X + 1/2
[c](X) = 2.X + 2
[A](X) = 2.X + 1
[B](X) = 1/2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 A(c(x1:S)) -> B(c(c(a(x1:S))))
 B(c(x1:S)) -> A(b(x1:S))
 B(c(x1:S)) -> B(x1:S)
-> Rules:
 a(b(x1:S)) -> x1:S
 a(c(x1:S)) -> b(c(c(a(x1:S))))
 b(c(x1:S)) -> a(b(x1:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:

popout

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

job log

popout

actions all output return to SRS Standard