details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	76.2479510307 seconds
cpu usage	302.349067957
max memory	1.08101632E9

stage attributes

key	value
output-size	10749
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 13775 YES Problem: leq(0(),y) -> true() leq(s(x),0()) -> false() leq(s(x),s(y)) -> leq(x,y) if(true(),x,y) -> x if(false(),x,y) -> y -(x,0()) -> x -(s(x),s(y)) -> -(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) Proof: DP Processor: DPs: leq#(s(x),s(y)) -> leq#(x,y) -#(s(x),s(y)) -> -#(x,y) mod#(s(x),s(y)) -> -#(s(x),s(y)) mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) mod#(s(x),s(y)) -> leq#(y,x) mod#(s(x),s(y)) -> if#(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) TRS: leq(0(),y) -> true() leq(s(x),0()) -> false() leq(s(x),s(y)) -> leq(x,y) if(true(),x,y) -> x if(false(),x,y) -> y -(x,0()) -> x -(s(x),s(y)) -> -(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) TDG Processor: DPs: leq#(s(x),s(y)) -> leq#(x,y) -#(s(x),s(y)) -> -#(x,y) mod#(s(x),s(y)) -> -#(s(x),s(y)) mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) mod#(s(x),s(y)) -> leq#(y,x) mod#(s(x),s(y)) -> if#(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) TRS: leq(0(),y) -> true() leq(s(x),0()) -> false() leq(s(x),s(y)) -> leq(x,y) if(true(),x,y) -> x if(false(),x,y) -> y -(x,0()) -> x -(s(x),s(y)) -> -(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) graph: mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) -> mod#(s(x),s(y)) -> if#(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) -> mod#(s(x),s(y)) -> leq#(y,x) mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) -> mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) -> mod#(s(x),s(y)) -> -#(s(x),s(y)) mod#(s(x),s(y)) -> -#(s(x),s(y)) -> -#(s(x),s(y)) -> -#(x,y) mod#(s(x),s(y)) -> leq#(y,x) -> leq#(s(x),s(y)) -> leq#(x,y) -#(s(x),s(y)) -> -#(x,y) -> -#(s(x),s(y)) -> -#(x,y) leq#(s(x),s(y)) -> leq#(x,y) -> leq#(s(x),s(y)) -> leq#(x,y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 8/36 DPs: mod#(s(x),s(y)) -> mod#(-(s(x),s(y)),s(y)) TRS: leq(0(),y) -> true() leq(s(x),0()) -> false() leq(s(x),s(y)) -> leq(x,y) if(true(),x,y) -> x if(false(),x,y) -> y -(x,0()) -> x -(s(x),s(y)) -> -(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if(leq(y,x),mod(-(s(x),s(y)),s(y)),s(x)) Extended Uncurrying Processor: application symbol: leq symbol table: mod# ==> mod{0,#}/2 mod ==> mod0/2 - ==> -0/2 if ==> if0/3 false ==> false0/0 s ==> s0/1 s1/2 true ==> true0/0 popout

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

job log

popout

actions

all output return to TRS Standard