details

property	value
status	complete
benchmark	ack_prolog.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	CiME_04

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.558396816254 seconds
cpu usage	0.842895374
max memory	1.78069504E8

stage attributes

key	value
output-size	4591
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) Proof: DP Processor: DPs: ack_in#(s(m),0()) -> ack_in#(m,s(0())) ack_in#(s(m),0()) -> u11#(ack_in(m,s(0()))) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) u21#(ack_out(n),m) -> ack_in#(m,n) u21#(ack_out(n),m) -> u22#(ack_in(m,n)) TRS: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) TDG Processor: DPs: ack_in#(s(m),0()) -> ack_in#(m,s(0())) ack_in#(s(m),0()) -> u11#(ack_in(m,s(0()))) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) u21#(ack_out(n),m) -> ack_in#(m,n) u21#(ack_out(n),m) -> u22#(ack_in(m,n)) TRS: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) graph: u21#(ack_out(n),m) -> ack_in#(m,n) -> ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) u21#(ack_out(n),m) -> ack_in#(m,n) -> ack_in#(s(m),s(n)) -> ack_in#(s(m),n) u21#(ack_out(n),m) -> ack_in#(m,n) -> ack_in#(s(m),0()) -> u11#(ack_in(m,s(0()))) u21#(ack_out(n),m) -> ack_in#(m,n) -> ack_in#(s(m),0()) -> ack_in#(m,s(0())) ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) -> u21#(ack_out(n),m) -> u22#(ack_in(m,n)) ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) -> u21#(ack_out(n),m) -> ack_in#(m,n) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) -> ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) -> ack_in#(s(m),s(n)) -> ack_in#(s(m),n) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) -> ack_in#(s(m),0()) -> u11#(ack_in(m,s(0()))) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) -> ack_in#(s(m),0()) -> ack_in#(m,s(0())) ack_in#(s(m),0()) -> ack_in#(m,s(0())) -> ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) ack_in#(s(m),0()) -> ack_in#(m,s(0())) -> ack_in#(s(m),s(n)) -> ack_in#(s(m),n) ack_in#(s(m),0()) -> ack_in#(m,s(0())) -> ack_in#(s(m),0()) -> u11#(ack_in(m,s(0()))) ack_in#(s(m),0()) -> ack_in#(m,s(0())) -> ack_in#(s(m),0()) -> ack_in#(m,s(0())) SCC Processor: #sccs: 1 #rules: 4 #arcs: 14/36 DPs: u21#(ack_out(n),m) -> ack_in#(m,n) ack_in#(s(m),0()) -> ack_in#(m,s(0())) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) ack_in#(s(m),s(n)) -> u21#(ack_in(s(m),n),m) TRS: ack_in(0(),n) -> ack_out(s(n)) ack_in(s(m),0()) -> u11(ack_in(m,s(0()))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m),s(n)) -> u21(ack_in(s(m),n),m) u21(ack_out(n),m) -> u22(ack_in(m,n)) u22(ack_out(n)) -> ack_out(n) Subterm Criterion Processor: simple projection: pi(ack_in#) = 0 pi(u21#) = 1 problem: DPs: u21#(ack_out(n),m) -> ack_in#(m,n) ack_in#(s(m),s(n)) -> ack_in#(s(m),n) TRS: popout

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

job log

popout

actions

all output return to TRS Standard