0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.32	% Computer   : n006.cluster.edu
0.12/0.32	% Model      : x86_64 x86_64
0.12/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory     : 8042.1875MB
0.12/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1200
0.12/0.32	% DateTime   : Wed Jul 14 13:16:40 EDT 2021
0.12/0.32	% CPUTime    : 
0.40/1.08	============================== Prover9 ===============================
0.40/1.08	Prover9 (32) version 2009-11A, November 2009.
0.40/1.08	Process 27703 was started by sandbox on n006.cluster.edu,
0.40/1.08	Wed Jul 14 13:16:41 2021
0.40/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_27550_n006.cluster.edu".
0.40/1.08	============================== end of head ===========================
0.40/1.08	
0.40/1.08	============================== INPUT =================================
0.40/1.08	
0.40/1.08	% Reading from file /tmp/Prover9_27550_n006.cluster.edu
0.40/1.08	
0.40/1.08	set(prolog_style_variables).
0.40/1.08	set(auto2).
0.40/1.08	    % set(auto2) -> set(auto).
0.40/1.08	    % set(auto) -> set(auto_inference).
0.40/1.08	    % set(auto) -> set(auto_setup).
0.40/1.08	    % set(auto_setup) -> set(predicate_elim).
0.40/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.40/1.08	    % set(auto) -> set(auto_limits).
0.40/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.40/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.40/1.08	    % set(auto) -> set(auto_denials).
0.40/1.08	    % set(auto) -> set(auto_process).
0.40/1.08	    % set(auto2) -> assign(new_constants, 1).
0.40/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.40/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.40/1.08	    % set(auto2) -> assign(max_hours, 1).
0.40/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.40/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.40/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.40/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.40/1.08	    % set(auto2) -> set(sort_initial_sos).
0.40/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.40/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.40/1.08	    % set(auto2) -> assign(max_megs, 400).
0.40/1.08	    % set(auto2) -> assign(stats, some).
0.40/1.08	    % set(auto2) -> clear(echo_input).
0.40/1.08	    % set(auto2) -> set(quiet).
0.40/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.40/1.08	    % set(auto2) -> clear(print_given).
0.40/1.08	assign(lrs_ticks,-1).
0.40/1.08	assign(sos_limit,10000).
0.40/1.08	assign(order,kbo).
0.40/1.08	set(lex_order_vars).
0.40/1.08	clear(print_given).
0.40/1.08	
0.40/1.08	% formulas(sos).  % not echoed (96 formulas)
0.40/1.08	
0.40/1.08	============================== end of input ==========================
0.40/1.08	
0.40/1.08	% From the command line: assign(max_seconds, 1200).
0.40/1.08	
0.40/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.40/1.08	
0.40/1.08	% Formulas that are not ordinary clauses:
0.40/1.08	1 (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.40/1.08	2 (exists U ((exists V (ssItem(V) & V != U)) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	3 (all U (ssList(U) -> (all V (ssList(V) -> (nil != V & hd(U) = hd(V) & tl(U) = tl(V) & U != nil -> V = U))))) # label(ax77) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	4 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	5 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	6 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) & V != U <-> lt(U,V)))))) # label(ax93) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	7 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	8 (all U (ssItem(U) -> (all V (ssList(V) -> (strictorderedP(V) & lt(U,hd(V)) & V != nil | nil = V <-> strictorderedP(cons(U,V))))))) # label(ax70) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	9 (all U (ssList(U) -> (all V (ssItem(V) -> U != cons(V,U))))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	10 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	11 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	12 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(X,V) = cons(W,U) -> U = V & X = W))))))))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	13 (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.40/1.08	14 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (ssList(W) & app(V,W) = U)) <-> frontsegP(U,V)))))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	15 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	16 (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.40/1.08	17 (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.40/1.08	18 (all U (ssList(U) -> (nil = U <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	19 (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.40/1.08	20 (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) -> (U = app(app(X,cons(V,Y)),cons(W,Z)) -> leq(W,V) | leq(V,W))))))))))))))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	21 (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.40/1.08	22 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (lt(V,W) & leq(U,V) -> lt(U,W)))))))) # label(ax91) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	23 (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) & U = V))))))))) # label(ax44) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	24 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(V,U) & segmentP(U,V) -> U = V))))) # label(ax54) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	25 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (U = app(W,V) & ssList(W))) <-> rearsegP(U,V)))))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	26 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	27 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	28 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	29 (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.40/1.08	30 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	31 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(V,U) & rearsegP(U,V) -> V = U))))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	32 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	33 (all U (ssList(U) -> (exists V ((exists W (U = cons(W,V) & ssItem(W))) & ssList(V))) | nil = U)) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	34 (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.40/1.08	35 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	36 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	37 (all U (ssList(U) -> (nil = U <-> frontsegP(nil,U)))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	38 (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.40/1.08	39 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(W,V) = app(U,V) -> U = W))))))) # label(ax79) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	40 (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.40/1.08	41 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	42 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) = app(cons(V,nil),U))))) # label(ax81) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	43 (all U (ssList(U) -> (U != nil -> U = cons(hd(U),tl(U))))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	44 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W ((exists X (ssList(X) & U = app(app(W,V),X))) & ssList(W))) <-> segmentP(U,V)))))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	45 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	46 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	47 (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))) -> V = W))))))))) <-> equalelemsP(U)))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	48 (all U (ssList(U) -> (all V (ssList(V) -> (app(U,V) = nil <-> U = nil & nil = V))))) # label(ax83) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	49 (all U (ssList(U) -> (nil = U <-> segmentP(nil,U)))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	50 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	51 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & cons(V,nil) = U))))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	52 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	53 (all U (ssItem(U) -> (all V (ssList(V) -> (totalorderedP(V) & leq(U,hd(V)) & nil != V | nil = V <-> totalorderedP(cons(U,V))))))) # label(ax67) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	54 (all U (ssList(U) -> (nil != U -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	55 (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.40/1.08	56 (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.40/1.08	57 (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.40/1.08	58 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	59 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	60 (all U (ssList(U) -> (all V (ssList(V) -> (U != nil -> hd(U) = hd(app(U,V))))))) # label(ax85) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	61 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) & leq(V,U) -> V = U))))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	62 (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.40/1.08	63 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	64 (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.40/1.08	65 (all U (ssList(U) -> (all V (ssItem(V) -> nil != cons(V,U))))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	66 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (memberP(cons(V,W),U) <-> V = U | memberP(W,U)))))))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	67 (all U (ssList(U) -> (all V (ssList(V) -> (U != V <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	68 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	69 (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.40/1.08	70 (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.40/1.08	71 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(V,W) & leq(U,V) -> leq(U,W)))))))) # label(ax30) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	72 (all U (ssList(U) -> (all V (ssItem(V) -> ((exists W ((exists X (ssList(X) & app(W,cons(V,X)) = U)) & ssList(W))) <-> memberP(U,V)))))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	73 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	74 (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) | lt(W,V)))))))))))) <-> strictorderP(U)))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	75 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	76 (all U (ssList(U) -> (nil != U -> (exists V (ssItem(V) & V = hd(U)))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	77 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	78 (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.40/1.08	79 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	80 (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.40/1.08	81 (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.40/1.08	82 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	83 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	84 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	85 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.40/1.08	86 (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.40/1.08	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> U != W | (exists Y ((exists Z (ssList(Z) & (exists X1 (ssList(X1) & app(app(Z,cons(Y,nil)),X1) = U & (all X2 (ssItem(X2) -> -memberP(Z,X2) | -memberP(X1,X2) | lt(Y,X2) | -leq(Y,X2))))))) & ssItem(Y))) | (exists X3 (ssItem(X3) & (exists X4 (ssItem(X4) & (exists X5 ((exists X6 (ssList(X6) & W = app(app(app(X5,cons(X3,nil)),cons(X4,nil)),X6) & X4 != X3)) & ssList(X5))))))) | U = nil | V != X)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.40/1.08	
0.40/1.08	============================== end of process non-clausal formulas ===
0.40/1.08	
0.40/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.40/1.08	
0.40/1.08	============================== PREDICATE ELIMINATION =================
0.40/1.12	88 -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(47)].
0.40/1.12	89 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
0.40/1.12	90 -ssList(A) | ssItem(f27(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	91 -ssList(A) | ssItem(f28(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	92 -ssList(A) | ssList(f29(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	93 -ssList(A) | ssList(f30(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	94 -ssList(A) | app(f29(A),cons(f27(A),cons(f28(A),f30(A)))) = A | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	95 -ssList(A) | f28(A) != f27(A) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.40/1.12	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(88,h,89,a)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f27(A)).  [resolve(88,h,90,c)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f28(A)).  [resolve(88,h,91,c)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f29(A)).  [resolve(88,h,92,c)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f30(A)).  [resolve(88,h,93,c)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | app(f29(A),cons(f27(A),cons(f28(A),f30(A)))) = A.  [resolve(88,h,94,c)].
0.40/1.12	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | f28(A) != f27(A).  [resolve(88,h,95,c)].
0.40/1.12	96 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(63)].
0.40/1.12	Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != cons(A,nil) | C = B.  [resolve(96,b,88,h)].
0.40/1.12	97 -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(21)].
0.40/1.12	98 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(10)].
0.40/1.12	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(B,C) | -leq(C,B) | -ssItem(A).  [resolve(97,b,98,b)].
0.40/1.12	99 -ssList(A) | cyclefreeP(A) | ssItem(f12(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.40/1.12	Derived: -ssList(A) | ssItem(f12(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(99,b,97,b)].
0.40/1.12	100 -ssList(A) | cyclefreeP(A) | ssItem(f13(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.40/1.12	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(100,b,97,b)].
0.40/1.12	101 -ssList(A) | cyclefreeP(A) | ssList(f14(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.40/1.12	Derived: -ssList(A) | ssList(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(101,b,97,b)].
0.40/1.12	102 -ssList(A) | cyclefreeP(A) | ssList(f15(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.40/1.12	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(102,b,97,b)].
0.40/1.12	103 -ssList(A) | cyclefreeP(A) | ssList(f16(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.40/1.12	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(103,b,97,b)].
0.87/1.16	104 -ssList(A) | cyclefreeP(A) | app(app(f14(A),cons(f12(A),f15(A))),cons(f13(A),f16(A))) = A # label(ax8) # label(axiom).  [clausify(21)].
0.87/1.16	Derived: -ssList(A) | app(app(f14(A),cons(f12(A),f15(A))),cons(f13(A),f16(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(104,b,97,b)].
0.87/1.16	105 -ssList(A) | cyclefreeP(A) | leq(f12(A),f13(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.87/1.16	Derived: -ssList(A) | leq(f12(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(105,b,97,b)].
0.87/1.16	106 -ssList(A) | cyclefreeP(A) | leq(f13(A),f12(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.87/1.16	Derived: -ssList(A) | leq(f13(A),f12(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(106,b,97,b)].
0.87/1.16	107 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.87/1.16	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(107,a,97,b)].
0.87/1.16	108 -ssList(A) | totalorderP(A) | ssItem(f7(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	109 -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(20)].
0.87/1.16	Derived: -ssList(A) | ssItem(f7(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,109,b)].
0.87/1.16	110 -ssList(A) | totalorderP(A) | ssItem(f8(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | ssItem(f8(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(110,b,109,b)].
0.87/1.16	111 -ssList(A) | totalorderP(A) | ssList(f9(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | ssList(f9(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(111,b,109,b)].
0.87/1.16	112 -ssList(A) | totalorderP(A) | ssList(f10(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | ssList(f10(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(112,b,109,b)].
0.87/1.16	113 -ssList(A) | totalorderP(A) | ssList(f11(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | ssList(f11(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(113,b,109,b)].
0.87/1.16	114 -ssList(A) | totalorderP(A) | app(app(f9(A),cons(f7(A),f10(A))),cons(f8(A),f11(A))) = A # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | app(app(f9(A),cons(f7(A),f10(A))),cons(f8(A),f11(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(114,b,109,b)].
0.87/1.16	115 -ssList(A) | totalorderP(A) | -leq(f8(A),f7(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | -leq(f8(A),f7(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(115,b,109,b)].
0.87/1.16	116 -ssList(A) | totalorderP(A) | -leq(f7(A),f8(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.87/1.16	Derived: -ssList(A) | -leq(f7(A),f8(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(116,b,109,b)].
0.87/1.16	117 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(46)].
0.93/1.22	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(C,B) | leq(B,C).  [resolve(117,b,109,b)].
0.93/1.22	118 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.93/1.22	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(118,a,109,b)].
0.93/1.22	119 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	120 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(28)].
0.93/1.22	121 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.93/1.22	122 -ssList(A) | ssItem(f35(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	123 -ssList(A) | ssItem(f36(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	124 -ssList(A) | ssList(f37(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	125 -ssList(A) | ssList(f38(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	126 -ssList(A) | ssList(f39(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	127 -ssList(A) | app(app(f37(A),cons(f35(A),f38(A))),cons(f36(A),f39(A))) = A | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	128 -ssList(A) | -lt(f35(A),f36(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	129 -ssList(A) | -lt(f36(A),f35(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.93/1.22	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) | lt(B,C) | lt(C,B) | -ssItem(A).  [resolve(119,j,120,b)].
0.93/1.22	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | lt(A,B) | lt(B,A).  [resolve(119,j,121,a)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | ssItem(f35(A)).  [resolve(119,j,122,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | ssItem(f36(A)).  [resolve(119,j,123,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | ssList(f37(A)).  [resolve(119,j,124,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | ssList(f38(A)).  [resolve(119,j,125,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | ssList(f39(A)).  [resolve(119,j,126,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | app(app(f37(A),cons(f35(A),f38(A))),cons(f36(A),f39(A))) = A.  [resolve(119,j,127,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | -lt(f35(A),f36(A)).  [resolve(119,j,128,c)].
0.93/1.22	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) | -ssList(A) | -lt(f36(A),f35(A)).  [resolve(119,j,129,c)].
0.93/1.22	130 -ssList(A) | duplicatefreeP(A) | ssItem(f20(A)) # label(ax13) # label(axiom).  [clausify(34)].
0.93/1.22	131 -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(34)].
0.93/1.22	Derived: -ssList(A) | ssItem(f20(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(130,b,131,b)].
2.35/2.67	132 -ssList(A) | duplicatefreeP(A) | ssItem(f21(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | ssItem(f21(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(132,b,131,b)].
2.35/2.67	133 -ssList(A) | duplicatefreeP(A) | ssList(f22(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | ssList(f22(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(133,b,131,b)].
2.35/2.67	134 -ssList(A) | duplicatefreeP(A) | ssList(f23(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | ssList(f23(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(134,b,131,b)].
2.35/2.67	135 -ssList(A) | duplicatefreeP(A) | ssList(f24(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | ssList(f24(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(135,b,131,b)].
2.35/2.67	136 -ssList(A) | duplicatefreeP(A) | app(app(f22(A),cons(f20(A),f23(A))),cons(f21(A),f24(A))) = A # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | app(app(f22(A),cons(f20(A),f23(A))),cons(f21(A),f24(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(136,b,131,b)].
2.35/2.67	137 -ssList(A) | duplicatefreeP(A) | f21(A) = f20(A) # label(ax13) # label(axiom).  [clausify(34)].
2.35/2.67	Derived: -ssList(A) | f21(A) = f20(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,131,b)].
2.35/2.67	138 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(50)].
2.35/2.67	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) | C != B.  [resolve(138,b,131,b)].
2.35/2.67	139 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
2.35/2.67	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(139,a,131,b)].
2.35/2.67	140 -ssList(A) | -ssList(B) | B != A | -neq(A,B) # label(ax15) # label(axiom).  [clausify(67)].
2.35/2.67	141 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # label(axiom).  [clausify(67)].
2.35/2.67	142 -ssItem(A) | -ssItem(B) | -neq(A,B) | B != A # label(ax1) # label(axiom).  [clausify(68)].
2.35/2.67	143 -ssItem(A) | -ssItem(B) | neq(A,B) | B = A # label(ax1) # label(axiom).  [clausify(68)].
2.35/2.67	
2.35/2.67	============================== end predicate elimination =============
2.35/2.67	
2.35/2.67	Auto_denials:  (non-Horn, no changes).
2.35/2.67	
2.35/2.67	Term ordering decisions:
2.35/2.67	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. cons=1. app=1. f6=1. f17=1. f25=1. f26=1. f33=1. f34=1. hd=1. tl=1. f1=1. f2=1. f3=1. f4=1. f5=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=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.35/2.67	
2.35/2.67	============================== end of process initial clauses ========
2.35/2.67	
2.35/2.67	============================== CLAUSES FOR SEARCH ====================
2.35/2.67	
2.35/2.67	============================== end of clauses for search =============
2.35/2.67	
2.35/2.67	============================== SEARCH ================================
2.35/2.67	
2.35/2.67	% Starting search at 0.54 seconds.
2.35/2.67	
2.35/2.67	Low Water (keep): wt=41.000, iters=3494
2.35/2.67	
2.35/2.67	Low Water (keep): wt=38.000, iters=3395
2.35/2.67	
2.35/2.67	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 37 (0.00 of 1.02 sec).
2.35/2.67	
2.35/2.67	Low Water (keep): wt=35.000, iters=3407
2.35/2.67	
2.35/2.67	Low Water (keep): wt=34.000, iters=3430
2.35/2.67	
2.35/2.67	Low Water (keep): wt=33.000, iters=3397
2.35/2.67	
2.35/2.67	Low Water (keep): wt=31.000, iters=3493
2.35/2.67	
2.35/2.67	Low Water (keep): wt=30.000, iAlarm clock 
119.77/120.07	Prover9 interrupted
119.77/120.08	EOF