Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710393
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
n088.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.742717027664 seconds
cpu usage
1.503212216
max memory
2.43695616E8
stage attributes
key
value
output-size
14419
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: if(true(),t,e) -> t if(false(),t,e) -> e member(x,nil()) -> false() member(x,cons(y,ys)) -> if(eq(x,y),true(),member(x,ys)) eq(nil(),nil()) -> true() eq(O(x),0(y)) -> eq(x,y) eq(0(x),1(y)) -> false() eq(1(x),0(y)) -> false() eq(1(x),1(y)) -> eq(x,y) negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) choice(cons(x,xs)) -> x choice(cons(x,xs)) -> choice(xs) guess(nil()) -> nil() guess(cons(clause,cnf)) -> cons(choice(clause),guess(cnf)) verify(nil()) -> true() verify(cons(l,ls)) -> if(member(negate(l),ls),false(),verify(ls)) sat(cnf) -> satck(cnf,guess(cnf)) satck(cnf,assign) -> if(verify(assign),assign,unsat()) Proof: DP Processor: DPs: member#(x,cons(y,ys)) -> member#(x,ys) member#(x,cons(y,ys)) -> eq#(x,y) member#(x,cons(y,ys)) -> if#(eq(x,y),true(),member(x,ys)) eq#(O(x),0(y)) -> eq#(x,y) eq#(1(x),1(y)) -> eq#(x,y) choice#(cons(x,xs)) -> choice#(xs) guess#(cons(clause,cnf)) -> guess#(cnf) guess#(cons(clause,cnf)) -> choice#(clause) verify#(cons(l,ls)) -> verify#(ls) verify#(cons(l,ls)) -> negate#(l) verify#(cons(l,ls)) -> member#(negate(l),ls) verify#(cons(l,ls)) -> if#(member(negate(l),ls),false(),verify(ls)) sat#(cnf) -> guess#(cnf) sat#(cnf) -> satck#(cnf,guess(cnf)) satck#(cnf,assign) -> verify#(assign) satck#(cnf,assign) -> if#(verify(assign),assign,unsat()) TRS: if(true(),t,e) -> t if(false(),t,e) -> e member(x,nil()) -> false() member(x,cons(y,ys)) -> if(eq(x,y),true(),member(x,ys)) eq(nil(),nil()) -> true() eq(O(x),0(y)) -> eq(x,y) eq(0(x),1(y)) -> false() eq(1(x),0(y)) -> false() eq(1(x),1(y)) -> eq(x,y) negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) choice(cons(x,xs)) -> x choice(cons(x,xs)) -> choice(xs) guess(nil()) -> nil() guess(cons(clause,cnf)) -> cons(choice(clause),guess(cnf)) verify(nil()) -> true() verify(cons(l,ls)) -> if(member(negate(l),ls),false(),verify(ls)) sat(cnf) -> satck(cnf,guess(cnf)) satck(cnf,assign) -> if(verify(assign),assign,unsat()) TDG Processor: DPs: member#(x,cons(y,ys)) -> member#(x,ys) member#(x,cons(y,ys)) -> eq#(x,y) member#(x,cons(y,ys)) -> if#(eq(x,y),true(),member(x,ys)) eq#(O(x),0(y)) -> eq#(x,y) eq#(1(x),1(y)) -> eq#(x,y) choice#(cons(x,xs)) -> choice#(xs) guess#(cons(clause,cnf)) -> guess#(cnf) guess#(cons(clause,cnf)) -> choice#(clause) verify#(cons(l,ls)) -> verify#(ls) verify#(cons(l,ls)) -> negate#(l) verify#(cons(l,ls)) -> member#(negate(l),ls) verify#(cons(l,ls)) -> if#(member(negate(l),ls),false(),verify(ls)) sat#(cnf) -> guess#(cnf) sat#(cnf) -> satck#(cnf,guess(cnf)) satck#(cnf,assign) -> verify#(assign) satck#(cnf,assign) -> if#(verify(assign),assign,unsat()) TRS: if(true(),t,e) -> t if(false(),t,e) -> e member(x,nil()) -> false() member(x,cons(y,ys)) -> if(eq(x,y),true(),member(x,ys)) eq(nil(),nil()) -> true() eq(O(x),0(y)) -> eq(x,y) eq(0(x),1(y)) -> false() eq(1(x),0(y)) -> false() eq(1(x),1(y)) -> eq(x,y) negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) choice(cons(x,xs)) -> x choice(cons(x,xs)) -> choice(xs)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472