details

property	value
status	complete
benchmark	#3.10_rand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n134.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	ttt2-1.19
configuration	ttt2
runtime (wallclock)	299.426 seconds
cpu usage	708.679
user time	701.932
system time	6.74676
max virtual memory	4299768.0
max residence set size	154312.0

stage attributes

key	value
starexec-result	MAYBE

output

708.49/299.41 MAYBE 708.49/299.41 708.49/299.41 Problem: 708.49/299.41 strict: 708.49/299.41 eq(0(),0()) -> true() 708.49/299.41 eq(0(),s(x)) -> false() 708.49/299.41 eq(s(x),0()) -> false() 708.49/299.41 eq(s(x),s(y)) -> eq(x,y) 708.49/299.41 le(0(),y) -> true() 708.49/299.41 le(s(x),0()) -> false() 708.49/299.41 le(s(x),s(y)) -> le(x,y) 708.49/299.41 app(nil(),y) -> y 708.49/299.41 app(add(n,x),y) -> add(n,app(x,y)) 708.49/299.41 min(add(n,nil())) -> n 708.49/299.41 min(add(n,add(m,x))) -> if_min(le(n,m),add(n,add(m,x))) 708.49/299.41 if_min(true(),add(n,add(m,x))) -> min(add(n,x)) 708.49/299.41 if_min(false(),add(n,add(m,x))) -> min(add(m,x)) 708.49/299.41 rm(n,nil()) -> nil() 708.49/299.41 rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 708.49/299.41 if_rm(true(),n,add(m,x)) -> rm(n,x) 708.49/299.41 if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 708.49/299.41 minsort(nil(),nil()) -> nil() 708.49/299.41 minsort(add(n,x),y) -> if_minsort(eq(n,min(add(n,x))),add(n,x),y) 708.49/299.41 if_minsort(true(),add(n,x),y) -> add(n,minsort(app(rm(n,x),y),nil())) 708.49/299.41 if_minsort(false(),add(n,x),y) -> minsort(x,add(n,y)) 708.49/299.41 weak: 708.49/299.41 rand(x) -> x 708.49/299.41 rand(x) -> rand(s(x)) 708.49/299.41 708.49/299.41 Proof: 708.49/299.41 Open 708.49/299.42 EOF popout

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

job log

popout

actions

all output return to TRS_Relative 2019-03-21 03.54