0.13/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer   : n004.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   : 960
0.14/0.34	% DateTime   : Thu Jul  2 08:08:28 EDT 2020
0.14/0.34	% CPUTime    : 
0.79/1.31	============================== Prover9 ===============================
0.79/1.31	Prover9 (32) version 2009-11A, November 2009.
0.79/1.31	Process 3851 was started by sandbox on n004.cluster.edu,
0.79/1.31	Thu Jul  2 08:08:29 2020
0.79/1.31	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_3698_n004.cluster.edu".
0.79/1.31	============================== end of head ===========================
0.79/1.31	
0.79/1.31	============================== INPUT =================================
0.79/1.31	
0.79/1.31	% Reading from file /tmp/Prover9_3698_n004.cluster.edu
0.79/1.31	
0.79/1.31	set(prolog_style_variables).
0.79/1.31	set(auto2).
0.79/1.31	    % set(auto2) -> set(auto).
0.79/1.31	    % set(auto) -> set(auto_inference).
0.79/1.31	    % set(auto) -> set(auto_setup).
0.79/1.31	    % set(auto_setup) -> set(predicate_elim).
0.79/1.31	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/1.31	    % set(auto) -> set(auto_limits).
0.79/1.31	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/1.31	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/1.31	    % set(auto) -> set(auto_denials).
0.79/1.31	    % set(auto) -> set(auto_process).
0.79/1.31	    % set(auto2) -> assign(new_constants, 1).
0.79/1.31	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/1.31	    % set(auto2) -> assign(max_weight, "200.000").
0.79/1.31	    % set(auto2) -> assign(max_hours, 1).
0.79/1.31	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/1.31	    % set(auto2) -> assign(max_seconds, 0).
0.79/1.31	    % set(auto2) -> assign(max_minutes, 5).
0.79/1.31	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/1.31	    % set(auto2) -> set(sort_initial_sos).
0.79/1.31	    % set(auto2) -> assign(sos_limit, -1).
0.79/1.31	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/1.31	    % set(auto2) -> assign(max_megs, 400).
0.79/1.31	    % set(auto2) -> assign(stats, some).
0.79/1.31	    % set(auto2) -> clear(echo_input).
0.79/1.31	    % set(auto2) -> set(quiet).
0.79/1.31	    % set(auto2) -> clear(print_initial_clauses).
0.79/1.31	    % set(auto2) -> clear(print_given).
0.79/1.31	assign(lrs_ticks,-1).
0.79/1.31	assign(sos_limit,10000).
0.79/1.31	assign(order,kbo).
0.79/1.31	set(lex_order_vars).
0.79/1.31	clear(print_given).
0.79/1.31	
0.79/1.31	% formulas(sos).  % not echoed (96 formulas)
0.79/1.31	
0.79/1.31	============================== end of input ==========================
0.79/1.31	
0.79/1.31	% From the command line: assign(max_seconds, 960).
0.79/1.31	
0.79/1.31	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/1.31	
0.79/1.31	% Formulas that are not ordinary clauses:
0.79/1.31	1 (all U (ssList(U) -> (rearsegP(nil,U) <-> nil = U))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	2 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	3 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	4 (all U (ssList(U) -> (all V (ssList(V) -> (V != U <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	5 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	6 (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.79/1.31	7 (all U (ssList(U) -> ((exists V (U = cons(V,nil) & ssItem(V))) <-> singletonP(U)))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	8 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	9 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W ((exists X (ssList(X) & app(app(W,V),X) = U)) & ssList(W))) <-> segmentP(U,V)))))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	10 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	11 (all U (ssList(U) -> (strictorderP(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(W,V) | lt(V,W))))))))))))))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	12 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	13 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	14 (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.79/1.31	15 (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.79/1.31	16 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(U,V) & segmentP(V,U) -> U = V))))) # label(ax54) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	17 (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.79/1.31	18 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (frontsegP(cons(U,W),cons(V,X)) <-> U = V & frontsegP(W,X)))))))))) # label(ax44) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	19 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	20 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (U = app(X,cons(V,cons(W,Y))) -> W = V))))))))) <-> equalelemsP(U)))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	21 (exists U (ssItem(U) & (exists V (ssItem(V) & U != V)))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	22 (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.79/1.31	23 (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.79/1.31	24 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(V,U) <-> gt(U,V)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	25 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	26 (all U (ssList(U) -> U = app(nil,U))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	27 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(W,V) = app(U,V) -> W = U))))))) # label(ax79) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	28 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> cons(W,app(V,U)) = app(cons(W,V),U))))))) # label(ax27) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	29 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	30 (all U (ssList(U) -> (cyclefreeP(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(V,W) & leq(W,V)))))))))))))))) # label(ax8) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	31 (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.79/1.31	32 (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.79/1.31	33 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	34 (all U (ssList(U) -> (all V (ssItem(V) -> (memberP(U,V) <-> (exists W ((exists X (U = app(W,cons(V,X)) & ssList(X))) & ssList(W)))))))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	35 (all U (ssList(U) -> (U = nil <-> frontsegP(nil,U)))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	36 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(X,V) = cons(W,U) -> V = U & X = W))))))))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	37 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	38 (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)) -> leq(V,W)))))))))))) <-> totalorderedP(U)))) # label(ax11) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	39 (all U (ssItem(U) -> (all V (ssList(V) -> (totalorderedP(cons(U,V)) <-> nil != V & leq(U,hd(V)) & totalorderedP(V) | V = nil))))) # label(ax67) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	40 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	41 (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.79/1.31	42 (all U (ssList(U) -> (exists V (ssList(V) & (exists W (ssItem(W) & cons(W,V) = U)))) | U = nil)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	43 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	44 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (lt(V,W) & lt(U,V) -> lt(U,W)))))))) # label(ax34) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	45 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(U,V) & rearsegP(V,U) -> U = V))))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	46 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	47 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) -> lt(U,V) | U = V))))) # label(ax92) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	48 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	49 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	50 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> app(U,app(V,W)) = app(app(U,V),W))))))) # label(ax82) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	51 (all U (ssList(U) -> (segmentP(nil,U) <-> nil = U))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	52 (all U (ssList(U) -> (all V (ssList(V) -> (V != nil & U != nil & hd(U) = hd(V) & tl(U) = tl(V) -> V = U))))) # label(ax77) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	53 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	54 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	55 (all U (ssList(U) -> (all V (ssItem(V) -> U != cons(V,U))))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	56 (all U (ssList(U) -> (nil != U -> (exists V (ssItem(V) & hd(U) = V))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	57 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	58 (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.79/1.31	59 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (U = app(V,W) & ssList(W))) <-> frontsegP(U,V)))))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	60 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (gt(V,W) & gt(U,V) -> gt(U,W)))))))) # label(ax95) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	61 (all U (ssList(U) -> (all V (ssList(V) -> (U != nil -> hd(app(U,V)) = hd(U)))))) # label(ax85) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	62 (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.79/1.31	63 (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.79/1.31	64 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(V,W) = app(V,U) -> W = U))))))) # label(ax80) # label(axiom) # label(non_clause).  [assumption].
0.79/1.31	65 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (ssList(W) & app(W,V) = U)) <-> rearsegP(U,V)))))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	66 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	67 (all U (ssItem(U) -> (all V (ssItem(V) -> (U != V <-> neq(U,V)))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	68 (all U (ssList(U) -> U = app(U,nil))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	69 (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.79/1.32	70 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> tl(app(U,V)) = app(tl(U),V)))))) # label(ax86) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	71 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	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) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> leq(W,V) | leq(V,W)))))))))))) <-> totalorderP(U)))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	73 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	74 (all U (ssList(U) -> (nil != U -> U = cons(hd(U),tl(U))))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	75 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	76 (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.79/1.32	77 (all U (ssItem(U) -> (all V (ssList(V) -> (strictorderedP(cons(U,V)) <-> V != nil & lt(U,hd(V)) & strictorderedP(V) | nil = V))))) # label(ax70) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	78 (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(V,W)))))))))))) <-> strictorderedP(U)))) # label(ax12) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	79 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) <-> U != V & leq(U,V)))))) # label(ax93) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	80 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	81 (all U (ssItem(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (memberP(W,U) | memberP(V,U) <-> memberP(app(V,W),U)))))))) # label(ax36) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	82 (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.79/1.32	83 (all U (ssList(U) -> (all V (ssItem(V) -> nil != cons(V,U))))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	84 (all U (ssList(U) -> (U != nil -> (exists V (tl(U) = V & ssList(V)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	85 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (U = V | memberP(W,U) <-> memberP(cons(V,W),U)))))))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	86 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.79/1.32	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> X != V | W != U | (all X3 (ssItem(X3) -> -memberP(X,X3) | (exists X4 (X4 != X3 & memberP(X,X4) & leq(X3,X4) & ssItem(X4))) | W != cons(X3,nil))) & (nil != X | nil != W) | (exists Y (ssItem(Y) & (exists Z ((exists X1 ((all X2 (ssItem(X2) -> -memberP(Z,X2) | -lt(Y,X2) | leq(Y,X2) | -memberP(X1,X2))) & app(app(Z,cons(Y,nil)),X1) = U & ssList(X1))) & ssList(Z))))) | nil = U)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.79/1.32	
0.79/1.32	============================== end of process non-clausal formulas ===
0.79/1.32	
0.79/1.32	============================== PROCESS INITIAL CLAUSES ===============
0.79/1.32	
0.79/1.32	============================== PREDICATE ELIMINATION =================
0.79/1.32	88 -ssList(A) | -ssList(B) | B != A | -neq(A,B) # label(ax15) # label(axiom).  [clausify(4)].
0.79/1.33	89 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # label(axiom).  [clausify(4)].
0.79/1.33	90 -ssItem(A) | -ssItem(B) | B = A | neq(A,B) # label(ax1) # label(axiom).  [clausify(67)].
0.79/1.33	91 -ssItem(A) | -ssItem(B) | B != A | -neq(A,B) # label(ax1) # label(axiom).  [clausify(67)].
0.79/1.33	92 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	93 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
0.79/1.33	94 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(19)].
0.79/1.33	95 -ssList(A) | ssItem(f9(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	96 -ssList(A) | ssItem(f10(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	97 -ssList(A) | ssList(f11(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	98 -ssList(A) | ssList(f12(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	99 -ssList(A) | app(f11(A),cons(f9(A),cons(f10(A),f12(A)))) = A | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	100 -ssList(A) | f10(A) != f9(A) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(20)].
0.79/1.33	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(92,h,93,a)].
0.79/1.33	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(92,h,94,b)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f9(A)).  [resolve(92,h,95,c)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f10(A)).  [resolve(92,h,96,c)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f11(A)).  [resolve(92,h,97,c)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f12(A)).  [resolve(92,h,98,c)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | app(f11(A),cons(f9(A),cons(f10(A),f12(A)))) = A.  [resolve(92,h,99,c)].
0.79/1.33	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | f10(A) != f9(A).  [resolve(92,h,100,c)].
0.79/1.33	101 -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) | -totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	102 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.79/1.33	103 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(66)].
0.79/1.33	104 -ssList(A) | ssItem(f35(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	105 -ssList(A) | ssItem(f36(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	106 -ssList(A) | ssList(f37(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	107 -ssList(A) | ssList(f38(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	108 -ssList(A) | ssList(f39(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	109 -ssList(A) | app(app(f37(A),cons(f35(A),f38(A))),cons(f36(A),f39(A))) = A | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	110 -ssList(A) | -leq(f36(A),f35(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	111 -ssList(A) | -leq(f35(A),f36(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(72)].
0.79/1.33	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(101,j,102,a)].
0.79/1.33	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(101,j,103,b)].
0.85/1.38	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(f35(A)).  [resolve(101,j,104,c)].
0.85/1.38	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(f36(A)).  [resolve(101,j,105,c)].
0.85/1.38	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(f37(A)).  [resolve(101,j,106,c)].
0.85/1.38	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(f38(A)).  [resolve(101,j,107,c)].
0.85/1.38	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(f39(A)).  [resolve(101,j,108,c)].
0.85/1.38	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(f37(A),cons(f35(A),f38(A))),cons(f36(A),f39(A))) = A.  [resolve(101,j,109,c)].
0.85/1.38	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(f36(A),f35(A)).  [resolve(101,j,110,c)].
0.85/1.38	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(f35(A),f36(A)).  [resolve(101,j,111,c)].
0.85/1.38	112 -ssList(A) | strictorderP(A) | ssItem(f4(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	113 -ssList(A) | -strictorderP(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) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | ssItem(f4(A)) | -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).  [resolve(112,b,113,b)].
0.85/1.38	114 -ssList(A) | strictorderP(A) | ssItem(f5(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | ssItem(f5(A)) | -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).  [resolve(114,b,113,b)].
0.85/1.38	115 -ssList(A) | strictorderP(A) | ssList(f6(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | ssList(f6(A)) | -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).  [resolve(115,b,113,b)].
0.85/1.38	116 -ssList(A) | strictorderP(A) | ssList(f7(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | ssList(f7(A)) | -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).  [resolve(116,b,113,b)].
0.85/1.38	117 -ssList(A) | strictorderP(A) | ssList(f8(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | ssList(f8(A)) | -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).  [resolve(117,b,113,b)].
0.85/1.38	118 -ssList(A) | strictorderP(A) | app(app(f6(A),cons(f4(A),f7(A))),cons(f5(A),f8(A))) = A # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | app(app(f6(A),cons(f4(A),f7(A))),cons(f5(A),f8(A))) = A | -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).  [resolve(118,b,113,b)].
0.85/1.38	119 -ssList(A) | strictorderP(A) | -lt(f5(A),f4(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.38	Derived: -ssList(A) | -lt(f5(A),f4(A)) | -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).  [resolve(119,b,113,b)].
0.85/1.43	120 -ssList(A) | strictorderP(A) | -lt(f4(A),f5(A)) # label(ax10) # label(axiom).  [clausify(11)].
0.85/1.43	Derived: -ssList(A) | -lt(f4(A),f5(A)) | -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).  [resolve(120,b,113,b)].
0.85/1.43	121 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(33)].
0.85/1.43	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(121,b,113,b)].
0.85/1.43	122 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.85/1.43	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(122,a,113,b)].
0.85/1.43	123 -ssList(A) | -cyclefreeP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	124 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.85/1.43	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | -leq(A,B) | -leq(B,A).  [resolve(123,b,124,a)].
0.85/1.43	125 -ssList(A) | cyclefreeP(A) | ssItem(f13(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | ssItem(f13(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(125,b,123,b)].
0.85/1.43	126 -ssList(A) | cyclefreeP(A) | ssItem(f14(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | ssItem(f14(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(126,b,123,b)].
0.85/1.43	127 -ssList(A) | cyclefreeP(A) | ssList(f15(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | ssList(f15(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(127,b,123,b)].
0.85/1.43	128 -ssList(A) | cyclefreeP(A) | ssList(f16(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | ssList(f16(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(128,b,123,b)].
0.85/1.43	129 -ssList(A) | cyclefreeP(A) | ssList(f17(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | ssList(f17(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(129,b,123,b)].
0.85/1.43	130 -ssList(A) | cyclefreeP(A) | app(app(f15(A),cons(f13(A),f16(A))),cons(f14(A),f17(A))) = A # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | app(app(f15(A),cons(f13(A),f16(A))),cons(f14(A),f17(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(B,C) | -leq(C,B).  [resolve(130,b,123,b)].
0.85/1.43	131 -ssList(A) | cyclefreeP(A) | leq(f13(A),f14(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | leq(f13(A),f14(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(131,b,123,b)].
0.85/1.43	132 -ssList(A) | cyclefreeP(A) | leq(f14(A),f13(A)) # label(ax8) # label(axiom).  [clausify(30)].
0.85/1.43	Derived: -ssList(A) | leq(f14(A),f13(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(B,C) | -leq(C,B).  [resolve(132,b,123,b)].
0.85/1.43	133 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(43)].
0.85/1.43	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) | -leq(B,C) | -leq(C,B).  [resolve(133,b,123,b)].
2.53/3.00	134 -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(62)].
2.53/3.00	135 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(46)].
2.53/3.00	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(134,b,135,b)].
2.53/3.00	136 -ssList(A) | duplicatefreeP(A) | ssItem(f29(A)) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | ssItem(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(136,b,134,b)].
2.53/3.00	137 -ssList(A) | duplicatefreeP(A) | ssItem(f30(A)) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | ssItem(f30(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(137,b,134,b)].
2.53/3.00	138 -ssList(A) | duplicatefreeP(A) | ssList(f31(A)) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | ssList(f31(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(138,b,134,b)].
2.53/3.00	139 -ssList(A) | duplicatefreeP(A) | ssList(f32(A)) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | ssList(f32(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(139,b,134,b)].
2.53/3.00	140 -ssList(A) | duplicatefreeP(A) | ssList(f33(A)) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | ssList(f33(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(140,b,134,b)].
2.53/3.00	141 -ssList(A) | duplicatefreeP(A) | app(app(f31(A),cons(f29(A),f32(A))),cons(f30(A),f33(A))) = A # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | app(app(f31(A),cons(f29(A),f32(A))),cons(f30(A),f33(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(141,b,134,b)].
2.53/3.00	142 -ssList(A) | duplicatefreeP(A) | f30(A) = f29(A) # label(ax13) # label(axiom).  [clausify(62)].
2.53/3.00	Derived: -ssList(A) | f30(A) = 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(142,b,134,b)].
2.53/3.00	143 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
2.53/3.00	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(143,a,134,b)].
2.53/3.00	
2.53/3.00	============================== end predicate elimination =============
2.53/3.00	
2.53/3.00	Auto_denials:  (non-Horn, no changes).
2.53/3.00	
2.53/3.00	Term ordering decisions:
2.53/3.00	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. cons=1. app=1. f2=1. f3=1. f18=1. f19=1. f28=1. f34=1. hd=1. tl=1. f1=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f29=1. f30=1. f31=1. f32=1. f33=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. f46=1.
2.53/3.00	
2.53/3.00	============================== end of process initial clauses ========
2.53/3.00	
2.53/3.00	============================== CLAUSES FOR SEARCH ====================
2.53/3.00	
2.53/3.00	============================== end of clauses for search =============
2.53/3.00	
2.53/3.00	============================== SEARCH ================================
2.53/3.00	
2.53/3.00	% Starting search at 0.40 seconds.
2.53/3.00	
2.53/3.00	Low Water (keep): wt=40.000, iters=3365
2.53/3.00	
2.53/3.00	Low Water (keep): wt=33.000, iters=3357
2.53/3.00	
2.53/3.00	Low Water (keep): wt=31.000, iters=3462
2.53/3.00	
2.53/3.00	Low Water (keep): wt=29.000, iters=3488
2.53/3.00	
2.53/3.00	Low Water (keep): wt=28.000, iters=3406
2.53/3.00	
2.53/3.00	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 27 (0.00 of 0.99 sec).
2.53/3.00	
2.53/3.00	Low Water (keep): wt=27.000, iters=3578
2.53/3.00	
2.53/3.00	Low Water (keep): wt=26.000, iters=3337
2.53/3.00	
2.53/3.00	Low Water (keep): wt=23.000, iters=3399
52.52/53.07	
52.52/53.07	Low Water (keep): wt=22.000, iters=3367
52.52/53.07	
52.52/53.07	Low Water (keep): wt=21.000, iters=3435
52.52/53.07	
52.52/53.07	Low Water (keep): wt=20.000, iters=3384
52.52/53.07	
52.52/53.07	Low Water (keep): wt=19.000, iters=3387
52.52/53.07	
52.52/53.07	Low Water (keep): wt=18.000, iters=3402
52.52/53.07	
52.52/53.07	Low Water (keep): wt=17.000, iters=3361
52.52/53.07	
52.52/53.07	Low Water (keep): wt=16.000, iters=3354
52.52/53.07	
52.52/53.07	Low Water (keep): wt=15.000, iters=3381
52.52/53.07	
52.52/53.07	Low Water (displace): id=3070, wt=43.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3096, wt=41.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3136, wt=39.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3084, wt=38.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3154, wt=37.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3122, wt=36.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=3152, wt=34.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=4250, wt=33.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=13693, wt=13.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=13700, wt=12.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=13709, wt=11.000
52.52/53.07	
52.52/53.07	Low Water (keep): wt=14.000, iters=3333
52.52/53.07	
52.52/53.07	Low Water (displace): id=15256, wt=10.000
52.52/53.07	
52.52/53.07	Low Water (displace): id=18958, wt=9.000
52.52/53.07	
52.52/53.07	Low Water (keep): wt=13.000, iters=3398
52.52/53.07	
52.52/53.07	Low Water (keep): wt=12.000, iters=3340
52.52/53.07	
52.52/53.07	Low Water (displace): id=24182, wt=8.000
52.52/53.07	
52.52/53.07	Low Water (keep): wt=11.000, iters=3336
52.52/53.07	
52.52/53.07	Low Water (displace): id=26573, wt=7.000
52.52/53.07	
52.52/53.07	Low Water (keep): wt=10.000, iters=3333
52.52/53.07	
52.52/53.07	Low Water (keep): wt=9.000, iters=3340
52.52/53.07	
52.52/53.07	============================== PROOF =================================
52.52/53.07	% SZS status Theorem
52.52/53.07	% SZS output start Refutation
52.52/53.07	
52.52/53.07	% Proof 1 at 50.39 (+ 1.36) seconds.
52.52/53.07	% Length of proof is 29.
52.52/53.07	% Level of proof is 7.
52.52/53.07	% Maximum clause weight is 21.000.
52.52/53.07	% Given clauses 11576.
52.52/53.07	
52.52/53.07	26 (all U (ssList(U) -> U = app(nil,U))) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
52.52/53.07	68 (all U (ssList(U) -> U = app(U,nil))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
52.52/53.07	80 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
52.52/53.07	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> X != V | W != U | (all X3 (ssItem(X3) -> -memberP(X,X3) | (exists X4 (X4 != X3 & memberP(X,X4) & leq(X3,X4) & ssItem(X4))) | W != cons(X3,nil))) & (nil != X | nil != W) | (exists Y (ssItem(Y) & (exists Z ((exists X1 ((all X2 (ssItem(X2) -> -memberP(Z,X2) | -lt(Y,X2) | leq(Y,X2) | -memberP(X1,X2))) & app(app(Z,cons(Y,nil)),X1) = U & ssList(X1))) & ssList(Z))))) | nil = U)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
52.52/53.07	164 ssList(nil) # label(ax17) # label(axiom).  [assumption].
52.52/53.07	178 -ssList(A) | app(nil,A) = A # label(ax28) # label(axiom).  [clausify(26)].
52.52/53.07	245 -ssList(A) | app(A,nil) = A # label(ax84) # label(axiom).  [clausify(68)].
52.52/53.07	276 -ssItem(A) | -memberP(nil,A) # label(ax38) # label(axiom).  [clausify(80)].
52.52/53.07	289 ssList(c3) # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	294 c5 = c3 # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	297 ssItem(c7) | c5 = nil # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	298 ssItem(c7) | c3 = nil.  [copy(297),rewrite([294(3)])].
52.52/53.07	309 cons(c7,nil) = c5 | c5 = nil # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	310 cons(c7,nil) = c3 | c3 = nil.  [copy(309),rewrite([294(4),294(6)])].
52.52/53.07	311 -ssItem(A) | ssItem(f46(A,B,C)) | app(app(B,cons(A,nil)),C) != c3 | -ssList(C) | -ssList(B) # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	312 -ssItem(A) | memberP(B,f46(A,B,C)) | app(app(B,cons(A,nil)),C) != c3 | -ssList(C) | -ssList(B) # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	316 nil != c3 # label(co1) # label(negated_conjecture).  [clausify(87)].
52.52/53.07	317 c3 != nil.  [copy(316),flip(a)].
52.52/53.07	476 -ssItem(A) | ssItem(f46(A,B,B)) | app(app(B,cons(A,nil)),B) != c3 | -ssList(B).  [factor(311,d,e)].
52.52/53.07	477 -ssItem(A) | memberP(B,f46(A,B,B)) | app(app(B,cons(A,nil)),B) != c3 | -ssList(B).  [factor(312,d,e)].
52.52/53.07	480 cons(c7,nil) = c3.  [back_unit_del(310),unit_del(b,317)].
52.52/53.07	483 ssItem(c7).  [back_unit_del(298),unit_del(b,317)].
52.52/53.07	1770 app(c3,nil) = c3.  [resolve(289,a,245,a)].
52.52/53.07	1801 app(nil,c3) = c3.  [resolve(289,a,178,a)].
52.52/53.07	4049 memberP(A,f46(c7,A,A)) | app(app(A,c3),A) != c3 | -ssList(A).  [resolve(483,a,477,a),rewrite([480(6)])].
52.52/53.07	4050 ssItem(f46(c7,A,A)) | app(app(A,c3),A) != c3 | -ssList(A).  [resolve(483,a,476,a),rewrite([480(6)])].
52.52/53.07	224970 memberP(nil,f46(c7,nil,nil)).  [resolve(4049,c,164,a),rewrite([1801(9),1770(9)]),xx(b)].
52.52/53.07	224971 -ssItem(f46(c7,nil,nil)).  [resolve(224970,a,276,b)].
52.52/53.07	224974 $F.  [resolve(4050,c,164,a),rewrite([1801(8),1770(8)]),xx(b),unit_del(a,224971)].
52.52/53.07	
52.52/53.07	% SZS output end Refutation
52.52/53.07	============================== end of proof ==========================
52.52/53.07	
52.52/53.07	============================== STATISTICS ============================
52.52/53.07	
52.52/53.07	Given=11576. Generated=2598739. Kept=224765. proofs=1.
52.52/53.07	Usable=7781. Sos=9987. Demods=401. Limbo=0, Disabled=207252. Hints=0.
52.52/53.07	Megabytes=156.06.
52.52/53.07	User_CPU=50.39, System_CPU=1.36, Wall_clock=52.
52.52/53.07	
52.52/53.07	============================== end of statistics =====================
52.52/53.07	
52.52/53.07	============================== end of search =========================
52.52/53.07	
52.52/53.07	THEOREM PROVED
52.52/53.07	% SZS status Theorem
52.52/53.07	
52.52/53.07	Exiting with 1 proof.
52.52/53.07	
52.52/53.07	Process 3851 exit (max_proofs) Thu Jul  2 08:09:21 2020
52.52/53.07	Prover9 interrupted
52.52/53.07	EOF