details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	4.49115395546 seconds
cpu usage	15.781747943
max memory	1.0372096E9

stage attributes

key	value
output-size	87871
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: app'(app'(eq(),0()),0()) -> true() app'(app'(eq(),0()),app'(s(),x)) -> false() app'(app'(eq(),app'(s(),x)),0()) -> false() app'(app'(eq(),app'(s(),x)),app'(s(),y)) -> app'(app'(eq(),x),y) app'(app'(le(),0()),y) -> true() app'(app'(le(),app'(s(),x)),0()) -> false() app'(app'(le(),app'(s(),x)),app'(s(),y)) -> app'(app'(le(),x),y) app'(app'(app(),nil()),y) -> y app'(app'(app(),app'(app'(add(),n),x)),y) -> app'(app'(add(),n),app'(app'(app(),x),y)) app'(min(),app'(app'(add(),n),nil())) -> n app'(min(),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(app'(if_min(),app'(app'(le(),n),m)),app'(app'(add(),n),app'(app'(add(),m),x))) app'(app'(if_min(),true()),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(min(),app'(app'(add(),n),x)) app'(app'(if_min(),false()),app'(app'(add(),n),app'(app'(add(),m),x))) -> app'(min(),app'(app'(add(),m),x)) app'(app'(rm(),n),nil()) -> nil() app'(app'(rm(),n),app'(app'(add(),m),x)) -> app'(app'(app'(if_rm(),app'(app'(eq(),n),m)),n),app'(app'(add(),m),x)) app'(app'(app'(if_rm(),true()),n),app'(app'(add(),m),x)) -> app'(app'(rm(),n),x) app'(app'(app'(if_rm(),false()),n),app'(app'(add(),m),x)) -> app'(app'(add(),m),app'(app'(rm(),n),x)) app'(app'(minsort(),nil()),nil()) -> nil() app'(app'(minsort(),app'(app'(add(),n),x)),y) -> app'(app'(app'(if_minsort(),app'(app'(eq(),n),app'(min(),app'(app'(add(),n),x)))), app'(app'(add(),n),x)),y) app'(app'(app'(if_minsort(),true()),app'(app'(add(),n),x)),y) -> app'(app'(add(),n),app'(app'(minsort(),app'(app'(app(),app'(app'(rm(),n),x)),y)),nil())) app'(app'(app'(if_minsort(),false()),app'(app'(add(),n),x)),y) -> app'(app'(minsort(),x),app'(app'(add(),n),y)) app'(app'(map(),f),nil()) -> nil() app'(app'(map(),f),app'(app'(add(),x),xs)) -> app'(app'(add(),app'(f,x)),app'(app'(map(),f),xs)) app'(app'(filter(),f),nil()) -> nil() app'(app'(filter(),f),app'(app'(add(),x),xs)) -> app'(app'(app'(app'(filter2(),app'(f,x)),f),x),xs) app'(app'(app'(app'(filter2(),true()),f),x),xs) -> app'(app'(add(),x),app'(app'(filter(),f),xs)) app'(app'(app'(app'(filter2(),false()),f),x),xs) -> app'(app'(filter(),f),xs) Proof: Extended Uncurrying Processor: application symbol: app' symbol table: filter2 ==> filter20/0 filter21/1 filter22/2 filter23/3 filter24/4 filter ==> filter0/0 filter1/1 filter2/2 map ==> map0/0 map1/1 map2/2 if_minsort ==> if_minsort0/0 if_minsort1/1 if_minsort2/2 if_minsort3/3 minsort ==> minsort0/0 minsort1/1 minsort2/2 if_rm ==> if_rm0/0 if_rm1/1 if_rm2/2 if_rm3/3 rm ==> rm0/0 rm1/1 rm2/2 if_min ==> if_min0/0 if_min1/1 if_min2/2 min ==> min0/0 min1/1 add ==> add0/0 add1/1 add2/2 nil ==> nil0/0 app ==> app0/0 app1/1 app2/2 le ==> le0/0 le1/1 le2/2 false ==> false0/0 s ==> s0/0 s1/1 true ==> true0/0 0 ==> 00/0 eq ==> eq0/0 eq1/1 eq2/2 uncurry-rules: app'(eq1(x6),x7) -> eq2(x6,x7) app'(eq0(),x6) -> eq1(x6) app'(s0(),x11) -> s1(x11) app'(le1(x14),x15) -> le2(x14,x15) app'(le0(),x14) -> le1(x14) app'(app1(x17),x18) -> app2(x17,x18) app'(app0(),x17) -> app1(x17) app'(add1(x21),x22) -> add2(x21,x22) app'(add0(),x21) -> add1(x21) app'(min0(),x24) -> min1(x24) app'(if_min1(x26),x27) -> if_min2(x26,x27) app'(if_min0(),x26) -> if_min1(x26) app'(rm1(x29),x30) -> rm2(x29,x30) app'(rm0(),x29) -> rm1(x29) app'(if_rm2(x32,x33),x34) -> if_rm3(x32,x33,x34) app'(if_rm1(x32),x33) -> if_rm2(x32,x33) app'(if_rm0(),x32) -> if_rm1(x32) app'(minsort1(x36),x37) -> minsort2(x36,x37) app'(minsort0(),x36) -> minsort1(x36) app'(if_minsort2(x39,x40),x41) -> if_minsort3(x39,x40,x41) app'(if_minsort1(x39),x40) -> if_minsort2(x39,x40) app'(if_minsort0(),x39) -> if_minsort1(x39) app'(map1(x43),x44) -> map2(x43,x44) app'(map0(),x43) -> map1(x43) app'(filter1(x46),x47) -> filter2(x46,x47) app'(filter0(),x46) -> filter1(x46) app'(filter23(x49,x50,x51),x52) -> filter24(x49,x50,x51,x52) app'(filter22(x49,x50),x51) -> filter23(x49,x50,x51) app'(filter21(x49),x50) -> filter22(x49,x50) popout

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

job log

popout

actions

all output return to TRS Stand 20472