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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	105.025 seconds
cpu usage	104.262
user time	99.9317
system time	4.32997
max virtual memory	1041208.0
max residence set size	234692.0

stage attributes

key	value
starexec-result	YES

output

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