0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer : n013.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 : 1440
0.14/0.34	% WCLimit  : 180
0.14/0.34	% DateTime : Mon Jul  3 09:25:17 EDT 2023
0.14/0.34	% CPUTime  : 
0.99/1.24	============================== Prover9 ===============================
0.99/1.24	Prover9 (32) version 2009-11A, November 2009.
0.99/1.24	Process 10156 was started by sandbox on n013.cluster.edu,
0.99/1.24	Mon Jul  3 09:25:18 2023
0.99/1.24	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_9990_n013.cluster.edu".
0.99/1.24	============================== end of head ===========================
0.99/1.24	
0.99/1.24	============================== INPUT =================================
0.99/1.24	
0.99/1.24	% Reading from file /tmp/Prover9_9990_n013.cluster.edu
0.99/1.24	
0.99/1.24	set(prolog_style_variables).
0.99/1.24	set(auto2).
0.99/1.24	    % set(auto2) -> set(auto).
0.99/1.24	    % set(auto) -> set(auto_inference).
0.99/1.24	    % set(auto) -> set(auto_setup).
0.99/1.24	    % set(auto_setup) -> set(predicate_elim).
0.99/1.24	    % set(auto_setup) -> assign(eq_defs, unfold).
0.99/1.24	    % set(auto) -> set(auto_limits).
0.99/1.24	    % set(auto_limits) -> assign(max_weight, "100.000").
0.99/1.24	    % set(auto_limits) -> assign(sos_limit, 20000).
0.99/1.24	    % set(auto) -> set(auto_denials).
0.99/1.24	    % set(auto) -> set(auto_process).
0.99/1.24	    % set(auto2) -> assign(new_constants, 1).
0.99/1.24	    % set(auto2) -> assign(fold_denial_max, 3).
0.99/1.24	    % set(auto2) -> assign(max_weight, "200.000").
0.99/1.24	    % set(auto2) -> assign(max_hours, 1).
0.99/1.24	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.99/1.24	    % set(auto2) -> assign(max_seconds, 0).
0.99/1.24	    % set(auto2) -> assign(max_minutes, 5).
0.99/1.24	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.99/1.24	    % set(auto2) -> set(sort_initial_sos).
0.99/1.24	    % set(auto2) -> assign(sos_limit, -1).
0.99/1.24	    % set(auto2) -> assign(lrs_ticks, 3000).
0.99/1.24	    % set(auto2) -> assign(max_megs, 400).
0.99/1.24	    % set(auto2) -> assign(stats, some).
0.99/1.24	    % set(auto2) -> clear(echo_input).
0.99/1.24	    % set(auto2) -> set(quiet).
0.99/1.24	    % set(auto2) -> clear(print_initial_clauses).
0.99/1.24	    % set(auto2) -> clear(print_given).
0.99/1.24	assign(lrs_ticks,-1).
0.99/1.24	assign(sos_limit,10000).
0.99/1.24	assign(order,kbo).
0.99/1.24	set(lex_order_vars).
0.99/1.24	clear(print_given).
0.99/1.24	
0.99/1.24	% formulas(sos).  % not echoed (96 formulas)
0.99/1.24	
0.99/1.24	============================== end of input ==========================
0.99/1.24	
0.99/1.24	% From the command line: assign(max_seconds, 1440).
0.99/1.24	
0.99/1.24	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.99/1.24	
0.99/1.24	% Formulas that are not ordinary clauses:
0.99/1.24	1 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	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.99/1.24	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.99/1.24	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.99/1.24	5 (all U (ssList(U) -> (U != nil -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	6 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	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.99/1.24	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.99/1.24	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.99/1.24	10 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	11 (all U (ssList(U) -> U = app(U,nil))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	12 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	13 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	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.99/1.24	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.99/1.24	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.99/1.24	17 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.99/1.24	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.99/1.24	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.99/1.25	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.99/1.25	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.99/1.25	22 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	24 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	25 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	28 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	31 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & U = cons(V,nil)))))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	33 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	34 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	36 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	38 (all U (ssList(U) -> (all V (ssItem(V) -> V = hd(cons(V,U)))))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	42 (all U (ssList(U) -> (nil = U <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	43 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(V,U) <-> gt(U,V)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	44 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	45 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	48 (all U (ssList(U) -> (nil != U -> (exists V (hd(U) = V & ssItem(V)))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	50 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	51 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	57 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	58 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	59 (all U (ssList(U) -> (all V (ssList(V) -> (neq(U,V) <-> V != U))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	61 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	63 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	64 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	65 (all U (ssList(U) -> (nil != U -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	66 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	67 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	69 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	70 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	71 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	74 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	75 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	79 (all U (ssList(U) -> (nil != U -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	80 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	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.99/1.25	84 (all U (ssList(U) -> (segmentP(nil,U) <-> nil = U))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.99/1.25	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.99/1.25	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.99/1.25	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> W != U | nil = U | (exists Y (ssItem(Y) & (exists Z ((exists X1 ((all X2 (ssItem(X2) -> -memberP(Z,X2) | -memberP(X1,X2) | -leq(Y,X2) | lt(Y,X2))) & app(app(Z,cons(Y,nil)),X1) = U & ssList(X1))) & ssList(Z))))) | X != nil & W = nil | (all X3 (ssList(X3) -> (all X4 (ssList(X4) -> (exists X9 ((exists X10 ((exists X11 (ssItem(X11) & (exists X12 (ssList(X12) & leq(X11,X9) & W = app(X12,cons(X11,nil)))))) & app(cons(X9,nil),X10) = X4 & ssList(X10))) & ssItem(X9))) | (exists X5 (ssItem(X5) & (exists X6 (ssList(X6) & (exists X7 (ssItem(X7) & (exists X8 (ssList(X8) & W = app(cons(X7,nil),X8) & leq(X5,X7))))) & app(X6,cons(X5,nil)) = X3)))) | -totalorderedP(W) | app(app(X3,W),X4) != X)))) | V != X)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.99/1.28	
0.99/1.28	============================== end of process non-clausal formulas ===
0.99/1.28	
0.99/1.28	============================== PROCESS INITIAL CLAUSES ===============
0.99/1.28	
0.99/1.28	============================== PREDICATE ELIMINATION =================
0.99/1.28	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.99/1.28	89 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
0.99/1.28	90 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(28)].
0.99/1.28	91 -ssList(A) | ssItem(f19(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	92 -ssList(A) | ssItem(f20(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	93 -ssList(A) | ssList(f21(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	94 -ssList(A) | ssList(f22(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	95 -ssList(A) | ssList(f23(A)) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	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.99/1.28	97 -ssList(A) | f20(A) = f19(A) | duplicatefreeP(A) # label(ax13) # label(axiom).  [clausify(32)].
0.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	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.99/1.28	99 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(10)].
0.99/1.28	100 -ssList(A) | ssItem(f3(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.28	101 -ssList(A) | ssItem(f4(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.28	102 -ssList(A) | ssList(f5(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.28	103 -ssList(A) | ssList(f6(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.28	104 -ssList(A) | ssList(f7(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.28	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.99/1.28	106 -ssList(A) | -leq(f4(A),f3(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.38	107 -ssList(A) | -leq(f3(A),f4(A)) | totalorderP(A) # label(ax9) # label(axiom).  [clausify(15)].
0.99/1.38	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.99/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(f3(A)).  [resolve(98,j,100,c)].
0.99/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(f4(A)).  [resolve(98,j,101,c)].
0.99/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(f5(A)).  [resolve(98,j,102,c)].
0.99/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(f6(A)).  [resolve(98,j,103,c)].
0.99/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(f7(A)).  [resolve(98,j,104,c)].
0.99/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(f5(A),cons(f3(A),f6(A))),cons(f4(A),f7(A))) = A.  [resolve(98,j,105,c)].
0.99/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(f4(A),f3(A)).  [resolve(98,j,106,c)].
0.99/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(f3(A),f4(A)).  [resolve(98,j,107,c)].
0.99/1.38	108 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.99/1.38	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.99/1.38	109 -ssItem(A) | -ssItem(B) | neq(A,B) | B = A # label(ax1) # label(axiom).  [clausify(22)].
0.99/1.38	110 -ssItem(A) | -ssItem(B) | -neq(A,B) | B != A # label(ax1) # label(axiom).  [clausify(22)].
0.99/1.38	111 -ssList(A) | -ssList(B) | -neq(A,B) | B != A # label(ax15) # label(axiom).  [clausify(59)].
0.99/1.38	112 -ssList(A) | -ssList(B) | neq(A,B) | B = A # label(ax15) # label(axiom).  [clausify(59)].
0.99/1.38	113 -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.99/1.38	114 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(24)].
0.99/1.38	115 -ssList(A) | ssItem(f33(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	116 -ssList(A) | ssItem(f34(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	117 -ssList(A) | ssList(f35(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	118 -ssList(A) | ssList(f36(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	119 -ssList(A) | ssList(f37(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	120 -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.99/1.38	121 -ssList(A) | leq(f34(A),f33(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	122 -ssList(A) | leq(f33(A),f34(A)) | cyclefreeP(A) # label(ax8) # label(axiom).  [clausify(49)].
0.99/1.38	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(113,j,114,b)].
0.99/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(f33(A)).  [resolve(113,j,115,c)].
0.99/1.54	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(113,j,116,c)].
0.99/1.54	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(113,j,117,c)].
0.99/1.54	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(113,j,118,c)].
0.99/1.54	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(113,j,119,c)].
0.99/1.54	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(113,j,120,c)].
0.99/1.54	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(113,j,121,c)].
0.99/1.54	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(113,j,122,c)].
0.99/1.54	123 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.99/1.54	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(123,a,113,j)].
0.99/1.54	124 -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.99/1.54	125 -ssList(A) | ssItem(f24(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	126 -ssList(A) | ssItem(f25(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	127 -ssList(A) | ssList(f26(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	128 -ssList(A) | ssList(f27(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	129 -ssList(A) | ssList(f28(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	130 -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.99/1.54	131 -ssList(A) | -lt(f24(A),f25(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	132 -ssList(A) | -lt(f25(A),f24(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(37)].
0.99/1.54	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(124,j,125,c)].
0.99/1.54	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(124,j,126,c)].
0.99/1.54	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(124,j,127,c)].
0.99/1.54	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(124,j,128,c)].
0.99/1.54	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(124,j,129,c)].
0.99/1.54	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(124,j,130,c)].
0.99/1.54	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(124,j,131,c)].
2.46/2.73	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(124,j,132,c)].
2.46/2.73	133 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(58)].
2.46/2.73	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(133,b,124,j)].
2.46/2.73	134 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
2.46/2.73	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(134,a,124,j)].
2.46/2.73	135 -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)].
2.46/2.73	136 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
2.46/2.73	137 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(64)].
2.46/2.73	Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A.  [resolve(135,b,136,a)].
2.46/2.73	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(135,b,137,b)].
2.46/2.73	138 -ssList(A) | equalelemsP(A) | ssItem(f42(A)) # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(138,b,135,b)].
2.46/2.73	139 -ssList(A) | equalelemsP(A) | ssItem(f43(A)) # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(139,b,135,b)].
2.46/2.73	140 -ssList(A) | equalelemsP(A) | ssList(f44(A)) # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(140,b,135,b)].
2.46/2.73	141 -ssList(A) | equalelemsP(A) | ssList(f45(A)) # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(141,b,135,b)].
2.46/2.73	142 -ssList(A) | equalelemsP(A) | app(f44(A),cons(f42(A),cons(f43(A),f45(A)))) = A # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(142,b,135,b)].
2.46/2.73	143 -ssList(A) | equalelemsP(A) | f43(A) != f42(A) # label(ax14) # label(axiom).  [clausify(86)].
2.46/2.73	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(143,b,135,b)].
2.46/2.73	
2.46/2.73	============================== end predicate elimination =============
2.46/2.73	
2.46/2.73	Auto_denials:  (non-Horn, no changes).
2.46/2.73	
2.46/2.73	Term ordering decisions:
2.46/2.73	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=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. f46=1.
2.46/2.73	
2.46/2.73	============================== end of process initial clauses ========
2.46/2.73	
2.46/2.73	============================== CLAUSES FOR SEARCH ====================
2.46/2.73	
2.46/2.73	============================== end of clauses for search =============
2.46/2.73	
2.46/2.73	============================== SEARCH ================================
2.46/2.73	
2.46/2.73	% Starting search at 0.81 seconds.
2.46/2.73	
2.46/2.73	Low Water (keep): wt=33.000, iters=3398
2.46/2.73	
2.46/2.73	Low Water (keep): wAlarm clock 
179.75/180.05	Prover9 interrupted
179.75/180.05	EOF