Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487068401
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
n179.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.0578971 seconds
cpu usage
0.033323
user time
0.016766
system time
0.016557
max virtual memory
113188.0
max residence set size
6304.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: if(true(),t,e) -> t 2: if(false(),t,e) -> e 3: member(x,nil()) -> false() 4: member(x,cons(y,ys)) -> if(eq(x,y),true(),member(x,ys)) 5: eq(nil(),nil()) -> true() 6: eq(O(x),0(y)) -> eq(x,y) 7: eq(0(x),1(y)) -> false() 8: eq(1(x),0(y)) -> false() 9: eq(1(x),1(y)) -> eq(x,y) 10: negate(0(x)) -> 1(x) 11: negate(1(x)) -> 0(x) 12: choice(cons(x,xs)) -> x 13: choice(cons(x,xs)) -> choice(xs) 14: guess(nil()) -> nil() 15: guess(cons(clause,cnf)) -> cons(choice(clause),guess(cnf)) 16: verify(nil()) -> true() 17: verify(cons(l,ls)) -> if(member(negate(l),ls),false(),verify(ls)) 18: sat(cnf) -> satck(cnf,guess(cnf)) 19: satck(cnf,assign) -> if(verify(assign),assign,unsat()) Number of strict rules: 19 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #eq(O(x),0(y)) -> #eq(x,y) #2: #choice(cons(x,xs)) -> #choice(xs) #3: #eq(1(x),1(y)) -> #eq(x,y) #4: #verify(cons(l,ls)) -> #if(member(negate(l),ls),false(),verify(ls)) #5: #verify(cons(l,ls)) -> #member(negate(l),ls) #6: #verify(cons(l,ls)) -> #negate(l) #7: #verify(cons(l,ls)) -> #verify(ls) #8: #satck(cnf,assign) -> #if(verify(assign),assign,unsat()) #9: #satck(cnf,assign) -> #verify(assign) #10: #guess(cons(clause,cnf)) -> #choice(clause) #11: #guess(cons(clause,cnf)) -> #guess(cnf) #12: #member(x,cons(y,ys)) -> #if(eq(x,y),true(),member(x,ys)) #13: #member(x,cons(y,ys)) -> #eq(x,y) #14: #member(x,cons(y,ys)) -> #member(x,ys) #15: #sat(cnf) -> #satck(cnf,guess(cnf)) #16: #sat(cnf) -> #guess(cnf) Number of SCCs: 5, DPs: 6 SCC { #11 } POLO(Sum)... succeeded. #choice w: 0 verify w: 0 #negate w: 0 1 w: 0 #sat w: 0 unsat w: 0 #guess w: x1 negate w: 0 choice w: 0 member w: 0 eq w: 0 false w: 0 satck w: 0 O w: 0 true w: 0 sat w: 0 #eq w: 0 #satck w: 0 if w: 0 0 w: 0 nil w: 0 guess w: 0 cons w: x2 + 1 #member w: 0 #if w: 0 #verify w: 0 USABLE RULES: { } Removed DPs: #11 Number of SCCs: 4, DPs: 5 SCC { #7 } POLO(Sum)... succeeded. #choice w: 0 verify w: 0 #negate w: 0 1 w: 0 #sat w: 0 unsat w: 0 #guess w: 0 negate w: 0 choice w: 0 member w: 0 eq w: 0 false w: 0 satck w: 0 O w: 0 true w: 0 sat w: 0 #eq w: 0 #satck w: 0 if w: 0 0 w: 0 nil w: 0 guess w: 0 cons w: x2 + 1 #member w: 0 #if w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard