details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	8.30424499512 seconds
cpu usage	5.282181759
max memory	1.2816384E8

stage attributes

key	value
output-size	8966
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 rest x y z1 z2) (RULES cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) ) Problem 1: Valid CTRS Processor: -> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: CONS(x,cons(y,rest)) -> CONS(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) CONS(x,cons(y,rest)) -> CONS(z2,rest) | orient(x,y) -> pair(z1,z2) -> QPairs: Empty -> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) Conditional Termination Problem 2: -> Pairs: CONS(x,cons(y,rest)) -> ORIENT(x,y) ORIENT(s(x),s(y)) -> ORIENT(x,y) -> QPairs: CONS(x,cons(y,rest)) -> CONS(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) CONS(x,cons(y,rest)) -> CONS(z2,rest) | orient(x,y) -> pair(z1,z2) -> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: CONS(x,cons(y,rest)) -> CONS(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) CONS(x,cons(y,rest)) -> CONS(z2,rest) | orient(x,y) -> pair(z1,z2) -> QPairs: Empty -> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: CONS(x,cons(y,rest)) -> CONS(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) CONS(x,cons(y,rest)) -> CONS(z2,rest) | orient(x,y) -> pair(z1,z2) ->->-> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) Problem 1.1: Reduction Triple Processor: -> Pairs: CONS(x,cons(y,rest)) -> CONS(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) CONS(x,cons(y,rest)) -> CONS(z2,rest) | orient(x,y) -> pair(z1,z2) -> QPairs: Empty -> Rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) orient(s(x),s(y)) -> pair(s(z1),s(z2)) | orient(x,y) -> pair(z1,z2) -> Usable rules: cons(x,cons(x,rest)) -> cons(x,rest) cons(x,cons(y,rest)) -> cons(z1,cons(z2,rest)) | orient(x,y) -> pair(z1,z2) orient(s(x),0) -> pair(0,s(x)) popout

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

job log

popout

actions

all output return to TRS Condi 20667