details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0266561 seconds
cpu usage	0.027221
user time	0.01454
system time	0.012681
max virtual memory	113188.0
max residence set size	8156.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S assign:S clause:S cnf:S e:S l:S ls:S t:S x:S xs:S y:S ys:S) (RULES choice(cons(x:S,xs:S)) -> choice(xs:S) choice(cons(x:S,xs:S)) -> x:S eq(0(x:S),1(y:S)) -> ffalse eq(1(x:S),0(y:S)) -> ffalse eq(1(x:S),1(y:S)) -> eq(x:S,y:S) eq(O(x:S),0(y:S)) -> eq(x:S,y:S) eq(nil,nil) -> ttrue guess(cons(clause:S,cnf:S)) -> cons(choice(clause:S),guess(cnf:S)) guess(nil) -> nil if(ffalse,t:S,e:S) -> e:S if(ttrue,t:S,e:S) -> t:S member(x:S,cons(y:S,ys:S)) -> if(eq(x:S,y:S),ttrue,member(x:S,ys:S)) member(x:S,nil) -> ffalse negate(0(x:S)) -> 1(x:S) negate(1(x:S)) -> 0(x:S) sat(cnf:S) -> satck(cnf:S,guess(cnf:S)) satck(cnf:S,assign:S) -> if(verify(assign:S),assign:S,unsat) verify(cons(l:S,ls:S)) -> if(member(negate(l:S),ls:S),ffalse,verify(ls:S)) verify(nil) -> ttrue ) Problem 1: Dependency Pairs Processor: -> Pairs: CHOICE(cons(x:S,xs:S)) -> CHOICE(xs:S) EQ(1(x:S),1(y:S)) -> EQ(x:S,y:S) EQ(O(x:S),0(y:S)) -> EQ(x:S,y:S) GUESS(cons(clause:S,cnf:S)) -> CHOICE(clause:S) GUESS(cons(clause:S,cnf:S)) -> GUESS(cnf:S) MEMBER(x:S,cons(y:S,ys:S)) -> EQ(x:S,y:S) MEMBER(x:S,cons(y:S,ys:S)) -> IF(eq(x:S,y:S),ttrue,member(x:S,ys:S)) MEMBER(x:S,cons(y:S,ys:S)) -> MEMBER(x:S,ys:S) SAT(cnf:S) -> GUESS(cnf:S) SAT(cnf:S) -> SATCK(cnf:S,guess(cnf:S)) SATCK(cnf:S,assign:S) -> IF(verify(assign:S),assign:S,unsat) SATCK(cnf:S,assign:S) -> VERIFY(assign:S) VERIFY(cons(l:S,ls:S)) -> IF(member(negate(l:S),ls:S),ffalse,verify(ls:S)) VERIFY(cons(l:S,ls:S)) -> MEMBER(negate(l:S),ls:S) VERIFY(cons(l:S,ls:S)) -> NEGATE(l:S) VERIFY(cons(l:S,ls:S)) -> VERIFY(ls:S) -> Rules: choice(cons(x:S,xs:S)) -> choice(xs:S) choice(cons(x:S,xs:S)) -> x:S eq(0(x:S),1(y:S)) -> ffalse eq(1(x:S),0(y:S)) -> ffalse eq(1(x:S),1(y:S)) -> eq(x:S,y:S) eq(O(x:S),0(y:S)) -> eq(x:S,y:S) eq(nil,nil) -> ttrue guess(cons(clause:S,cnf:S)) -> cons(choice(clause:S),guess(cnf:S)) guess(nil) -> nil if(ffalse,t:S,e:S) -> e:S if(ttrue,t:S,e:S) -> t:S member(x:S,cons(y:S,ys:S)) -> if(eq(x:S,y:S),ttrue,member(x:S,ys:S)) member(x:S,nil) -> ffalse negate(0(x:S)) -> 1(x:S) negate(1(x:S)) -> 0(x:S) sat(cnf:S) -> satck(cnf:S,guess(cnf:S)) satck(cnf:S,assign:S) -> if(verify(assign:S),assign:S,unsat) verify(cons(l:S,ls:S)) -> if(member(negate(l:S),ls:S),ffalse,verify(ls:S)) verify(nil) -> ttrue Problem 1: SCC Processor: -> Pairs: CHOICE(cons(x:S,xs:S)) -> CHOICE(xs:S) EQ(1(x:S),1(y:S)) -> EQ(x:S,y:S) EQ(O(x:S),0(y:S)) -> EQ(x:S,y:S) GUESS(cons(clause:S,cnf:S)) -> CHOICE(clause:S) GUESS(cons(clause:S,cnf:S)) -> GUESS(cnf:S) MEMBER(x:S,cons(y:S,ys:S)) -> EQ(x:S,y:S) MEMBER(x:S,cons(y:S,ys:S)) -> IF(eq(x:S,y:S),ttrue,member(x:S,ys:S)) MEMBER(x:S,cons(y:S,ys:S)) -> MEMBER(x:S,ys:S) SAT(cnf:S) -> GUESS(cnf:S) SAT(cnf:S) -> SATCK(cnf:S,guess(cnf:S)) SATCK(cnf:S,assign:S) -> IF(verify(assign:S),assign:S,unsat) SATCK(cnf:S,assign:S) -> VERIFY(assign:S) VERIFY(cons(l:S,ls:S)) -> IF(member(negate(l:S),ls:S),ffalse,verify(ls:S)) VERIFY(cons(l:S,ls:S)) -> MEMBER(negate(l:S),ls:S) VERIFY(cons(l:S,ls:S)) -> NEGATE(l:S) VERIFY(cons(l:S,ls:S)) -> VERIFY(ls:S) -> Rules: choice(cons(x:S,xs:S)) -> choice(xs:S) choice(cons(x:S,xs:S)) -> x:S eq(0(x:S),1(y:S)) -> ffalse eq(1(x:S),0(y:S)) -> ffalse eq(1(x:S),1(y:S)) -> eq(x:S,y:S) eq(O(x:S),0(y:S)) -> eq(x:S,y:S) eq(nil,nil) -> ttrue guess(cons(clause:S,cnf:S)) -> cons(choice(clause:S),guess(cnf:S)) guess(nil) -> nil if(ffalse,t:S,e:S) -> e:S if(ttrue,t:S,e:S) -> t:S popout

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

job log

popout

actions

all output return to TRS Standard