0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n018.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 09:40:36 EDT 2019
0.12/0.33	% CPUTime    : 
0.42/1.07	============================== Prover9 ===============================
0.42/1.07	Prover9 (32) version 2009-11A, November 2009.
0.42/1.07	Process 19508 was started by sandbox2 on n018.cluster.edu,
0.42/1.07	Thu Aug 29 09:40:37 2019
0.42/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_19355_n018.cluster.edu".
0.42/1.07	============================== end of head ===========================
0.42/1.07	
0.42/1.07	============================== INPUT =================================
0.42/1.07	
0.42/1.07	% Reading from file /tmp/Prover9_19355_n018.cluster.edu
0.42/1.07	
0.42/1.07	set(prolog_style_variables).
0.42/1.07	set(auto2).
0.42/1.07	    % set(auto2) -> set(auto).
0.42/1.07	    % set(auto) -> set(auto_inference).
0.42/1.07	    % set(auto) -> set(auto_setup).
0.42/1.07	    % set(auto_setup) -> set(predicate_elim).
0.42/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.07	    % set(auto) -> set(auto_limits).
0.42/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.07	    % set(auto) -> set(auto_denials).
0.42/1.07	    % set(auto) -> set(auto_process).
0.42/1.07	    % set(auto2) -> assign(new_constants, 1).
0.42/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.07	    % set(auto2) -> assign(max_hours, 1).
0.42/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.07	    % set(auto2) -> set(sort_initial_sos).
0.42/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.07	    % set(auto2) -> assign(max_megs, 400).
0.42/1.07	    % set(auto2) -> assign(stats, some).
0.42/1.07	    % set(auto2) -> clear(echo_input).
0.42/1.07	    % set(auto2) -> set(quiet).
0.42/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.07	    % set(auto2) -> clear(print_given).
0.42/1.07	assign(lrs_ticks,-1).
0.42/1.07	assign(sos_limit,10000).
0.42/1.07	assign(order,kbo).
0.42/1.07	set(lex_order_vars).
0.42/1.07	clear(print_given).
0.42/1.07	
0.42/1.07	% formulas(sos).  % not echoed (96 formulas)
0.42/1.07	
0.42/1.07	============================== end of input ==========================
0.42/1.07	
0.42/1.07	% From the command line: assign(max_seconds, 180).
0.42/1.07	
0.42/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.07	
0.42/1.07	% Formulas that are not ordinary clauses:
0.42/1.07	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.42/1.07	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.42/1.07	3 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	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.42/1.07	5 (all U (ssList(U) -> (U = nil <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	6 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	7 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	8 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	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.42/1.07	10 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	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.42/1.07	12 (all U (ssList(U) -> (U != nil -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	13 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	14 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	15 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	20 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	23 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	30 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	31 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	32 (all U (ssList(U) -> (nil != U -> U = cons(hd(U),tl(U))))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	33 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	35 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	36 (all U (ssList(U) -> (all V (ssItem(V) -> U = tl(cons(V,U)))))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	37 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	40 (all U (ssList(U) -> (U != nil -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	44 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	48 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	51 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	52 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	55 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	56 (all U (ssList(U) -> (nil = U <-> segmentP(nil,U)))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	58 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	60 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.42/1.08	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.42/1.08	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.42/1.08	64 (all U (ssList(U) -> U = app(nil,U))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	65 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	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.81/1.08	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.81/1.08	68 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	69 (all U (ssList(U) -> ((exists V (U = cons(V,nil) & ssItem(V))) <-> singletonP(U)))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	70 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	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.81/1.08	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.81/1.08	74 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	76 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	77 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) <-> leq(V,U)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	79 (all U (ssList(U) -> (U != nil -> (exists V (ssItem(V) & hd(U) = V))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	81 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	82 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	84 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	85 (all U (ssList(U) -> (all V (ssList(V) -> (U != V <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	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.81/1.08	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> U != W | U = nil | (all Y (ssItem(Y) -> (all Z (ssList(Z) -> (all X1 (ssList(X1) -> cons(Y,nil) != W | (exists X2 (ssItem(X2) & memberP(Z,X2) & lt(Y,X2))) | (exists X3 (ssItem(X3) & lt(X3,Y) & memberP(X1,X3))) | app(app(Z,W),X1) != X)))))) & (W != nil | nil != X) | X != V | V != nil)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.08	
0.81/1.08	============================== end of process non-clausal formulas ===
0.81/1.08	
0.81/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.81/1.08	
0.81/1.08	============================== PREDICATE ELIMINATION =================
0.81/1.08	88 -ssList(A) | -duplicatefreeP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	89 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
0.81/1.10	90 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(13)].
0.81/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 | B != A.  [resolve(88,b,89,a)].
0.81/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) | C != B | -ssItem(A).  [resolve(88,b,90,b)].
0.81/1.10	91 -ssList(A) | duplicatefreeP(A) | ssItem(f25(A)) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | ssItem(f25(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(91,b,88,b)].
0.81/1.10	92 -ssList(A) | duplicatefreeP(A) | ssItem(f26(A)) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | ssItem(f26(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(92,b,88,b)].
0.81/1.10	93 -ssList(A) | duplicatefreeP(A) | ssList(f27(A)) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | ssList(f27(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(93,b,88,b)].
0.81/1.10	94 -ssList(A) | duplicatefreeP(A) | ssList(f28(A)) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | ssList(f28(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(94,b,88,b)].
0.81/1.10	95 -ssList(A) | duplicatefreeP(A) | ssList(f29(A)) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | ssList(f29(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(95,b,88,b)].
0.81/1.10	96 -ssList(A) | duplicatefreeP(A) | app(app(f27(A),cons(f25(A),f28(A))),cons(f26(A),f29(A))) = A # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | app(app(f27(A),cons(f25(A),f28(A))),cons(f26(A),f29(A))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(96,b,88,b)].
0.81/1.10	97 -ssList(A) | duplicatefreeP(A) | f26(A) = f25(A) # label(ax13) # label(axiom).  [clausify(66)].
0.81/1.10	Derived: -ssList(A) | f26(A) = f25(A) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B.  [resolve(97,b,88,b)].
0.81/1.10	98 -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.81/1.10	99 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(14)].
0.81/1.10	100 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.81/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(98,b,99,b)].
0.81/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(98,b,100,a)].
0.81/1.10	101 -ssList(A) | totalorderP(A) | ssItem(f40(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.81/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(101,b,98,b)].
0.81/1.10	102 -ssList(A) | totalorderP(A) | ssItem(f41(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.81/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(102,b,98,b)].
0.81/1.10	103 -ssList(A) | totalorderP(A) | ssList(f42(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.86/1.14	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(103,b,98,b)].
0.86/1.14	104 -ssList(A) | totalorderP(A) | ssList(f43(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.86/1.14	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(104,b,98,b)].
0.86/1.14	105 -ssList(A) | totalorderP(A) | ssList(f44(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.86/1.14	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(105,b,98,b)].
0.86/1.14	106 -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.86/1.14	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(106,b,98,b)].
0.86/1.14	107 -ssList(A) | totalorderP(A) | -leq(f41(A),f40(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.86/1.14	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(107,b,98,b)].
0.86/1.14	108 -ssList(A) | totalorderP(A) | -leq(f40(A),f41(A)) # label(ax9) # label(axiom).  [clausify(78)].
0.86/1.14	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(108,b,98,b)].
0.86/1.14	109 -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.86/1.14	110 -ssList(A) | ssItem(f4(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	111 -ssList(A) | ssItem(f5(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	112 -ssList(A) | ssList(f6(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	113 -ssList(A) | ssList(f7(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	114 -ssList(A) | ssList(f8(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	115 -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.86/1.14	116 -ssList(A) | -lt(f5(A),f4(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	117 -ssList(A) | -lt(f4(A),f5(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(25)].
0.86/1.14	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(109,j,110,c)].
0.86/1.14	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(109,j,111,c)].
0.86/1.14	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(109,j,112,c)].
0.86/1.14	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(109,j,113,c)].
0.86/1.14	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(109,j,114,c)].
0.86/1.14	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(109,j,115,c)].
0.86/1.14	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(109,j,116,c)].
0.89/1.19	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(109,j,117,c)].
0.89/1.19	118 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.89/1.19	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(118,a,109,j)].
0.89/1.19	119 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(60)].
0.89/1.19	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(119,b,109,j)].
0.89/1.19	120 -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.89/1.19	121 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
0.89/1.19	122 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(31)].
0.89/1.19	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(120,b,121,a)].
0.89/1.19	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(120,b,122,b)].
0.89/1.19	123 -ssList(A) | equalelemsP(A) | ssItem(f36(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(123,b,120,b)].
0.89/1.19	124 -ssList(A) | equalelemsP(A) | ssItem(f37(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(124,b,120,b)].
0.89/1.19	125 -ssList(A) | equalelemsP(A) | ssList(f38(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(125,b,120,b)].
0.89/1.19	126 -ssList(A) | equalelemsP(A) | ssList(f39(A)) # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(126,b,120,b)].
0.89/1.19	127 -ssList(A) | equalelemsP(A) | app(f38(A),cons(f36(A),cons(f37(A),f39(A)))) = A # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(127,b,120,b)].
0.89/1.19	128 -ssList(A) | equalelemsP(A) | f37(A) != f36(A) # label(ax14) # label(axiom).  [clausify(75)].
0.89/1.19	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(128,b,120,b)].
0.89/1.19	129 -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.89/1.19	130 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(44)].
0.89/1.19	131 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.89/1.19	132 -ssList(A) | ssItem(f17(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.89/1.19	133 -ssList(A) | ssItem(f18(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.89/1.19	134 -ssList(A) | ssList(f19(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.89/1.19	135 -ssList(A) | ssList(f20(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.89/1.19	136 -ssList(A) | ssList(f21(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
0.89/1.19	137 -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)].
2.89/3.18	138 -ssList(A) | leq(f18(A),f17(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
2.89/3.18	139 -ssList(A) | leq(f17(A),f18(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(53)].
2.89/3.18	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(129,j,130,b)].
2.89/3.18	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(129,j,131,a)].
2.89/3.18	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(129,j,132,c)].
2.89/3.18	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(129,j,133,c)].
2.89/3.18	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(129,j,134,c)].
2.89/3.18	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(129,j,135,c)].
2.89/3.18	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(129,j,136,c)].
2.89/3.18	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(129,j,137,c)].
2.89/3.18	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(129,j,138,c)].
2.89/3.18	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(129,j,139,c)].
2.89/3.18	140 -ssItem(A) | -ssItem(B) | neq(A,B) | B = A # label(ax1) # label(axiom).  [clausify(52)].
2.89/3.18	141 -ssItem(A) | -ssItem(B) | -neq(A,B) | B != A # label(ax1) # label(axiom).  [clausify(52)].
2.89/3.18	142 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # label(axiom).  [clausify(85)].
2.89/3.18	143 -ssList(A) | -ssList(B) | B != A | -neq(A,B) # label(ax15) # label(axiom).  [clausify(85)].
2.89/3.18	
2.89/3.18	============================== end predicate elimination =============
2.89/3.18	
2.89/3.18	Auto_denials:  (non-Horn, no changes).
2.89/3.18	
2.89/3.18	Term ordering decisions:
2.89/3.18	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. cons=1. app=1. f14=1. f15=1. f16=1. f22=1. f23=1. f24=1. hd=1. tl=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f17=1. f18=1. f19=1. f20=1. f21=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1.
2.89/3.18	
2.89/3.18	============================== end of process initial clauses ========
2.89/3.18	
2.89/3.18	============================== CLAUSES FOR SEARCH ====================
2.89/3.18	
2.89/3.18	============================== end of clauses for search =============
2.89/3.18	
2.89/3.18	============================== SEARCH ================================
2.89/3.18	
2.89/3.18	% Starting search at 0.54 seconds.
2.89/3.18	
2.89/3.18	Low Water (keep): wt=43.000, iters=3905
2.89/3.18	
2.89/3.18	Low Water (keep): wt=33.000, iters=3612
2.89/3.18	
2.89/3.18	Low Water (keep): wt=31.000, iters=4068
2.89/3.18	
2.89/3.18	Low Water (keep): wt=28.000, iters=3775
2.89/3.18	
2.89/3.18	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 195 (0.00 of 1.21 sec).
2.89/3.18	
2.89/3.18	Low Water (keep): wt=26.000, iters=3398
2.89/3.18	
2.89/3.18	Low Water (keep): wt=23.000, iters=3434
2.89/3.18	
2.89/3.18	Low Water (keep): wt=22.000, iters=3362
2.89/3.18	
2.89/3.18	Low Water (keep): wt=21.000, iters=3402
2.89/3.18	
2.89/3.18	Low Water (keep): wt=20.000, iters=3381
2.89/3.18	
2.89/3.18	Low Water (keep): wt=19.000, iters=3436
14.18/14.48	
14.18/14.48	Low Water (keep): wt=18.000, iters=3444
14.18/14.48	
14.18/14.48	Low Water (keep): wt=17.000, iters=3412
14.18/14.48	
14.18/14.48	Low Water (keep): wt=16.000, iters=3389
14.18/14.48	
14.18/14.48	Low Water (keep): wt=15.000, iters=3409
14.18/14.48	
14.18/14.48	Low Water (keep): wt=14.000, iters=3436
14.18/14.48	
14.18/14.48	Low Water (displace): id=3518, wt=43.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=3554, wt=41.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=2673, wt=40.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=3596, wt=39.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=2709, wt=38.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=3602, wt=37.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=2751, wt=36.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=2757, wt=34.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=3047, wt=33.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=3062, wt=31.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=4148, wt=30.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=5380, wt=29.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=4187, wt=28.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=6160, wt=27.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=14793, wt=13.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=14801, wt=12.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=14806, wt=11.000
14.18/14.48	
14.18/14.48	Low Water (keep): wt=13.000, iters=3346
14.18/14.48	
14.18/14.48	Low Water (displace): id=16730, wt=10.000
14.18/14.48	
14.18/14.48	Low Water (keep): wt=12.000, iters=3336
14.18/14.48	
14.18/14.48	Low Water (keep): wt=11.000, iters=3368
14.18/14.48	
14.18/14.48	Low Water (displace): id=22557, wt=9.000
14.18/14.48	
14.18/14.48	Low Water (keep): wt=10.000, iters=3368
14.18/14.48	
14.18/14.48	Low Water (displace): id=26246, wt=8.000
14.18/14.48	
14.18/14.48	Low Water (displace): id=26365, wt=7.000
14.18/14.48	
14.18/14.48	Low Water (keep): wt=9.000, iters=3650
14.18/14.48	
14.18/14.48	============================== PROOF =================================
14.18/14.48	% SZS status Theorem
14.18/14.48	% SZS output start Refutation
14.18/14.48	
14.18/14.48	% Proof 1 at 13.23 (+ 0.20) seconds.
14.18/14.48	% Length of proof is 26.
14.18/14.48	% Level of proof is 6.
14.18/14.48	% Maximum clause weight is 12.000.
14.18/14.48	% Given clauses 3318.
14.18/14.48	
14.18/14.48	37 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
14.18/14.48	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].
14.18/14.48	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> U != W | U = nil | (all Y (ssItem(Y) -> (all Z (ssList(Z) -> (all X1 (ssList(X1) -> cons(Y,nil) != W | (exists X2 (ssItem(X2) & memberP(Z,X2) & lt(Y,X2))) | (exists X3 (ssItem(X3) & lt(X3,Y) & memberP(X1,X3))) | app(app(Z,W),X1) != X)))))) & (W != nil | nil != X) | X != V | V != nil)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
14.18/14.48	192 -ssList(A) | -ssList(B) | ssList(app(A,B)) # label(ax26) # label(axiom).  [clausify(37)].
14.18/14.48	209 -ssList(A) | -ssList(B) | app(A,B) != nil | nil = A # label(ax83) # label(axiom).  [clausify(45)].
14.18/14.48	210 -ssList(A) | -ssList(B) | app(A,B) != nil | nil = B # label(ax83) # label(axiom).  [clausify(45)].
14.18/14.48	277 ssList(c3) # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	281 c5 = c3 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	282 nil != c3 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	283 c3 != nil.  [copy(282),flip(a)].
14.18/14.48	286 ssList(c8) | nil = c5 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	287 ssList(c8).  [copy(286),rewrite([281(4)]),flip(b),unit_del(b,283)].
14.18/14.48	288 ssList(c9) | nil = c5 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	289 ssList(c9).  [copy(288),rewrite([281(4)]),flip(b),unit_del(b,283)].
14.18/14.48	297 app(app(c8,c5),c9) = c6 | nil = c5 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	298 app(app(c8,c3),c9) = c6.  [copy(297),rewrite([281(2),281(9)]),flip(b),unit_del(b,283)].
14.18/14.48	300 c6 = c4 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	301 nil = c4 # label(co1) # label(negated_conjecture).  [clausify(87)].
14.18/14.48	302 c4 = nil.  [copy(301),flip(a)].
14.18/14.48	462 app(app(c8,c3),c9) = nil.  [back_rewrite(298),rewrite([300(6),302(6)])].
14.18/14.48	1687 -ssList(A) | app(A,c3) != nil.  [resolve(277,a,210,b),flip(c),unit_del(c,283)].
14.18/14.48	1697 -ssList(A) | ssList(app(A,c3)).  [resolve(277,a,192,b)].
14.18/14.48	7106 app(c8,c3) != nil.  [resolve(1687,a,287,a)].
14.18/14.48	19381 ssList(app(c8,c3)).  [resolve(1697,a,287,a)].
14.18/14.48	19498 -ssList(A) | app(app(c8,c3),A) != nil.  [resolve(19381,a,209,a),flip(c),unit_del(c,7106)].
14.18/14.48	53181 $F.  [resolve(19498,a,289,a),rewrite([462(5)]),xx(a)].
14.18/14.48	
14.18/14.48	% SZS output end Refutation
14.18/14.48	============================== end of proof ==========================
14.18/14.48	
14.18/14.48	============================== STATISTICS ============================
14.18/14.48	
14.18/14.48	Given=3318. Generated=326656. Kept=52982. proofs=1.
14.18/14.48	Usable=3033. Sos=9998. Demods=591. Limbo=391, Disabled=39817. Hints=0.
14.18/14.48	Megabytes=42.60.
14.18/14.48	User_CPU=13.23, System_CPU=0.20, Wall_clock=13.
14.18/14.48	
14.18/14.48	============================== end of statistics =====================
14.18/14.48	
14.18/14.48	============================== end of search =========================
14.18/14.48	
14.18/14.48	THEOREM PROVED
14.18/14.48	% SZS status Theorem
14.18/14.48	
14.18/14.48	Exiting with 1 proof.
14.18/14.48	
14.18/14.48	Process 19508 exit (max_proofs) Thu Aug 29 09:40:50 2019
14.18/14.48	Prover9 interrupted
14.18/14.49	EOF