details

property	value
status	complete
benchmark	cime5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n076.star.cs.uiowa.edu
space	Secret_05_TRS

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	28.8675978184 seconds
cpu usage	31.079299272
max memory	2.80174592E8

stage attributes

key	value
output-size	15729
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: intersect'ii'in(cons(X,X0),cons(X,X1)) -> intersect'ii'out() 2: intersect'ii'in(Xs,cons(X0,Ys)) -> u'1'1(intersect'ii'in(Xs,Ys)) 3: u'1'1(intersect'ii'out()) -> intersect'ii'out() 4: intersect'ii'in(cons(X0,Xs),Ys) -> u'2'1(intersect'ii'in(Xs,Ys)) 5: u'2'1(intersect'ii'out()) -> intersect'ii'out() 6: reduce'ii'in(sequent(cons(if(A,B),Fs),Gs),NF) -> u'3'1(reduce'ii'in(sequent(cons(x'2b(x'2d(B),A),Fs),Gs),NF)) 7: u'3'1(reduce'ii'out()) -> reduce'ii'out() 8: reduce'ii'in(sequent(cons(iff(A,B),Fs),Gs),NF) -> u'4'1(reduce'ii'in(sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs),NF)) 9: u'4'1(reduce'ii'out()) -> reduce'ii'out() 10: reduce'ii'in(sequent(cons(x'2a(F1,F2),Fs),Gs),NF) -> u'5'1(reduce'ii'in(sequent(cons(F1,cons(F2,Fs)),Gs),NF)) 11: u'5'1(reduce'ii'out()) -> reduce'ii'out() 12: reduce'ii'in(sequent(cons(x'2b(F1,F2),Fs),Gs),NF) -> u'6'1(reduce'ii'in(sequent(cons(F1,Fs),Gs),NF),F2,Fs,Gs,NF) 13: u'6'1(reduce'ii'out(),F2,Fs,Gs,NF) -> u'6'2(reduce'ii'in(sequent(cons(F2,Fs),Gs),NF)) 14: u'6'2(reduce'ii'out()) -> reduce'ii'out() 15: reduce'ii'in(sequent(cons(x'2d(F1),Fs),Gs),NF) -> u'7'1(reduce'ii'in(sequent(Fs,cons(F1,Gs)),NF)) 16: u'7'1(reduce'ii'out()) -> reduce'ii'out() 17: reduce'ii'in(sequent(Fs,cons(if(A,B),Gs)),NF) -> u'8'1(reduce'ii'in(sequent(Fs,cons(x'2b(x'2d(B),A),Gs)),NF)) 18: u'8'1(reduce'ii'out()) -> reduce'ii'out() 19: reduce'ii'in(sequent(Fs,cons(iff(A,B),Gs)),NF) -> u'9'1(reduce'ii'in(sequent(Fs,cons(x'2a(if(A,B),if(B,A)),Gs)),NF)) 20: u'9'1(reduce'ii'out()) -> reduce'ii'out() 21: reduce'ii'in(sequent(cons(p(V),Fs),Gs),sequent(Left,Right)) -> u'10'1(reduce'ii'in(sequent(Fs,Gs),sequent(cons(p(V),Left),Right))) 22: u'10'1(reduce'ii'out()) -> reduce'ii'out() 23: reduce'ii'in(sequent(Fs,cons(x'2b(G1,G2),Gs)),NF) -> u'11'1(reduce'ii'in(sequent(Fs,cons(G1,cons(G2,Gs))),NF)) 24: u'11'1(reduce'ii'out()) -> reduce'ii'out() 25: reduce'ii'in(sequent(Fs,cons(x'2a(G1,G2),Gs)),NF) -> u'12'1(reduce'ii'in(sequent(Fs,cons(G1,Gs)),NF),Fs,G2,Gs,NF) 26: u'12'1(reduce'ii'out(),Fs,G2,Gs,NF) -> u'12'2(reduce'ii'in(sequent(Fs,cons(G2,Gs)),NF)) 27: u'12'2(reduce'ii'out()) -> reduce'ii'out() 28: reduce'ii'in(sequent(Fs,cons(x'2d(G1),Gs)),NF) -> u'13'1(reduce'ii'in(sequent(cons(G1,Fs),Gs),NF)) 29: u'13'1(reduce'ii'out()) -> reduce'ii'out() 30: reduce'ii'in(sequent(nil(),cons(p(V),Gs)),sequent(Left,Right)) -> u'14'1(reduce'ii'in(sequent(nil(),Gs),sequent(Left,cons(p(V),Right)))) 31: u'14'1(reduce'ii'out()) -> reduce'ii'out() 32: reduce'ii'in(sequent(nil(),nil()),sequent(F1,F2)) -> u'15'1(intersect'ii'in(F1,F2)) 33: u'15'1(intersect'ii'out()) -> reduce'ii'out() 34: tautology'i'in(F) -> u'16'1(reduce'ii'in(sequent(nil(),cons(F,nil())),sequent(nil(),nil()))) 35: u'16'1(reduce'ii'out()) -> tautology'i'out() Number of strict rules: 35 Direct poly ... failed. Freezing reduce'ii'in 1: intersect'ii'in(cons(X,X0),cons(X,X1)) -> intersect'ii'out() 2: intersect'ii'in(Xs,cons(X0,Ys)) -> u'1'1(intersect'ii'in(Xs,Ys)) 3: u'1'1(intersect'ii'out()) -> intersect'ii'out() 4: intersect'ii'in(cons(X0,Xs),Ys) -> u'2'1(intersect'ii'in(Xs,Ys)) 5: u'2'1(intersect'ii'out()) -> intersect'ii'out() 6: reduce'ii'in❆1_sequent(cons(if(A,B),Fs),Gs,NF) -> u'3'1(reduce'ii'in❆1_sequent(cons(x'2b(x'2d(B),A),Fs),Gs,NF)) 7: u'3'1(reduce'ii'out()) -> reduce'ii'out() 8: reduce'ii'in❆1_sequent(cons(iff(A,B),Fs),Gs,NF) -> u'4'1(reduce'ii'in❆1_sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs,NF)) 9: u'4'1(reduce'ii'out()) -> reduce'ii'out() 10: reduce'ii'in❆1_sequent(cons(x'2a(F1,F2),Fs),Gs,NF) -> u'5'1(reduce'ii'in❆1_sequent(cons(F1,cons(F2,Fs)),Gs,NF)) 11: u'5'1(reduce'ii'out()) -> reduce'ii'out() 12: reduce'ii'in❆1_sequent(cons(x'2b(F1,F2),Fs),Gs,NF) -> u'6'1(reduce'ii'in❆1_sequent(cons(F1,Fs),Gs,NF),F2,Fs,Gs,NF) 13: u'6'1(reduce'ii'out(),F2,Fs,Gs,NF) -> u'6'2(reduce'ii'in❆1_sequent(cons(F2,Fs),Gs,NF)) 14: u'6'2(reduce'ii'out()) -> reduce'ii'out() 15: reduce'ii'in❆1_sequent(cons(x'2d(F1),Fs),Gs,NF) -> u'7'1(reduce'ii'in❆1_sequent(Fs,cons(F1,Gs),NF)) 16: u'7'1(reduce'ii'out()) -> reduce'ii'out() 17: reduce'ii'in❆1_sequent(Fs,cons(if(A,B),Gs),NF) -> u'8'1(reduce'ii'in❆1_sequent(Fs,cons(x'2b(x'2d(B),A),Gs),NF)) 18: u'8'1(reduce'ii'out()) -> reduce'ii'out() 19: reduce'ii'in❆1_sequent(Fs,cons(iff(A,B),Gs),NF) -> u'9'1(reduce'ii'in❆1_sequent(Fs,cons(x'2a(if(A,B),if(B,A)),Gs),NF)) 20: u'9'1(reduce'ii'out()) -> reduce'ii'out() 21: reduce'ii'in❆1_sequent(cons(p(V),Fs),Gs,sequent(Left,Right)) -> u'10'1(reduce'ii'in❆1_sequent(Fs,Gs,sequent(cons(p(V),Left),Right))) 22: u'10'1(reduce'ii'out()) -> reduce'ii'out() 23: reduce'ii'in❆1_sequent(Fs,cons(x'2b(G1,G2),Gs),NF) -> u'11'1(reduce'ii'in❆1_sequent(Fs,cons(G1,cons(G2,Gs)),NF)) 24: u'11'1(reduce'ii'out()) -> reduce'ii'out() 25: reduce'ii'in❆1_sequent(Fs,cons(x'2a(G1,G2),Gs),NF) -> u'12'1(reduce'ii'in❆1_sequent(Fs,cons(G1,Gs),NF),Fs,G2,Gs,NF) 26: u'12'1(reduce'ii'out(),Fs,G2,Gs,NF) -> u'12'2(reduce'ii'in❆1_sequent(Fs,cons(G2,Gs),NF)) 27: u'12'2(reduce'ii'out()) -> reduce'ii'out() 28: reduce'ii'in❆1_sequent(Fs,cons(x'2d(G1),Gs),NF) -> u'13'1(reduce'ii'in❆1_sequent(cons(G1,Fs),Gs,NF)) 29: u'13'1(reduce'ii'out()) -> reduce'ii'out() 30: reduce'ii'in❆1_sequent(nil(),cons(p(V),Gs),sequent(Left,Right)) -> u'14'1(reduce'ii'in❆1_sequent(nil(),Gs,sequent(Left,cons(p(V),Right)))) 31: u'14'1(reduce'ii'out()) -> reduce'ii'out() 32: reduce'ii'in❆1_sequent(nil(),nil(),sequent(F1,F2)) -> u'15'1(intersect'ii'in(F1,F2)) 33: u'15'1(intersect'ii'out()) -> reduce'ii'out() 34: tautology'i'in(F) -> u'16'1(reduce'ii'in❆1_sequent(nil(),cons(F,nil()),sequent(nil(),nil()))) 35: u'16'1(reduce'ii'out()) -> tautology'i'out() 36: reduce'ii'in(sequent(_1,_2),_3) ->= reduce'ii'in❆1_sequent(_1,_2,_3) Number of strict rules: 35 Direct poly ... failed. Dependency Pairs: #1: #intersect'ii'in(Xs,cons(X0,Ys)) -> #u'1'1(intersect'ii'in(Xs,Ys)) #2: #intersect'ii'in(Xs,cons(X0,Ys)) -> #intersect'ii'in(Xs,Ys) #3: #reduce'ii'in❆1_sequent(cons(if(A,B),Fs),Gs,NF) -> #u'3'1(reduce'ii'in❆1_sequent(cons(x'2b(x'2d(B),A),Fs),Gs,NF)) #4: #reduce'ii'in❆1_sequent(cons(if(A,B),Fs),Gs,NF) -> #reduce'ii'in❆1_sequent(cons(x'2b(x'2d(B),A),Fs),Gs,NF) #5: #u'6'1(reduce'ii'out(),F2,Fs,Gs,NF) -> #u'6'2(reduce'ii'in❆1_sequent(cons(F2,Fs),Gs,NF)) #6: #u'6'1(reduce'ii'out(),F2,Fs,Gs,NF) -> #reduce'ii'in❆1_sequent(cons(F2,Fs),Gs,NF) #7: #reduce'ii'in❆1_sequent(Fs,cons(x'2b(G1,G2),Gs),NF) -> #u'11'1(reduce'ii'in❆1_sequent(Fs,cons(G1,cons(G2,Gs)),NF)) #8: #reduce'ii'in❆1_sequent(Fs,cons(x'2b(G1,G2),Gs),NF) -> #reduce'ii'in❆1_sequent(Fs,cons(G1,cons(G2,Gs)),NF) #9: #reduce'ii'in❆1_sequent(cons(x'2b(F1,F2),Fs),Gs,NF) -> #u'6'1(reduce'ii'in❆1_sequent(cons(F1,Fs),Gs,NF),F2,Fs,Gs,NF) #10: #reduce'ii'in❆1_sequent(cons(x'2b(F1,F2),Fs),Gs,NF) -> #reduce'ii'in❆1_sequent(cons(F1,Fs),Gs,NF) #11: #reduce'ii'in❆1_sequent(nil(),cons(p(V),Gs),sequent(Left,Right)) -> #u'14'1(reduce'ii'in❆1_sequent(nil(),Gs,sequent(Left,cons(p(V),Right)))) #12: #reduce'ii'in❆1_sequent(nil(),cons(p(V),Gs),sequent(Left,Right)) -> #reduce'ii'in❆1_sequent(nil(),Gs,sequent(Left,cons(p(V),Right))) #13: #reduce'ii'in❆1_sequent(Fs,cons(x'2a(G1,G2),Gs),NF) -> #u'12'1(reduce'ii'in❆1_sequent(Fs,cons(G1,Gs),NF),Fs,G2,Gs,NF) #14: #reduce'ii'in❆1_sequent(Fs,cons(x'2a(G1,G2),Gs),NF) -> #reduce'ii'in❆1_sequent(Fs,cons(G1,Gs),NF) #15: #reduce'ii'in❆1_sequent(cons(x'2a(F1,F2),Fs),Gs,NF) -> #u'5'1(reduce'ii'in❆1_sequent(cons(F1,cons(F2,Fs)),Gs,NF)) popout

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

job log

popout

actions

all output return to TRS Standard