details

property	value
status	complete
benchmark	#4.30b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n005.star.cs.uiowa.edu
space	Strategy_removed_AG01

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	76.5091459751 seconds
cpu usage	304.259971401
max memory	1.109315584E9

stage attributes

key	value
output-size	13701
starexec-result	"MAYBE"

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- failure 'Failure("No result of SMT solver - maybe due to some flag of the solver? or the solver was not found in PATH?")' in subprocess 13649 YES Problem: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),x,y) -> mod(minus(x,y),y) if_mod(false(),s(x),s(y)) -> s(x) Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),x,y) -> minus#(x,y) if_mod#(true(),x,y) -> mod#(minus(x,y),y) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),x,y) -> mod(minus(x,y),y) if_mod(false(),s(x),s(y)) -> s(x) TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),x,y) -> minus#(x,y) if_mod#(true(),x,y) -> mod#(minus(x,y),y) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),x,y) -> mod(minus(x,y),y) if_mod(false(),s(x),s(y)) -> s(x) graph: if_mod#(true(),x,y) -> mod#(minus(x,y),y) -> mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),x,y) -> mod#(minus(x,y),y) -> mod#(s(x),s(y)) -> le#(y,x) if_mod#(true(),x,y) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),x,y) -> mod#(minus(x,y),y) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),x,y) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) -> le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) SCC Processor: #sccs: 3 #rules: 4 #arcs: 8/36 DPs: if_mod#(true(),x,y) -> mod#(minus(x,y),y) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),x,y) -> mod(minus(x,y),y) if_mod(false(),s(x),s(y)) -> s(x) Extended Uncurrying Processor: application symbol: le symbol table: if_mod# ==> if_mod{0,#}/3 mod# ==> mod{0,#}/2 if_mod ==> if_mod0/3 mod ==> mod0/2 minus ==> minus0/2 popout

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

job log

popout

actions

all output return to TRS Standard