Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equational pair #487523213
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
n184.star.cs.uiowa.edu
space
Mixed_AC
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
10.5193691254 seconds
cpu usage
14.224467122
max memory
2.35835392E8
stage attributes
key
value
output-size
14671
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: AC symbols: virg * 1: substt(ef(x),y) -> ef(substt(x,y)) 2: substf(Pe(x),y) -> Pe(substt(x,y)) 3: substf(neg(f),s) -> neg(substf(f,s)) 4: substf(and(f,g),s) -> and(substf(f,s),substf(g,s)) 5: substf(or(f,g),s) -> or(substf(f,s),substf(g,s)) 6: substf(imp(f,g),s) -> imp(substf(f,s),substf(g,s)) 7: substf(forall(f),s) -> forall(substf(f,.(1(),ron(s,shift())))) 8: substf(exists(f),s) -> exists(substf(f,.(1(),ron(s,shift())))) 9: substt(x,id()) -> x 10: substf(f,id()) -> f 11: substt(substt(x,s),t) -> substt(x,ron(s,t)) 12: substf(substf(f,s),t) -> substf(f,ron(s,t)) 13: substt(1(),.(x,s)) -> x 14: ron(id(),s) -> s 15: ron(shift(),.(x,s)) -> s 16: ron(ron(s,t),u) -> ron(s,ron(t,u)) 17: ron(.(x,s),t) -> .(substt(x,t),ron(s,t)) 18: ron(s,id()) -> s 19: .(1(),shift()) -> id() 20: .(substt(1(),s),ron(shift(),s)) -> s 21: virg(emptyfset(),a) -> a 22: virg(a,a) -> a 23: *(emptysset(),a) -> a 24: *(a,a) -> a 25: neg(neg(f)) -> f 26: and(f,f) -> f 27: or(f,f) -> f 28: imp(f,g) -> or(neg(f),g) 29: exists(f) -> neg(forall(neg(f))) 30: sequent(virg(convf(neg(f)),a),b) -> sequent(a,virg(convf(f),b)) 31: sequent(convf(neg(f)),b) -> sequent(emptyfset(),virg(convf(f),b)) 32: sequent(a,virg(convf(neg(f)),b)) -> sequent(virg(convf(f),a),b) 33: sequent(a,convf(neg(f))) -> sequent(virg(convf(f),a),emptyfset()) 34: sequent(virg(convf(and(f,g)),a),b) -> sequent(virg(convf(g),virg(convf(f),a)),b) 35: sequent(convf(and(f,g)),b) -> sequent(virg(convf(f),convf(g)),b) 36: sequent(a,virg(convf(or(f,g)),b)) -> sequent(a,virg(virg(convf(f),convf(g)),b)) 37: sequent(a,convf(or(f,g))) -> sequent(a,virg(convf(f),convf(g))) 38: convs(sequent(a,virg(convf(and(f,g)),b))) -> *(convs(sequent(a,virg(convf(f),b))),convs(sequent(a,virg(convf(g),b)))) 39: convs(sequent(a,convf(and(f,g)))) -> *(convs(sequent(a,convf(f))),convs(sequent(a,convf(g)))) 40: convs(sequent(virg(convf(or(f,g)),a),b)) -> *(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) 41: convs(sequent(convf(or(f,g)),b)) -> *(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) 42: convs(sequent(virg(convf(f),a),virg(convf(f),b))) -> emptysset() 43: convs(sequent(virg(convf(f),a),convf(f))) -> emptysset() 44: convs(sequent(convf(f),virg(convf(f),b))) -> emptysset() 45: convs(sequent(convf(f),convf(f))) -> emptysset() 46: *(convs(sequent(virg(f,a),virg(g,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) 47: *(convs(sequent(virg(f,a),b)),convs(sequent(a,b))) -> convs(sequent(a,b)) 48: *(convs(sequent(a,virg(f,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) 49: *(convs(sequent(virg(f,a),b)),convs(sequent(a,emptyfset()))) -> convs(sequent(a,emptyfset())) 50: *(convs(sequent(emptyfset(),b)),convs(sequent(a,virg(f,b)))) -> convs(sequent(emptyfset(),b)) 51: *(convs(sequent(emptyfset(),b)),convs(sequent(a,b))) -> convs(sequent(emptyfset(),b)) 52: *(convs(sequent(a,emptyfset())),convs(sequent(a,b))) -> convs(sequent(a,emptyfset())) 53: *(convs(sequent(emptyfset(),emptyfset())),convs(sequent(a,b))) -> convs(sequent(emptyfset(),emptyfset())) Number of strict rules: 53 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #substf(Pe(x),y) -> #substt(x,y) #2: #exists(f) -> #neg(forall(neg(f))) #3: #exists(f) -> #neg(f) #4: #sequent(convf(and(f,g)),b) -> #sequent(virg(convf(f),convf(g)),b) #5: #sequent(convf(and(f,g)),b) -> #virg(convf(f),convf(g)) #6: #convs(sequent(convf(or(f,g)),b)) -> #*(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) #7: #convs(sequent(convf(or(f,g)),b)) -> #convs(sequent(convf(f),b)) #8: #convs(sequent(convf(or(f,g)),b)) -> #sequent(convf(f),b) #9: #convs(sequent(convf(or(f,g)),b)) -> #convs(sequent(convf(g),b)) #10: #convs(sequent(convf(or(f,g)),b)) -> #sequent(convf(g),b) #11: #sequent(a,convf(or(f,g))) -> #sequent(a,virg(convf(f),convf(g))) #12: #sequent(a,convf(or(f,g))) -> #virg(convf(f),convf(g)) #13: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #*(convs(sequent(a,virg(convf(f),b))),convs(sequent(a,virg(convf(g),b)))) #14: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #convs(sequent(a,virg(convf(f),b))) #15: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #sequent(a,virg(convf(f),b)) #16: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #virg(convf(f),b) #17: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #convs(sequent(a,virg(convf(g),b))) #18: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #sequent(a,virg(convf(g),b)) #19: #convs(sequent(a,virg(convf(and(f,g)),b))) -> #virg(convf(g),b) #20: #substf(imp(f,g),s) -> #imp(substf(f,s),substf(g,s)) #21: #substf(imp(f,g),s) -> #substf(f,s) #22: #substf(imp(f,g),s) -> #substf(g,s) #23: #*(x,*(y,z)) ->= #*(*(x,y),z) #24: #*(x,*(y,z)) ->= #*(x,y) #25: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #*(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) #26: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #convs(sequent(virg(convf(f),a),b)) #27: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #sequent(virg(convf(f),a),b) #28: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #virg(convf(f),a) #29: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #convs(sequent(virg(convf(g),a),b)) #30: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #sequent(virg(convf(g),a),b) #31: #convs(sequent(virg(convf(or(f,g)),a),b)) -> #virg(convf(g),a) #32: #substt(substt(x,s),t) -> #substt(x,ron(s,t)) #33: #substt(substt(x,s),t) -> #ron(s,t) #34: #substf(substf(f,s),t) -> #substf(f,ron(s,t))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equational