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	n046.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	103.203170061 seconds
cpu usage	102.668850812
max memory	3.71314688E8

stage attributes

key	value
output-size	367450
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 a b f g s t u x y) (THEORY (AC * virg)) (RULES *(convs(sequent(virg(f,a),virg(g,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) *(convs(sequent(virg(f,a),b)),convs(sequent(a,emptyfset))) -> convs(sequent(a,emptyfset)) *(convs(sequent(virg(f,a),b)),convs(sequent(a,b))) -> convs(sequent(a,b)) *(convs(sequent(emptyfset,emptyfset)),convs(sequent(a,b))) -> convs(sequent(emptyfset,emptyfset)) *(convs(sequent(emptyfset,b)),convs(sequent(a,virg(f,b)))) -> convs(sequent(emptyfset,b)) *(convs(sequent(emptyfset,b)),convs(sequent(a,b))) -> convs(sequent(emptyfset,b)) *(convs(sequent(a,virg(f,b))),convs(sequent(a,b))) -> convs(sequent(a,b)) *(convs(sequent(a,emptyfset)),convs(sequent(a,b))) -> convs(sequent(a,emptyfset)) *(emptysset,a) -> a *(a,a) -> a .(substt(1,s),ron(shift,s)) -> s .(1,shift) -> id and(f,f) -> f convs(sequent(virg(convf(or(f,g)),a),b)) -> *(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) convs(sequent(virg(convf(f),a),virg(convf(f),b))) -> emptysset convs(sequent(virg(convf(f),a),convf(f))) -> emptysset convs(sequent(convf(or(f,g)),b)) -> *(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) convs(sequent(convf(f),virg(convf(f),b))) -> emptysset convs(sequent(convf(f),convf(f))) -> emptysset convs(sequent(a,virg(convf(and(f,g)),b))) -> *(convs(sequent(a,virg(convf(f),b))),convs(sequent(a,virg(convf(g),b)))) convs(sequent(a,convf(and(f,g)))) -> *(convs(sequent(a,convf(f))),convs(sequent(a,convf(g)))) exists(f) -> neg(forall(neg(f))) imp(f,g) -> or(neg(f),g) neg(neg(f)) -> f or(f,f) -> f ron(.(x,s),t) -> .(substt(x,t),ron(s,t)) ron(ron(s,t),u) -> ron(s,ron(t,u)) ron(id,s) -> s ron(shift,.(x,s)) -> s ron(s,id) -> s sequent(virg(convf(and(f,g)),a),b) -> sequent(virg(convf(g),virg(convf(f),a)),b) sequent(virg(convf(neg(f)),a),b) -> sequent(a,virg(convf(f),b)) sequent(convf(and(f,g)),b) -> sequent(virg(convf(f),convf(g)),b) sequent(convf(neg(f)),b) -> sequent(emptyfset,virg(convf(f),b)) sequent(a,virg(convf(neg(f)),b)) -> sequent(virg(convf(f),a),b) sequent(a,virg(convf(or(f,g)),b)) -> sequent(a,virg(virg(convf(f),convf(g)),b)) sequent(a,convf(neg(f))) -> sequent(virg(convf(f),a),emptyfset) sequent(a,convf(or(f,g))) -> sequent(a,virg(convf(f),convf(g))) substf(and(f,g),s) -> and(substf(f,s),substf(g,s)) substf(exists(f),s) -> exists(substf(f,.(1,ron(s,shift)))) substf(imp(f,g),s) -> imp(substf(f,s),substf(g,s)) substf(neg(f),s) -> neg(substf(f,s)) substf(or(f,g),s) -> or(substf(f,s),substf(g,s)) substf(substf(f,s),t) -> substf(f,ron(s,t)) substf(Pe(x),y) -> Pe(substt(x,y)) substf(forall(f),s) -> forall(substf(f,.(1,ron(s,shift)))) substf(f,id) -> f substt(substt(x,s),t) -> substt(x,ron(s,t)) substt(1,.(x,s)) -> x substt(ef(x),y) -> ef(substt(x,y)) substt(x,id) -> x virg(emptyfset,a) -> a virg(a,a) -> a ) Problem 1: Dependency Pairs Processor: -> FAxioms: *#(*(x9,x10),x11) = *#(x9,*(x10,x11)) *#(x9,x10) = *#(x10,x9) VIRG(virg(x9,x10),x11) = VIRG(x9,virg(x10,x11)) VIRG(x9,x10) = VIRG(x10,x9) -> Pairs: *#(*(convs(sequent(virg(f,a),virg(g,b))),convs(sequent(a,b))),x9) -> *#(convs(sequent(a,b)),x9) *#(*(convs(sequent(virg(f,a),b)),convs(sequent(a,emptyfset))),x9) -> *#(convs(sequent(a,emptyfset)),x9) *#(*(convs(sequent(virg(f,a),b)),convs(sequent(a,b))),x9) -> *#(convs(sequent(a,b)),x9) *#(*(convs(sequent(emptyfset,emptyfset)),convs(sequent(a,b))),x9) -> *#(convs(sequent(emptyfset,emptyfset)),x9) *#(*(convs(sequent(emptyfset,b)),convs(sequent(a,virg(f,b)))),x9) -> *#(convs(sequent(emptyfset,b)),x9) *#(*(convs(sequent(emptyfset,b)),convs(sequent(a,b))),x9) -> *#(convs(sequent(emptyfset,b)),x9) *#(*(convs(sequent(a,virg(f,b))),convs(sequent(a,b))),x9) -> *#(convs(sequent(a,b)),x9) *#(*(convs(sequent(a,emptyfset)),convs(sequent(a,b))),x9) -> *#(convs(sequent(a,emptyfset)),x9) *#(*(emptysset,a),x9) -> *#(a,x9) *#(*(a,a),x9) -> *#(a,x9) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> *#(convs(sequent(virg(convf(f),a),b)),convs(sequent(virg(convf(g),a),b))) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> CONVS(sequent(virg(convf(f),a),b)) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> CONVS(sequent(virg(convf(g),a),b)) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> SEQUENT(virg(convf(f),a),b) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> SEQUENT(virg(convf(g),a),b) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> VIRG(convf(f),a) CONVS(sequent(virg(convf(or(f,g)),a),b)) -> VIRG(convf(g),a) CONVS(sequent(convf(or(f,g)),b)) -> *#(convs(sequent(convf(f),b)),convs(sequent(convf(g),b))) CONVS(sequent(convf(or(f,g)),b)) -> CONVS(sequent(convf(f),b)) CONVS(sequent(convf(or(f,g)),b)) -> CONVS(sequent(convf(g),b)) CONVS(sequent(convf(or(f,g)),b)) -> SEQUENT(convf(f),b) CONVS(sequent(convf(or(f,g)),b)) -> SEQUENT(convf(g),b) popout

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

job log

popout

actions

all output return to TRS Equat 89423