details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	1.56389713287 seconds
cpu usage	4.841378408
max memory	4.70372352E8

stage attributes

key	value
output-size	8217
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: cond1(true(),x,y) -> cond2(gr(y,0()),x,y) cond2(true(),x,y) -> cond2(gr(y,0()),x,p(y)) cond2(false(),x,y) -> cond1(gr(x,0()),p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x Proof: DP Processor: DPs: cond1#(true(),x,y) -> gr#(y,0()) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) cond2#(true(),x,y) -> p#(y) cond2#(true(),x,y) -> gr#(y,0()) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) cond2#(false(),x,y) -> p#(x) cond2#(false(),x,y) -> gr#(x,0()) cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond1(true(),x,y) -> cond2(gr(y,0()),x,y) cond2(true(),x,y) -> cond2(gr(y,0()),x,p(y)) cond2(false(),x,y) -> cond1(gr(x,0()),p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x TDG Processor: DPs: cond1#(true(),x,y) -> gr#(y,0()) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) cond2#(true(),x,y) -> p#(y) cond2#(true(),x,y) -> gr#(y,0()) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) cond2#(false(),x,y) -> p#(x) cond2#(false(),x,y) -> gr#(x,0()) cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond1(true(),x,y) -> cond2(gr(y,0()),x,y) cond2(true(),x,y) -> cond2(gr(y,0()),x,p(y)) cond2(false(),x,y) -> cond1(gr(x,0()),p(x),y) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x graph: cond2#(false(),x,y) -> gr#(x,0()) -> gr#(s(x),s(y)) -> gr#(x,y) cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) -> cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) -> cond1#(true(),x,y) -> gr#(y,0()) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(false(),x,y) -> gr#(x,0()) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(false(),x,y) -> p#(x) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(true(),x,y) -> gr#(y,0()) cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) -> cond2#(true(),x,y) -> p#(y) cond2#(true(),x,y) -> gr#(y,0()) -> gr#(s(x),s(y)) -> gr#(x,y) gr#(s(x),s(y)) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(false(),x,y) -> gr#(x,0()) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(false(),x,y) -> p#(x) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(true(),x,y) -> cond2#(gr(y,0()),x,p(y)) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(true(),x,y) -> gr#(y,0()) cond1#(true(),x,y) -> cond2#(gr(y,0()),x,y) -> cond2#(true(),x,y) -> p#(y) cond1#(true(),x,y) -> gr#(y,0()) -> gr#(s(x),s(y)) -> gr#(x,y) SCC Processor: #sccs: 2 #rules: 4 #arcs: 18/81 DPs: cond2#(false(),x,y) -> cond1#(gr(x,0()),p(x),y) popout

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

job log

popout

actions

all output return to TRS Stand 20472