0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n020.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 : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 10:17:01 EDT 2023
0.12/0.33	% CPUTime  : 
0.90/1.19	============================== Prover9 ===============================
0.90/1.19	Prover9 (32) version 2009-11A, November 2009.
0.90/1.19	Process 12684 was started by sandbox on n020.cluster.edu,
0.90/1.19	Mon Jul  3 10:17:02 2023
0.90/1.19	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_12531_n020.cluster.edu".
0.90/1.19	============================== end of head ===========================
0.90/1.19	
0.90/1.19	============================== INPUT =================================
0.90/1.19	
0.90/1.19	% Reading from file /tmp/Prover9_12531_n020.cluster.edu
0.90/1.19	
0.90/1.19	set(prolog_style_variables).
0.90/1.19	set(auto2).
0.90/1.19	    % set(auto2) -> set(auto).
0.90/1.19	    % set(auto) -> set(auto_inference).
0.90/1.19	    % set(auto) -> set(auto_setup).
0.90/1.19	    % set(auto_setup) -> set(predicate_elim).
0.90/1.19	    % set(auto_setup) -> assign(eq_defs, unfold).
0.90/1.19	    % set(auto) -> set(auto_limits).
0.90/1.19	    % set(auto_limits) -> assign(max_weight, "100.000").
0.90/1.19	    % set(auto_limits) -> assign(sos_limit, 20000).
0.90/1.19	    % set(auto) -> set(auto_denials).
0.90/1.19	    % set(auto) -> set(auto_process).
0.90/1.19	    % set(auto2) -> assign(new_constants, 1).
0.90/1.19	    % set(auto2) -> assign(fold_denial_max, 3).
0.90/1.19	    % set(auto2) -> assign(max_weight, "200.000").
0.90/1.19	    % set(auto2) -> assign(max_hours, 1).
0.90/1.19	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.90/1.19	    % set(auto2) -> assign(max_seconds, 0).
0.90/1.19	    % set(auto2) -> assign(max_minutes, 5).
0.90/1.19	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.90/1.19	    % set(auto2) -> set(sort_initial_sos).
0.90/1.19	    % set(auto2) -> assign(sos_limit, -1).
0.90/1.19	    % set(auto2) -> assign(lrs_ticks, 3000).
0.90/1.19	    % set(auto2) -> assign(max_megs, 400).
0.90/1.19	    % set(auto2) -> assign(stats, some).
0.90/1.19	    % set(auto2) -> clear(echo_input).
0.90/1.19	    % set(auto2) -> set(quiet).
0.90/1.19	    % set(auto2) -> clear(print_initial_clauses).
0.90/1.19	    % set(auto2) -> clear(print_given).
0.90/1.19	assign(lrs_ticks,-1).
0.90/1.19	assign(sos_limit,10000).
0.90/1.19	assign(order,kbo).
0.90/1.19	set(lex_order_vars).
0.90/1.19	clear(print_given).
0.90/1.19	
0.90/1.19	% formulas(sos).  % not echoed (96 formulas)
0.90/1.19	
0.90/1.19	============================== end of input ==========================
0.90/1.19	
0.90/1.19	% From the command line: assign(max_seconds, 1440).
0.90/1.19	
0.90/1.19	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.90/1.19	
0.90/1.19	% Formulas that are not ordinary clauses:
0.90/1.19	1 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	2 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(U,V) & segmentP(V,U) -> V = U))))) # label(ax54) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	3 (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.90/1.19	4 (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.90/1.19	5 (all U (ssList(U) -> (U != nil -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	6 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	7 (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.90/1.19	8 (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.90/1.19	9 (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.90/1.19	10 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	11 (all U (ssList(U) -> U = app(U,nil))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	12 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	13 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	14 (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.90/1.19	15 (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(W,V) | leq(V,W)))))))))))) <-> totalorderP(U)))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	16 (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.90/1.19	17 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	18 (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.90/1.19	19 (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.90/1.19	20 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(X,V) = cons(W,U) -> V = U & W = X))))))))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	21 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (frontsegP(V,W) & frontsegP(U,V) -> frontsegP(U,W)))))))) # label(ax40) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	22 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	23 (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.90/1.19	24 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	25 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	26 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (memberP(cons(V,W),U) <-> memberP(W,U) | V = U))))))) # label(ax37) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	27 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(U,V) & rearsegP(V,U) -> V = U))))) # label(ax48) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	28 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	29 (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.90/1.19	30 (all U (ssItem(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (memberP(app(V,W),U) <-> memberP(W,U) | memberP(V,U)))))))) # label(ax36) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	31 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & U = cons(V,nil)))))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	32 (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)) -> W != V))))))))))) <-> duplicatefreeP(U)))) # label(ax13) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	33 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	34 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	35 (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.90/1.19	36 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	37 (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.90/1.19	38 (all U (ssList(U) -> (all V (ssItem(V) -> V = hd(cons(V,U)))))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	39 (all U (ssList(U) -> (all V (ssList(V) -> (U != nil & hd(U) = hd(V) & tl(V) = tl(U) & nil != V -> U = V))))) # label(ax77) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	40 (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.90/1.19	41 (all U (ssList(U) -> (all V (ssList(V) -> (nil = V & nil = U <-> app(U,V) = nil))))) # label(ax83) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	42 (all U (ssList(U) -> (nil = U <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	43 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(V,U) <-> gt(U,V)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	44 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	45 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	46 (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.90/1.19	47 (all U (ssList(U) -> (all V (ssItem(V) -> (memberP(U,V) <-> (exists W ((exists X (app(W,cons(V,X)) = U & ssList(X))) & ssList(W)))))))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	48 (all U (ssList(U) -> (nil != U -> (exists V (hd(U) = V & ssItem(V)))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	49 (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.90/1.19	50 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	51 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	52 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) & leq(U,V) -> V = U))))) # label(ax29) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	53 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(V,U) & geq(U,V) -> U = V))))) # label(ax87) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	54 (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.90/1.19	55 (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.90/1.19	56 (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.90/1.19	57 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	58 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	59 (all U (ssList(U) -> (all V (ssList(V) -> (neq(U,V) <-> V != U))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	60 (all U (ssList(U) -> U = nil | (exists V ((exists W (ssItem(W) & U = cons(W,V))) & ssList(V))))) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	61 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	62 (all U (ssItem(U) -> (all V (ssList(V) -> (totalorderedP(cons(U,V)) <-> nil != V & leq(U,hd(V)) & totalorderedP(V) | nil = V))))) # label(ax67) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	63 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	64 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	65 (all U (ssList(U) -> (nil != U -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	66 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	67 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	68 (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.90/1.19	69 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	70 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	71 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	72 (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.90/1.19	73 (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.90/1.19	74 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	75 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	76 (all U (ssItem(U) -> (all V (ssList(V) -> (V = nil | V != nil & lt(U,hd(V)) & strictorderedP(V) <-> strictorderedP(cons(U,V))))))) # label(ax70) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	77 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (segmentP(V,W) & segmentP(U,V) -> segmentP(U,W)))))))) # label(ax53) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	78 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (ssList(W) & (exists X (ssList(X) & U = app(app(W,V),X))))) <-> segmentP(U,V)))))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	79 (all U (ssList(U) -> (nil != U -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	80 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	81 (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.90/1.19	82 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(U,V) & rearsegP(V,W) -> rearsegP(U,W)))))))) # label(ax47) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	83 (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.90/1.19	84 (all U (ssList(U) -> (segmentP(nil,U) <-> nil = U))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	85 (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.90/1.19	86 (all U (ssList(U) -> (equalelemsP(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)))))))))))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
0.90/1.19	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> -segmentP(X,W) | -singletonP(W) & neq(X,nil) | (all Y (ssItem(Y) -> (all Z (ssItem(Z) -> (all X1 (ssList(X1) -> (all X2 (ssList(X2) -> (all X3 (ssList(X3) -> Y = Z | U != app(app(app(app(X1,cons(Y,nil)),X3),cons(Z,nil)),X2))))))))))) | W != U | X != V)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.90/1.19	
0.90/1.19	============================== end of process non-clausal formulas ===
0.90/1.19	
0.90/1.19	============================== PROCESS INITIAL CLAUSES ===============
0.90/1.19	
0.90/1.19	============================== PREDICATE ELIMINATION =================
0.90/1.19	88 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	89 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
0.90/1.24	90 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(28)].
0.90/1.24	91 -ssList(A) | ssItem(f19(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	92 -ssList(A) | ssItem(f20(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	93 -ssList(A) | ssList(f21(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	94 -ssList(A) | ssList(f22(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	95 -ssList(A) | ssList(f23(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	96 -ssList(A) | app(app(f21(A),cons(f19(A),f22(A))),cons(f20(A),f23(A))) = A | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	97 -ssList(A) | f20(A) = f19(A) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.90/1.24	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,i,89,a)].
0.90/1.24	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,i,90,b)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | ssItem(f19(A)).  [resolve(88,i,91,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | ssItem(f20(A)).  [resolve(88,i,92,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | ssList(f21(A)).  [resolve(88,i,93,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | ssList(f22(A)).  [resolve(88,i,94,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | ssList(f23(A)).  [resolve(88,i,95,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | app(app(f21(A),cons(f19(A),f22(A))),cons(f20(A),f23(A))) = A.  [resolve(88,i,96,c)].
0.90/1.24	Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B | -ssList(A) | f20(A) = f19(A).  [resolve(88,i,97,c)].
0.90/1.24	98 -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(15)].
0.90/1.24	99 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(10)].
0.90/1.24	100 -ssList(A) | ssItem(f3(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	101 -ssList(A) | ssItem(f4(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	102 -ssList(A) | ssList(f5(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	103 -ssList(A) | ssList(f6(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	104 -ssList(A) | ssList(f7(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	105 -ssList(A) | app(app(f5(A),cons(f3(A),f6(A))),cons(f4(A),f7(A))) = A | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	106 -ssList(A) | -leq(f4(A),f3(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	107 -ssList(A) | -leq(f3(A),f4(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.90/1.24	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,j,99,b)].
0.90/1.24	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(f3(A)).  [resolve(98,j,100,c)].
0.90/1.41	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(f4(A)).  [resolve(98,j,101,c)].
0.90/1.41	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(f5(A)).  [resolve(98,j,102,c)].
0.90/1.41	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(f6(A)).  [resolve(98,j,103,c)].
0.90/1.41	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(f7(A)).  [resolve(98,j,104,c)].
0.90/1.41	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(f5(A),cons(f3(A),f6(A))),cons(f4(A),f7(A))) = A.  [resolve(98,j,105,c)].
0.90/1.41	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(f4(A),f3(A)).  [resolve(98,j,106,c)].
0.90/1.41	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(f3(A),f4(A)).  [resolve(98,j,107,c)].
0.90/1.41	108 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.90/1.41	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(108,a,98,j)].
0.90/1.41	109 -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(49)].
0.90/1.41	110 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(24)].
0.90/1.41	111 -ssList(A) | ssItem(f33(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	112 -ssList(A) | ssItem(f34(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	113 -ssList(A) | ssList(f35(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	114 -ssList(A) | ssList(f36(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	115 -ssList(A) | ssList(f37(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	116 -ssList(A) | app(app(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(A))) = A | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	117 -ssList(A) | leq(f34(A),f33(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	118 -ssList(A) | leq(f33(A),f34(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.90/1.41	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(109,j,110,b)].
0.90/1.41	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(f33(A)).  [resolve(109,j,111,c)].
0.90/1.41	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(f34(A)).  [resolve(109,j,112,c)].
0.90/1.41	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(f35(A)).  [resolve(109,j,113,c)].
0.90/1.41	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(f36(A)).  [resolve(109,j,114,c)].
0.90/1.41	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(109,j,115,c)].
0.90/1.41	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(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(A))) = A.  [resolve(109,j,116,c)].
0.90/1.62	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(f34(A),f33(A)).  [resolve(109,j,117,c)].
0.90/1.62	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(f33(A),f34(A)).  [resolve(109,j,118,c)].
0.90/1.62	119 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.90/1.62	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | -leq(B,A) | -leq(A,B).  [resolve(119,a,109,j)].
0.90/1.62	120 -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(37)].
0.90/1.62	121 -ssList(A) | ssItem(f24(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	122 -ssList(A) | ssItem(f25(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	123 -ssList(A) | ssList(f26(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	124 -ssList(A) | ssList(f27(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	125 -ssList(A) | ssList(f28(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	126 -ssList(A) | app(app(f26(A),cons(f24(A),f27(A))),cons(f25(A),f28(A))) = A | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	127 -ssList(A) | -lt(f24(A),f25(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	128 -ssList(A) | -lt(f25(A),f24(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.90/1.62	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(f24(A)).  [resolve(120,j,121,c)].
0.90/1.62	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(f25(A)).  [resolve(120,j,122,c)].
0.90/1.62	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(f26(A)).  [resolve(120,j,123,c)].
0.90/1.62	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(f27(A)).  [resolve(120,j,124,c)].
0.90/1.62	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(f28(A)).  [resolve(120,j,125,c)].
0.90/1.62	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(f26(A),cons(f24(A),f27(A))),cons(f25(A),f28(A))) = A.  [resolve(120,j,126,c)].
0.90/1.62	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(f24(A),f25(A)).  [resolve(120,j,127,c)].
0.90/1.62	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(f25(A),f24(A)).  [resolve(120,j,128,c)].
0.90/1.62	129 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(58)].
0.90/1.62	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(B,C) | lt(C,B).  [resolve(129,b,120,j)].
0.90/1.62	130 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.90/1.62	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(130,a,120,j)].
5.31/5.62	131 -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(86)].
5.31/5.62	132 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
5.31/5.62	133 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(64)].
5.31/5.62	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(131,b,132,a)].
5.31/5.62	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(131,b,133,b)].
5.31/5.62	134 -ssList(A) | equalelemsP(A) | ssItem(f42(A)) # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | ssItem(f42(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(134,b,131,b)].
5.31/5.62	135 -ssList(A) | equalelemsP(A) | ssItem(f43(A)) # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | ssItem(f43(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(135,b,131,b)].
5.31/5.62	136 -ssList(A) | equalelemsP(A) | ssList(f44(A)) # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | ssList(f44(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(136,b,131,b)].
5.31/5.62	137 -ssList(A) | equalelemsP(A) | ssList(f45(A)) # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | ssList(f45(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(137,b,131,b)].
5.31/5.62	138 -ssList(A) | equalelemsP(A) | app(f44(A),cons(f42(A),cons(f43(A),f45(A)))) = A # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | app(f44(A),cons(f42(A),cons(f43(A),f45(A)))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(138,b,131,b)].
5.31/5.62	139 -ssList(A) | equalelemsP(A) | f43(A) != f42(A) # label(ax14) # label(axiom).  [clausify(86)].
5.31/5.62	Derived: -ssList(A) | f43(A) != f42(A) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B.  [resolve(139,b,131,b)].
5.31/5.62	
5.31/5.62	============================== end predicate elimination =============
5.31/5.62	
5.31/5.62	Auto_denials:  (non-Horn, no changes).
5.31/5.62	
5.31/5.62	Term ordering decisions:
5.31/5.62	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. cons=1. app=1. f2=1. f29=1. f30=1. f31=1. f40=1. f41=1. hd=1. tl=1. f1=1. f3=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. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f42=1. f43=1. f44=1. f45=1.
5.31/5.62	
5.31/5.62	============================== end of process initial clauses ========
5.31/5.62	
5.31/5.62	============================== CLAUSES FOR SEARCH ====================
5.31/5.62	
5.31/5.62	============================== end of clauses for search =============
5.31/5.62	
5.31/5.62	============================== SEARCH ================================
5.31/5.62	
5.31/5.62	% Starting search at 1.06 seconds.
5.31/5.62	
5.31/5.62	Low Water (keep): wt=43.000, iters=3759
5.31/5.62	
5.31/5.62	Low Water (keep): wt=30.000, iters=3403
5.31/5.62	
5.31/5.62	Low Water (keep): wt=27.000, iters=3602
5.31/5.62	
5.31/5.62	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 463 (0.00 of 2.50 sec).
5.31/5.62	
5.31/5.62	Low Water (keep): wt=26.000, iters=3691
5.31/5.62	
5.31/5.62	Low Water (keep): wt=23.000, iters=3425
5.31/5.62	
5.31/5.62	Low Water (keep): wt=22.000, iters=3429
5.31/5.62	
5.31/5.62	Low Water (keep): wt=21.000, iters=3398
5.31/5.62	
5.31/5.62	Low Water (keep): wt=20.000, iters=3445
5.31/5.62	
5.31/5.62	Low Water (keep): wt=19.000, iters=3352
5.31/5.62	
5.31/5.62	Low Water (keep): wt=18.000, iters=3358
5.31/5.62	
5.31/5.62	Low Water (keep): wt=17.000, iters=3357
5.31/5.62	
5.31/5.62	Low Water (keep): wt=16.000, iters=3402
5.31/5.62	
5.31/5.62	Low Water (keep): wt=14.000, iters=3352
5.31/5.62	
5.31/5.62	Low Water (keep): wt=13.000, iters=3368
5.31/5.62	
5.31/5.62	Low Water (keep): wt=12.000, iters=3580
5.31/5.62	
5.31/5.62	Low Water (keep): wt=11.000, iters=3333
5.31/5.62	
5.31/5.62	Low Water (displace): id=3183, wt=40.000
5.31/5.62	
5.31/5.62	Low Water (displace): id=3231, wt=38.000
5.31/5.62	
5.31/5.62	Low Water (displace): id=3287, wt=36.Alarm clock 
179.59/180.06	Prover9 interrupted
179.59/180.06	EOF