0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer   : n008.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 180
0.14/0.34	% DateTime   : Thu Aug 29 13:14:08 EDT 2019
0.14/0.34	% CPUTime    : 
0.82/1.09	============================== Prover9 ===============================
0.82/1.09	Prover9 (32) version 2009-11A, November 2009.
0.82/1.09	Process 18972 was started by sandbox on n008.cluster.edu,
0.82/1.09	Thu Aug 29 13:14:09 2019
0.82/1.09	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_18818_n008.cluster.edu".
0.82/1.09	============================== end of head ===========================
0.82/1.09	
0.82/1.09	============================== INPUT =================================
0.82/1.09	
0.82/1.09	% Reading from file /tmp/Prover9_18818_n008.cluster.edu
0.82/1.09	
0.82/1.09	set(prolog_style_variables).
0.82/1.09	set(auto2).
0.82/1.09	    % set(auto2) -> set(auto).
0.82/1.09	    % set(auto) -> set(auto_inference).
0.82/1.09	    % set(auto) -> set(auto_setup).
0.82/1.09	    % set(auto_setup) -> set(predicate_elim).
0.82/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.09	    % set(auto) -> set(auto_limits).
0.82/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.09	    % set(auto) -> set(auto_denials).
0.82/1.09	    % set(auto) -> set(auto_process).
0.82/1.09	    % set(auto2) -> assign(new_constants, 1).
0.82/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.09	    % set(auto2) -> assign(max_hours, 1).
0.82/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.09	    % set(auto2) -> set(sort_initial_sos).
0.82/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.09	    % set(auto2) -> assign(max_megs, 400).
0.82/1.09	    % set(auto2) -> assign(stats, some).
0.82/1.09	    % set(auto2) -> clear(echo_input).
0.82/1.09	    % set(auto2) -> set(quiet).
0.82/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.09	    % set(auto2) -> clear(print_given).
0.82/1.09	assign(lrs_ticks,-1).
0.82/1.09	assign(sos_limit,10000).
0.82/1.09	assign(order,kbo).
0.82/1.09	set(lex_order_vars).
0.82/1.09	clear(print_given).
0.82/1.09	
0.82/1.09	% formulas(sos).  % not echoed (96 formulas)
0.82/1.09	
0.82/1.09	============================== end of input ==========================
0.82/1.09	
0.82/1.09	% From the command line: assign(max_seconds, 180).
0.82/1.09	
0.82/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.09	
0.82/1.09	% Formulas that are not ordinary clauses:
0.82/1.09	1 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (gt(U,V) & gt(V,W) -> gt(U,W)))))))) # label(ax95) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	2 (all U (ssList(U) -> (exists V (ssList(V) & (exists W (U = cons(W,V) & ssItem(W))))) | U = nil)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	3 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	4 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(V,U) & rearsegP(U,V) -> U = V))))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	5 (all U (ssList(U) -> (U = nil <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	6 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	7 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	8 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	9 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> hd(U) = hd(app(U,V))))))) # label(ax85) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	10 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	11 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(W,U) = cons(X,V) -> V = U & X = W))))))))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	12 (all U (ssList(U) -> (U != nil -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	13 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	14 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	15 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	16 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> app(app(U,V),W) = app(U,app(V,W)))))))) # label(ax82) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	17 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(V,U) = app(V,W) -> U = W))))))) # label(ax80) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	18 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) <-> V != U & leq(U,V)))))) # label(ax93) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	19 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (memberP(W,U) | V = U <-> memberP(cons(V,W),U)))))))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	20 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	21 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (geq(V,W) & geq(U,V) -> geq(U,W)))))))) # label(ax88) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	22 (all U (ssList(U) -> (all V (ssItem(V) -> app(cons(V,nil),U) = cons(V,U))))) # label(ax81) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	23 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	24 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(U,V) = app(W,V) -> W = U))))))) # label(ax79) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	25 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> lt(W,V) | lt(V,W)))))))))))) <-> strictorderP(U)))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	26 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (segmentP(U,V) & segmentP(V,W) -> segmentP(U,W)))))))) # label(ax53) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	27 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(U,V) & leq(V,W) -> leq(U,W)))))))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	28 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(U,V) & lt(V,W) -> lt(U,W)))))))) # label(ax91) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	29 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (frontsegP(U,V) & frontsegP(V,W) -> frontsegP(U,W)))))))) # label(ax40) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	30 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	31 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	32 (all U (ssList(U) -> (nil != U -> U = cons(hd(U),tl(U))))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	33 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	34 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(V,U) & segmentP(U,V) -> V = U))))) # label(ax54) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	35 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	36 (all U (ssList(U) -> (all V (ssItem(V) -> U = tl(cons(V,U)))))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	37 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	38 (all U (ssList(U) -> (totalorderedP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (U = app(app(X,cons(V,Y)),cons(W,Z)) -> leq(V,W))))))))))))))) # label(ax11) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	39 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) & geq(V,U) -> V = U))))) # label(ax87) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	40 (all U (ssList(U) -> (U != nil -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.82/1.09	41 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (segmentP(U,V) -> segmentP(app(app(W,U),X),V)))))))))) # label(ax56) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	42 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (lt(U,V) & lt(V,W) -> lt(U,W)))))))) # label(ax34) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	43 (all U (ssItem(U) -> (all V (ssList(V) -> (nil = V | V != nil & strictorderedP(V) & lt(U,hd(V)) <-> strictorderedP(cons(U,V))))))) # label(ax70) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	44 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	45 (all U (ssList(U) -> (all V (ssList(V) -> (nil = app(U,V) <-> U = nil & nil = V))))) # label(ax83) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	46 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> app(cons(W,V),U) = cons(W,app(V,U)))))))) # label(ax27) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	47 (all U (ssList(U) -> (all V (ssList(V) -> (frontsegP(U,V) <-> (exists W (ssList(W) & U = app(V,W)))))))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	48 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	49 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (frontsegP(cons(U,W),cons(V,X)) <-> frontsegP(W,X) & V = U))))))))) # label(ax44) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	50 (all U (ssList(U) -> (all V (ssItem(V) -> ((exists W ((exists X (app(W,cons(V,X)) = U & ssList(X))) & ssList(W))) <-> memberP(U,V)))))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	51 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	52 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	53 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> -(leq(W,V) & leq(V,W))))))))))))) <-> cyclefreeP(U)))) # label(ax8) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	54 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(U,V) <-> (exists W (ssList(W) & U = app(W,V)))))))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	55 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	56 (all U (ssList(U) -> (nil = U <-> segmentP(nil,U)))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	57 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(U,V) -> rearsegP(app(W,U),V)))))))) # label(ax50) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	58 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	59 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(U,V) <-> (exists W ((exists X (ssList(X) & U = app(app(W,V),X))) & ssList(W)))))))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	60 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	61 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) -> U = V | lt(U,V)))))) # label(ax92) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	62 (all U (ssList(U) -> (all V (ssList(V) -> (V != nil & hd(V) = hd(U) & tl(V) = tl(U) & nil != U -> V = U))))) # label(ax77) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	63 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (frontsegP(U,V) -> frontsegP(app(U,W),V)))))))) # label(ax43) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	64 (all U (ssList(U) -> U = app(nil,U))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	65 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	66 (all U (ssList(U) -> (duplicatefreeP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> W != V)))))))))))))) # label(ax13) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	67 (all U (ssItem(U) -> (all V (ssList(V) -> (totalorderedP(cons(U,V)) <-> V != nil & leq(U,hd(V)) & totalorderedP(V) | nil = V))))) # label(ax67) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	68 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	69 (all U (ssList(U) -> ((exists V (U = cons(V,nil) & ssItem(V))) <-> singletonP(U)))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	70 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	71 (all U (ssItem(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (memberP(V,U) | memberP(W,U) <-> memberP(app(V,W),U)))))))) # label(ax36) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	72 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (U = app(app(X,cons(V,Y)),cons(W,Z)) -> lt(V,W)))))))))))) <-> strictorderedP(U)))) # label(ax12) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	73 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(V,W) & rearsegP(U,V) -> rearsegP(U,W)))))))) # label(ax47) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	74 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	75 (all U (ssList(U) -> (equalelemsP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (app(X,cons(V,cons(W,Y))) = U -> V = W)))))))))))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	76 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	77 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) <-> leq(V,U)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	78 (all U (ssList(U) -> (totalorderP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> leq(W,V) | leq(V,W))))))))))))))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	79 (all U (ssList(U) -> (U != nil -> (exists V (ssItem(V) & hd(U) = V))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	80 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) & leq(V,U) -> U = V))))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	81 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	82 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	83 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> app(tl(U),V) = tl(app(U,V))))))) # label(ax86) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	84 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	85 (all U (ssList(U) -> (all V (ssList(V) -> (U != V <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	86 (all U (ssList(U) -> (all V (ssList(V) -> (frontsegP(V,U) & frontsegP(U,V) -> U = V))))) # label(ax41) # label(axiom) # label(non_clause).  [assumption].
0.82/1.10	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> W != U | nil = W & nil != X | duplicatefreeP(U) | (all Y (ssList(Y) -> (all Z (ssList(Z) -> app(app(Y,W),Z) != X | -strictorderedP(W) | (exists X5 ((exists X6 (ssList(X6) & Z = app(cons(X5,nil),X6) & (exists X7 ((exists X8 (ssList(X8) & lt(X7,X5) & W = app(X8,cons(X7,nil)))) & ssItem(X7))))) & ssItem(X5))) | (exists X1 ((exists X2 (ssList(X2) & (exists X3 (ssItem(X3) & (exists X4 (ssList(X4) & lt(X1,X3) & W = app(cons(X3,nil),X4))))) & Y = app(X2,cons(X1,nil)))) & ssItem(X1))))))) | V != X)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.82/1.10	
0.82/1.10	============================== end of process non-clausal formulas ===
0.82/1.10	
0.82/1.10	============================== PROCESS INITIAL CLAUSES ===============
0.82/1.10	
0.82/1.10	============================== PREDICATE ELIMINATION =================
0.82/1.10	88 -ssList(A) | -totalorderP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	89 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(14)].
0.82/1.10	90 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.82/1.10	Derived: -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | leq(C,B) | leq(B,C) | -ssItem(A).  [resolve(88,b,89,b)].
0.82/1.10	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | leq(B,A) | leq(A,B).  [resolve(88,b,90,a)].
0.82/1.10	91 -ssList(A) | totalorderP(A) | ssItem(f40(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | ssItem(f40(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(91,b,88,b)].
0.82/1.10	92 -ssList(A) | totalorderP(A) | ssItem(f41(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | ssItem(f41(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(92,b,88,b)].
0.82/1.10	93 -ssList(A) | totalorderP(A) | ssList(f42(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | ssList(f42(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(93,b,88,b)].
0.82/1.10	94 -ssList(A) | totalorderP(A) | ssList(f43(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | ssList(f43(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(94,b,88,b)].
0.82/1.10	95 -ssList(A) | totalorderP(A) | ssList(f44(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | ssList(f44(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(95,b,88,b)].
0.82/1.10	96 -ssList(A) | totalorderP(A) | app(app(f42(A),cons(f40(A),f43(A))),cons(f41(A),f44(A))) = A # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | app(app(f42(A),cons(f40(A),f43(A))),cons(f41(A),f44(A))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(96,b,88,b)].
0.82/1.10	97 -ssList(A) | totalorderP(A) | -leq(f41(A),f40(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | -leq(f41(A),f40(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(97,b,88,b)].
0.82/1.10	98 -ssList(A) | totalorderP(A) | -leq(f40(A),f41(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.82/1.10	Derived: -ssList(A) | -leq(f40(A),f41(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(C,B) | leq(B,C).  [resolve(98,b,88,b)].
0.82/1.10	99 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	100 -ssList(A) | ssItem(f4(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	101 -ssList(A) | ssItem(f5(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	102 -ssList(A) | ssList(f6(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	103 -ssList(A) | ssList(f7(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	104 -ssList(A) | ssList(f8(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.10	105 -ssList(A) | app(app(f6(A),cons(f4(A),f7(A))),cons(f5(A),f8(A))) = A | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.18	106 -ssList(A) | -lt(f5(A),f4(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.18	107 -ssList(A) | -lt(f4(A),f5(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssItem(f4(A)).  [resolve(99,j,100,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssItem(f5(A)).  [resolve(99,j,101,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f6(A)).  [resolve(99,j,102,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f7(A)).  [resolve(99,j,103,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f8(A)).  [resolve(99,j,104,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | app(app(f6(A),cons(f4(A),f7(A))),cons(f5(A),f8(A))) = A.  [resolve(99,j,105,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | -lt(f5(A),f4(A)).  [resolve(99,j,106,c)].
0.82/1.18	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | -lt(f4(A),f5(A)).  [resolve(99,j,107,c)].
0.82/1.18	108 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.82/1.18	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | lt(B,A) | lt(A,B).  [resolve(108,a,99,j)].
0.82/1.18	109 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(60)].
0.82/1.18	Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | lt(C,B) | lt(B,C).  [resolve(109,b,99,j)].
0.82/1.18	110 -ssList(A) | -equalelemsP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.18	111 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
0.82/1.18	112 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(31)].
0.82/1.18	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(110,b,111,a)].
0.82/1.18	Derived: -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != cons(A,nil) | C = B | -ssItem(A).  [resolve(110,b,112,b)].
0.82/1.18	113 -ssList(A) | equalelemsP(A) | ssItem(f36(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.18	Derived: -ssList(A) | ssItem(f36(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(113,b,110,b)].
0.82/1.18	114 -ssList(A) | equalelemsP(A) | ssItem(f37(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.18	Derived: -ssList(A) | ssItem(f37(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(114,b,110,b)].
0.82/1.18	115 -ssList(A) | equalelemsP(A) | ssList(f38(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.18	Derived: -ssList(A) | ssList(f38(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(115,b,110,b)].
0.82/1.18	116 -ssList(A) | equalelemsP(A) | ssList(f39(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.18	Derived: -ssList(A) | ssList(f39(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(116,b,110,b)].
0.82/1.26	117 -ssList(A) | equalelemsP(A) | app(f38(A),cons(f36(A),cons(f37(A),f39(A)))) = A # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.26	Derived: -ssList(A) | app(f38(A),cons(f36(A),cons(f37(A),f39(A)))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(117,b,110,b)].
0.82/1.26	118 -ssList(A) | equalelemsP(A) | f37(A) != f36(A) # label(ax14) # label(axiom).  [clausify(75)].
0.82/1.26	Derived: -ssList(A) | f37(A) != f36(A) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(118,b,110,b)].
0.82/1.26	119 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	120 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(44)].
0.82/1.26	121 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.82/1.26	122 -ssList(A) | ssItem(f17(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	123 -ssList(A) | ssItem(f18(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	124 -ssList(A) | ssList(f19(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	125 -ssList(A) | ssList(f20(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	126 -ssList(A) | ssList(f21(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	127 -ssList(A) | app(app(f19(A),cons(f17(A),f20(A))),cons(f18(A),f21(A))) = A | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	128 -ssList(A) | leq(f18(A),f17(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	129 -ssList(A) | leq(f17(A),f18(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.82/1.26	Derived: -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | -leq(C,B) | -leq(B,C) | -ssItem(A).  [resolve(119,j,120,b)].
0.82/1.26	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | -leq(B,A) | -leq(A,B).  [resolve(119,j,121,a)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssItem(f17(A)).  [resolve(119,j,122,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssItem(f18(A)).  [resolve(119,j,123,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f19(A)).  [resolve(119,j,124,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f20(A)).  [resolve(119,j,125,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f21(A)).  [resolve(119,j,126,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | app(app(f19(A),cons(f17(A),f20(A))),cons(f18(A),f21(A))) = A.  [resolve(119,j,127,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | leq(f18(A),f17(A)).  [resolve(119,j,128,c)].
0.82/1.26	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | leq(f17(A),f18(A)).  [resolve(119,j,129,c)].
0.82/1.26	130 -ssItem(A) | -ssItem(B) | neq(A,B) | B = A # label(ax1) # label(axiom).  [clausify(52)].
0.82/1.26	131 -ssItem(A) | -ssItem(B) | -neq(A,B) | B != A # label(ax1) # label(axiom).  [clausify(52)].
0.82/1.26	132 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # labeCputime limit exceeded (core dumped)
180.05/180.31	EOF