details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	0.743690013885 seconds
cpu usage	1.581198727
max memory	1.88710912E8

stage attributes

key	value
output-size	4756
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) if(true(),X,Y) -> X if(false(),X,Y) -> Y Proof: DP Processor: DPs: minus#(s(X),s(Y)) -> minus#(X,Y) geq#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> minus#(X,Y) div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) div#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> if#(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) TRS: minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) if(true(),X,Y) -> X if(false(),X,Y) -> Y TDG Processor: DPs: minus#(s(X),s(Y)) -> minus#(X,Y) geq#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> minus#(X,Y) div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) div#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> if#(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) TRS: minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) if(true(),X,Y) -> X if(false(),X,Y) -> Y graph: div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) -> div#(s(X),s(Y)) -> if#(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) -> div#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) -> div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) -> div#(s(X),s(Y)) -> minus#(X,Y) div#(s(X),s(Y)) -> geq#(X,Y) -> geq#(s(X),s(Y)) -> geq#(X,Y) div#(s(X),s(Y)) -> minus#(X,Y) -> minus#(s(X),s(Y)) -> minus#(X,Y) geq#(s(X),s(Y)) -> geq#(X,Y) -> geq#(s(X),s(Y)) -> geq#(X,Y) minus#(s(X),s(Y)) -> minus#(X,Y) -> minus#(s(X),s(Y)) -> minus#(X,Y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 8/36 DPs: div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) TRS: minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) if(true(),X,Y) -> X if(false(),X,Y) -> Y EDG Processor: DPs: div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) TRS: minus(0(),Y) -> 0() minus(s(X),s(Y)) -> minus(X,Y) geq(X,0()) -> true() geq(0(),s(Y)) -> false() geq(s(X),s(Y)) -> geq(X,Y) div(0(),s(Y)) -> 0() div(s(X),s(Y)) -> if(geq(X,Y),s(div(minus(X,Y),s(Y))),0()) if(true(),X,Y) -> X if(false(),X,Y) -> Y graph: popout

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

job log

popout

actions

all output return to TRS Stand 20472