details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.20909786224 seconds
cpu usage	7.453717199
max memory	6.08268288E8

stage attributes

key	value
output-size	15226
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: minus(x,0()) -> x minus(0(),y) -> 0() minus(s(x),s(y)) -> minus(p(s(x)),p(s(y))) minus(x,plus(y,z)) -> minus(minus(x,y),z) p(s(s(x))) -> s(p(s(x))) p(0()) -> s(s(0())) div(s(x),s(y)) -> s(div(minus(x,y),s(y))) div(plus(x,y),z) -> plus(div(x,z),div(y,z)) plus(0(),y) -> y plus(s(x),y) -> s(plus(y,minus(s(x),s(0())))) Proof: DP Processor: DPs: minus#(s(x),s(y)) -> p#(s(y)) minus#(s(x),s(y)) -> p#(s(x)) minus#(s(x),s(y)) -> minus#(p(s(x)),p(s(y))) minus#(x,plus(y,z)) -> minus#(x,y) minus#(x,plus(y,z)) -> minus#(minus(x,y),z) p#(s(s(x))) -> p#(s(x)) div#(s(x),s(y)) -> minus#(x,y) div#(s(x),s(y)) -> div#(minus(x,y),s(y)) div#(plus(x,y),z) -> div#(y,z) div#(plus(x,y),z) -> div#(x,z) div#(plus(x,y),z) -> plus#(div(x,z),div(y,z)) plus#(s(x),y) -> minus#(s(x),s(0())) plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) TRS: minus(x,0()) -> x minus(0(),y) -> 0() minus(s(x),s(y)) -> minus(p(s(x)),p(s(y))) minus(x,plus(y,z)) -> minus(minus(x,y),z) p(s(s(x))) -> s(p(s(x))) p(0()) -> s(s(0())) div(s(x),s(y)) -> s(div(minus(x,y),s(y))) div(plus(x,y),z) -> plus(div(x,z),div(y,z)) plus(0(),y) -> y plus(s(x),y) -> s(plus(y,minus(s(x),s(0())))) TDG Processor: DPs: minus#(s(x),s(y)) -> p#(s(y)) minus#(s(x),s(y)) -> p#(s(x)) minus#(s(x),s(y)) -> minus#(p(s(x)),p(s(y))) minus#(x,plus(y,z)) -> minus#(x,y) minus#(x,plus(y,z)) -> minus#(minus(x,y),z) p#(s(s(x))) -> p#(s(x)) div#(s(x),s(y)) -> minus#(x,y) div#(s(x),s(y)) -> div#(minus(x,y),s(y)) div#(plus(x,y),z) -> div#(y,z) div#(plus(x,y),z) -> div#(x,z) div#(plus(x,y),z) -> plus#(div(x,z),div(y,z)) plus#(s(x),y) -> minus#(s(x),s(0())) plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) TRS: minus(x,0()) -> x minus(0(),y) -> 0() minus(s(x),s(y)) -> minus(p(s(x)),p(s(y))) minus(x,plus(y,z)) -> minus(minus(x,y),z) p(s(s(x))) -> s(p(s(x))) p(0()) -> s(s(0())) div(s(x),s(y)) -> s(div(minus(x,y),s(y))) div(plus(x,y),z) -> plus(div(x,z),div(y,z)) plus(0(),y) -> y plus(s(x),y) -> s(plus(y,minus(s(x),s(0())))) graph: plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) -> plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) -> plus#(s(x),y) -> minus#(s(x),s(0())) plus#(s(x),y) -> minus#(s(x),s(0())) -> minus#(x,plus(y,z)) -> minus#(minus(x,y),z) plus#(s(x),y) -> minus#(s(x),s(0())) -> minus#(x,plus(y,z)) -> minus#(x,y) plus#(s(x),y) -> minus#(s(x),s(0())) -> minus#(s(x),s(y)) -> minus#(p(s(x)),p(s(y))) plus#(s(x),y) -> minus#(s(x),s(0())) -> minus#(s(x),s(y)) -> p#(s(x)) plus#(s(x),y) -> minus#(s(x),s(0())) -> minus#(s(x),s(y)) -> p#(s(y)) div#(plus(x,y),z) -> plus#(div(x,z),div(y,z)) -> plus#(s(x),y) -> plus#(y,minus(s(x),s(0()))) div#(plus(x,y),z) -> plus#(div(x,z),div(y,z)) -> plus#(s(x),y) -> minus#(s(x),s(0())) div#(plus(x,y),z) -> div#(y,z) -> div#(plus(x,y),z) -> plus#(div(x,z),div(y,z)) div#(plus(x,y),z) -> div#(y,z) -> div#(plus(x,y),z) -> div#(x,z) div#(plus(x,y),z) -> div#(y,z) -> div#(plus(x,y),z) -> div#(y,z) div#(plus(x,y),z) -> div#(y,z) -> div#(s(x),s(y)) -> div#(minus(x,y),s(y)) div#(plus(x,y),z) -> div#(y,z) -> div#(s(x),s(y)) -> minus#(x,y) div#(plus(x,y),z) -> div#(x,z) -> popout

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

job log

popout

actions

all output return to TRS Standard