details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.09853696823 seconds
cpu usage	3.11479445
max memory	7.2568832E8

stage attributes

key	value
output-size	5639
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y)) and(true(),true()) -> true() and(x,false()) -> false() and(false(),x) -> false() gr(0(),0()) -> false() 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: cond#(true(),x,y) -> p#(y) cond#(true(),x,y) -> p#(x) cond#(true(),x,y) -> gr#(y,0()) cond#(true(),x,y) -> gr#(x,0()) cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0())) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y)) and(true(),true()) -> true() and(x,false()) -> false() and(false(),x) -> false() gr(0(),0()) -> false() 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: cond#(true(),x,y) -> p#(y) cond#(true(),x,y) -> p#(x) cond#(true(),x,y) -> gr#(y,0()) cond#(true(),x,y) -> gr#(x,0()) cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0())) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y)) and(true(),true()) -> true() and(x,false()) -> false() and(false(),x) -> false() gr(0(),0()) -> false() 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: gr#(s(x),s(y)) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y) cond#(true(),x,y) -> gr#(y,0()) -> gr#(s(x),s(y)) -> gr#(x,y) cond#(true(),x,y) -> gr#(x,0()) -> gr#(s(x),s(y)) -> gr#(x,y) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> and#(gr(x,0()),gr(y,0())) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> gr#(x,0()) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> gr#(y,0()) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> p#(x) cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) -> cond#(true(),x,y) -> p#(y) SCC Processor: #sccs: 2 #rules: 2 #arcs: 9/49 DPs: cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) TRS: cond(true(),x,y) -> cond(and(gr(x,0()),gr(y,0())),p(x),p(y)) and(true(),true()) -> true() and(x,false()) -> false() and(false(),x) -> false() gr(0(),0()) -> false() gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x Usable Rule Processor: DPs: cond#(true(),x,y) -> cond#(and(gr(x,0()),gr(y,0())),p(x),p(y)) TRS: p(0()) -> 0() popout

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

job log

popout

actions

all output return to TRS Standard