Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997320
details
property
value
status
complete
benchmark
sequent_modulo.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Mixed_AC
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
15.8728 seconds
cpu usage
19.61
user time
17.71
system time
1.9
max virtual memory
569736.0
max residence set size
22400.0
stage attributes
key
value
starexec-result
MAYBE
output
19.61/15.86 MAYBE 19.61/15.87 Input TRS: 19.61/15.87 AC symbols: virg * 19.61/15.87 1: substt(ef(x),y) -> ef(substt(x,y)) 19.61/15.87 2: substf(Pe(x),y) -> Pe(substt(x,y)) 19.61/15.87 3: substf(neg(f),s) -> neg(substf(f,s)) 19.61/15.87 4: substf(and(f,g),s) -> and(substf(f,s),substf(g,s)) 19.61/15.87 5: substf(or(f,g),s) -> or(substf(f,s),substf(g,s)) 19.61/15.87 6: substf(imp(f,g),s) -> imp(substf(f,s),substf(g,s)) 19.61/15.87 7: substf(forall(f),s) -> forall(substf(f,.(1(),ron(s,shift())))) 19.61/15.87 8: substf(exists(f),s) -> exists(substf(f,.(1(),ron(s,shift())))) 19.61/15.87 9: substt(x,id()) -> x 19.61/15.87 10: substf(f,id()) -> f 19.61/15.87 11: substt(substt(x,s),t) -> substt(x,ron(s,t)) 19.61/15.87 12: substf(substf(f,s),t) -> substf(f,ron(s,t)) 19.61/15.87 13: substt(1(),.(x,s)) -> x 19.61/15.87 14: ron(id(),s) -> s 19.61/15.87 15: ron(shift(),.(x,s)) -> s 19.61/15.87 16: ron(ron(s,t),u) -> ron(s,ron(t,u)) 19.61/15.87 17: ron(.(x,s),t) -> .(substt(x,t),ron(s,t)) 19.61/15.87 18: ron(s,id()) -> s 19.61/15.87 19: .(1(),shift()) -> id() 19.61/15.87 20: .(substt(1(),s),ron(shift(),s)) -> s 19.61/15.87 21: virg(emptyfset(),a) -> a 19.61/15.87 22: virg(a,a) -> a 19.61/15.87 23: *(emptysset(),a) -> a 19.61/15.87 24: *(a,a) -> a 19.61/15.87 25: neg(neg(f)) -> f 19.61/15.87 26: and(f,f) -> f 19.61/15.87 27: or(f,f) -> f 19.61/15.87 28: imp(f,g) -> or(neg(f),g) 19.61/15.87 29: exists(f) -> neg(forall(neg(f))) 19.61/15.87 30: sequent(virg(convf(neg(f)),a),b) -> sequent(a,virg(convf(f),b)) 19.61/15.87 31: sequent(convf(neg(f)),b) -> sequent(emptyfset(),virg(convf(f),b)) 19.61/15.87 32: sequent(a,virg(convf(neg(f)),b)) -> sequent(virg(convf(f),a),b) 19.61/15.87 33: sequent(a,convf(neg(f))) -> sequent(virg(convf(f),a),emptyfset()) 19.61/15.87 34: sequent(virg(convf(and(f,g)),a),b) -> sequent(virg(convf(g),virg(convf(f),a)),b) 19.61/15.87 35: sequent(convf(and(f,g)),b) -> sequent(virg(convf(f),convf(g)),b) 19.61/15.87 36: sequent(a,virg(convf(or(f,g)),b)) -> sequent(a,virg(virg(convf(f),convf(g)),b)) 19.61/15.87 37: sequent(a,convf(or(f,g))) -> sequent(a,virg(convf(f),convf(g))) 19.61/15.87 38: convs(sequent(a,virg(convf(and(f,g)),b))) -> *(convs(sequent(a,virg(convf(f),b))),convs(sequent(a,virg(convf(g),b)))) 19.61/15.87 39: convs(sequent(a,convf(and(f,g)))) -> *(convs(sequent(a,convf(f))),convs(sequent(a,convf(g)))) 19.61/15.87 40: convs(sequent(virg(convf(or(f,g)),a),b)) -> *(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) 19.61/15.87 41: convs(sequent(convf(or(f,g)),b)) -> *(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) 19.61/15.87 42: convs(sequent(virg(convf(f),a),virg(convf(f),b))) -> emptysset() 19.61/15.87 43: convs(sequent(virg(convf(f),a),convf(f))) -> emptysset() 19.61/15.87 44: convs(sequent(convf(f),virg(convf(f),b))) -> emptysset() 19.61/15.87 45: convs(sequent(convf(f),convf(f))) -> emptysset() 19.61/15.87 46: *(convs(sequent(virg(f,a),virg(g,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) 19.61/15.87 47: *(convs(sequent(virg(f,a),b)),convs(sequent(a,b))) -> convs(sequent(a,b)) 19.61/15.87 48: *(convs(sequent(a,virg(f,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) 19.61/15.87 49: *(convs(sequent(virg(f,a),b)),convs(sequent(a,emptyfset()))) -> convs(sequent(a,emptyfset())) 19.61/15.87 50: *(convs(sequent(emptyfset(),b)),convs(sequent(a,virg(f,b)))) -> convs(sequent(emptyfset(),b)) 19.61/15.87 51: *(convs(sequent(emptyfset(),b)),convs(sequent(a,b))) -> convs(sequent(emptyfset(),b)) 19.61/15.87 52: *(convs(sequent(a,emptyfset())),convs(sequent(a,b))) -> convs(sequent(a,emptyfset())) 19.61/15.87 53: *(convs(sequent(emptyfset(),emptyfset())),convs(sequent(a,b))) -> convs(sequent(emptyfset(),emptyfset())) 19.61/15.87 Number of strict rules: 53 19.61/15.87 Direct POLO(bPol) ... failed. 19.61/15.87 Uncurrying ... failed. 19.61/15.87 Dependency Pairs: 19.61/15.87 #1: #substf(Pe(x),y) -> #substt(x,y) 19.61/15.87 #2: #exists(f) -> #neg(forall(neg(f))) 19.61/15.87 #3: #exists(f) -> #neg(f) 19.61/15.87 #4: #sequent(convf(and(f,g)),b) -> #sequent(virg(convf(f),convf(g)),b) 19.61/15.87 #5: #sequent(convf(and(f,g)),b) -> #virg(convf(f),convf(g)) 19.61/15.87 #6: #convs(sequent(convf(or(f,g)),b)) -> #*(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) 19.61/15.87 #7: #convs(sequent(convf(or(f,g)),b)) -> #convs(sequent(convf(f),b)) 19.61/15.87 #8: #convs(sequent(convf(or(f,g)),b)) -> #sequent(convf(f),b) 19.61/15.87 #9: #convs(sequent(convf(or(f,g)),b)) -> #convs(sequent(convf(g),b)) 19.61/15.87 #10: #convs(sequent(convf(or(f,g)),b)) -> #sequent(convf(g),b) 19.61/15.87 #11: #sequent(a,convf(or(f,g))) -> #sequent(a,virg(convf(f),convf(g))) 19.61/15.87 #12: #sequent(a,convf(or(f,g))) -> #virg(convf(f),convf(g)) 19.61/15.87 #13: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #*(convs(sequent(a,virg(convf(f),b))),convs(sequent(a,virg(convf(g),b)))) 19.61/15.87 #14: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #convs(sequent(a,virg(convf(f),b))) 19.61/15.87 #15: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #sequent(a,virg(convf(f),b)) 19.61/15.87 #16: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #virg(convf(f),b) 19.61/15.87 #17: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #convs(sequent(a,virg(convf(g),b))) 19.61/15.87 #18: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #sequent(a,virg(convf(g),b)) 19.61/15.87 #19: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #virg(convf(g),b) 19.61/15.87 #20: #substf(imp(f,g),s) -> #imp(substf(f,s),substf(g,s)) 19.61/15.87 #21: #substf(imp(f,g),s) -> #substf(f,s) 19.61/15.87 #22: #substf(imp(f,g),s) -> #substf(g,s) 19.61/15.87 #23: #*(x,*(y,z)) ->= #*(*(x,y),z) 19.61/15.87 #24: #*(x,*(y,z)) ->= #*(x,y) 19.61/15.87 #25: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #*(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) 19.61/15.87 #26: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #convs(sequent(virg(convf(f),a),b)) 19.61/15.87 #27: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #sequent(virg(convf(f),a),b) 19.61/15.87 #28: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #virg(convf(f),a) 19.61/15.87 #29: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #convs(sequent(virg(convf(g),a),b)) 19.61/15.87 #30: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #sequent(virg(convf(g),a),b) 19.61/15.87 #31: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #virg(convf(g),a) 19.61/15.87 #32: #substt(substt(x,s),t) -> #substt(x,ron(s,t)) 19.61/15.87 #33: #substt(substt(x,s),t) -> #ron(s,t) 19.61/15.87 #34: #substf(substf(f,s),t) -> #substf(f,ron(s,t)) 19.61/15.87 #35: #substf(substf(f,s),t) -> #ron(s,t) 19.61/15.87 #36: #sequent(convf(neg(f)),b) -> #sequent(emptyfset(),virg(convf(f),b)) 19.61/15.87 #37: #sequent(convf(neg(f)),b) -> #virg(convf(f),b) 19.61/15.87 #38: #sequent(virg(convf(neg(f)),a),b) -> #sequent(a,virg(convf(f),b)) 19.61/15.87 #39: #sequent(virg(convf(neg(f)),a),b) -> #virg(convf(f),b) 19.61/15.87 #40: #substf(forall(f),s) -> #substf(f,.(1(),ron(s,shift())))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Equational 2019-03-21 05.09