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	n072.star.cs.uiowa.edu
space	TCT_12

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0232908725739 seconds
cpu usage	0.020637622
max memory	2351104.0

stage attributes

key	value
output-size	14245
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR assign clause cnf e l ls t x xs y ys) (RULES choice(cons(x,xs)) -> choice(xs) choice(cons(x,xs)) -> x eq(0(x),1(y)) -> false eq(1(x),0(y)) -> false eq(1(x),1(y)) -> eq(x,y) eq(O(x),0(y)) -> eq(x,y) eq(nil,nil) -> true guess(cons(clause,cnf)) -> cons(choice(clause),guess(cnf)) guess(nil) -> nil if(false,t,e) -> e if(true,t,e) -> t member(x,cons(y,ys)) -> if(eq(x,y),true,member(x,ys)) member(x,nil) -> false negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) sat(cnf) -> satck(cnf,guess(cnf)) satck(cnf,assign) -> if(verify(assign),assign,unsat) verify(cons(l,ls)) -> if(member(negate(l),ls),false,verify(ls)) verify(nil) -> true ) Problem 1: Dependency Pairs Processor: -> Pairs: CHOICE(cons(x,xs)) -> CHOICE(xs) EQ(1(x),1(y)) -> EQ(x,y) EQ(O(x),0(y)) -> EQ(x,y) GUESS(cons(clause,cnf)) -> CHOICE(clause) GUESS(cons(clause,cnf)) -> GUESS(cnf) MEMBER(x,cons(y,ys)) -> EQ(x,y) MEMBER(x,cons(y,ys)) -> IF(eq(x,y),true,member(x,ys)) MEMBER(x,cons(y,ys)) -> MEMBER(x,ys) SAT(cnf) -> GUESS(cnf) SAT(cnf) -> SATCK(cnf,guess(cnf)) SATCK(cnf,assign) -> IF(verify(assign),assign,unsat) SATCK(cnf,assign) -> VERIFY(assign) VERIFY(cons(l,ls)) -> IF(member(negate(l),ls),false,verify(ls)) VERIFY(cons(l,ls)) -> MEMBER(negate(l),ls) VERIFY(cons(l,ls)) -> NEGATE(l) VERIFY(cons(l,ls)) -> VERIFY(ls) -> Rules: choice(cons(x,xs)) -> choice(xs) choice(cons(x,xs)) -> x eq(0(x),1(y)) -> false eq(1(x),0(y)) -> false eq(1(x),1(y)) -> eq(x,y) eq(O(x),0(y)) -> eq(x,y) eq(nil,nil) -> true guess(cons(clause,cnf)) -> cons(choice(clause),guess(cnf)) guess(nil) -> nil if(false,t,e) -> e if(true,t,e) -> t member(x,cons(y,ys)) -> if(eq(x,y),true,member(x,ys)) member(x,nil) -> false negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) sat(cnf) -> satck(cnf,guess(cnf)) satck(cnf,assign) -> if(verify(assign),assign,unsat) verify(cons(l,ls)) -> if(member(negate(l),ls),false,verify(ls)) verify(nil) -> true Problem 1: SCC Processor: -> Pairs: CHOICE(cons(x,xs)) -> CHOICE(xs) EQ(1(x),1(y)) -> EQ(x,y) EQ(O(x),0(y)) -> EQ(x,y) GUESS(cons(clause,cnf)) -> CHOICE(clause) GUESS(cons(clause,cnf)) -> GUESS(cnf) MEMBER(x,cons(y,ys)) -> EQ(x,y) MEMBER(x,cons(y,ys)) -> IF(eq(x,y),true,member(x,ys)) MEMBER(x,cons(y,ys)) -> MEMBER(x,ys) SAT(cnf) -> GUESS(cnf) SAT(cnf) -> SATCK(cnf,guess(cnf)) SATCK(cnf,assign) -> IF(verify(assign),assign,unsat) SATCK(cnf,assign) -> VERIFY(assign) VERIFY(cons(l,ls)) -> IF(member(negate(l),ls),false,verify(ls)) VERIFY(cons(l,ls)) -> MEMBER(negate(l),ls) VERIFY(cons(l,ls)) -> NEGATE(l) VERIFY(cons(l,ls)) -> VERIFY(ls) -> Rules: choice(cons(x,xs)) -> choice(xs) choice(cons(x,xs)) -> x eq(0(x),1(y)) -> false eq(1(x),0(y)) -> false eq(1(x),1(y)) -> eq(x,y) popout

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

job log

popout

actions

all output return to TRS Stand 20472