0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer   : n026.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% DateTime   : Wed Jul 14 13:27:00 EDT 2021
0.13/0.33	% CPUTime    : 
0.42/1.08	============================== Prover9 ===============================
0.42/1.08	Prover9 (32) version 2009-11A, November 2009.
0.42/1.08	Process 32484 was started by sandbox on n026.cluster.edu,
0.42/1.08	Wed Jul 14 13:27:00 2021
0.42/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_32331_n026.cluster.edu".
0.42/1.08	============================== end of head ===========================
0.42/1.08	
0.42/1.08	============================== INPUT =================================
0.42/1.08	
0.42/1.08	% Reading from file /tmp/Prover9_32331_n026.cluster.edu
0.42/1.08	
0.42/1.08	set(prolog_style_variables).
0.42/1.08	set(auto2).
0.42/1.08	    % set(auto2) -> set(auto).
0.42/1.08	    % set(auto) -> set(auto_inference).
0.42/1.08	    % set(auto) -> set(auto_setup).
0.42/1.08	    % set(auto_setup) -> set(predicate_elim).
0.42/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.08	    % set(auto) -> set(auto_limits).
0.42/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.08	    % set(auto) -> set(auto_denials).
0.42/1.08	    % set(auto) -> set(auto_process).
0.42/1.08	    % set(auto2) -> assign(new_constants, 1).
0.42/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.08	    % set(auto2) -> assign(max_hours, 1).
0.42/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.08	    % set(auto2) -> set(sort_initial_sos).
0.42/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.08	    % set(auto2) -> assign(max_megs, 400).
0.42/1.08	    % set(auto2) -> assign(stats, some).
0.42/1.08	    % set(auto2) -> clear(echo_input).
0.42/1.08	    % set(auto2) -> set(quiet).
0.42/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.08	    % set(auto2) -> clear(print_given).
0.42/1.08	assign(lrs_ticks,-1).
0.42/1.08	assign(sos_limit,10000).
0.42/1.08	assign(order,kbo).
0.42/1.08	set(lex_order_vars).
0.42/1.08	clear(print_given).
0.42/1.08	
0.42/1.08	% formulas(sos).  % not echoed (96 formulas)
0.42/1.08	
0.42/1.08	============================== end of input ==========================
0.42/1.08	
0.42/1.08	% From the command line: assign(max_seconds, 1200).
0.42/1.08	
0.42/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.08	
0.42/1.08	% Formulas that are not ordinary clauses:
0.42/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.42/1.08	2 (exists U ((exists V (ssItem(V) & V != U)) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
0.42/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.42/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.42/1.08	5 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause).  [assumption].
0.42/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.42/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.42/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.42/1.08	9 (all U (ssList(U) -> (all V (ssItem(V) -> U != cons(V,U))))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	10 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
0.42/1.08	11 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause).  [assumption].
0.42/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.42/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.42/1.09	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.42/1.09	15 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	18 (all U (ssList(U) -> (nil = U <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	26 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	27 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	28 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	30 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	32 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	35 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	36 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	37 (all U (ssList(U) -> (nil = U <-> frontsegP(nil,U)))) # label(ax46) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	41 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	43 (all U (ssList(U) -> (U != nil -> U = cons(hd(U),tl(U))))) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	45 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	46 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	49 (all U (ssList(U) -> (nil = U <-> segmentP(nil,U)))) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	50 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	51 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & cons(V,nil) = U))))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	52 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	54 (all U (ssList(U) -> (nil != U -> (exists V (ssList(V) & V = tl(U)))))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	58 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	59 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	63 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	65 (all U (ssList(U) -> (all V (ssItem(V) -> nil != cons(V,U))))) # label(ax21) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	67 (all U (ssList(U) -> (all V (ssList(V) -> (U != V <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	68 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	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.42/1.09	73 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	75 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	76 (all U (ssList(U) -> (nil != U -> (exists V (ssItem(V) & V = hd(U)))))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	77 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	79 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	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.42/1.09	82 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	83 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	84 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	85 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
0.42/1.09	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.42/1.09	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> V != X | frontsegP(V,U) & neq(U,nil) | U = nil & V = nil | X != nil & W = nil | (all Y (ssList(Y) -> app(W,Y) != X | -equalelemsP(W) | (exists Z ((exists X1 ((exists X2 (app(X2,cons(Z,nil)) = W & ssList(X2))) & Y = app(cons(Z,nil),X1) & ssList(X1))) & ssItem(Z))))) | W != U)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.42/1.09	
0.42/1.09	============================== end of process non-clausal formulas ===
0.42/1.09	
0.42/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.42/1.09	
0.42/1.09	============================== PREDICATE ELIMINATION =================
0.42/1.09	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.81/1.12	89 equalelemsP(nil) # label(ax74) # label(axiom).  [assumption].
0.81/1.12	90 -ssList(A) | ssItem(f27(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.81/1.12	91 -ssList(A) | ssItem(f28(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.81/1.12	92 -ssList(A) | ssList(f29(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.81/1.12	93 -ssList(A) | ssList(f30(A)) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.81/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.81/1.12	95 -ssList(A) | f28(A) != f27(A) | equalelemsP(A) # label(ax14) # label(axiom).  [clausify(47)].
0.81/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.81/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.81/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.81/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.81/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.81/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.81/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.81/1.12	96 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom).  [clausify(63)].
0.81/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.81/1.12	97 equalelemsP(c5) # label(co1) # label(negated_conjecture).  [clausify(87)].
0.81/1.12	Derived: -ssList(c5) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != c5 | B = A.  [resolve(97,a,88,h)].
0.81/1.12	98 -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.81/1.12	99 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom).  [clausify(10)].
0.81/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(98,b,99,b)].
0.81/1.12	100 -ssList(A) | cyclefreeP(A) | ssItem(f12(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/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(100,b,98,b)].
0.81/1.12	101 -ssList(A) | cyclefreeP(A) | ssItem(f13(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/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(101,b,98,b)].
0.81/1.12	102 -ssList(A) | cyclefreeP(A) | ssList(f14(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/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(102,b,98,b)].
0.81/1.12	103 -ssList(A) | cyclefreeP(A) | ssList(f15(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/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(103,b,98,b)].
0.81/1.12	104 -ssList(A) | cyclefreeP(A) | ssList(f16(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/1.17	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(104,b,98,b)].
0.81/1.17	105 -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.81/1.17	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(105,b,98,b)].
0.81/1.17	106 -ssList(A) | cyclefreeP(A) | leq(f12(A),f13(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/1.17	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(106,b,98,b)].
0.81/1.17	107 -ssList(A) | cyclefreeP(A) | leq(f13(A),f12(A)) # label(ax8) # label(axiom).  [clausify(21)].
0.81/1.17	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(107,b,98,b)].
0.81/1.17	108 cyclefreeP(nil) # label(ax60) # label(axiom).  [assumption].
0.81/1.17	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(108,a,98,b)].
0.81/1.17	109 -ssList(A) | totalorderP(A) | ssItem(f7(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	110 -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.81/1.17	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(109,b,110,b)].
0.81/1.17	111 -ssList(A) | totalorderP(A) | ssItem(f8(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(111,b,110,b)].
0.81/1.17	112 -ssList(A) | totalorderP(A) | ssList(f9(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(112,b,110,b)].
0.81/1.17	113 -ssList(A) | totalorderP(A) | ssList(f10(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(113,b,110,b)].
0.81/1.17	114 -ssList(A) | totalorderP(A) | ssList(f11(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(114,b,110,b)].
0.81/1.17	115 -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.81/1.17	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(115,b,110,b)].
0.81/1.17	116 -ssList(A) | totalorderP(A) | -leq(f8(A),f7(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(116,b,110,b)].
0.81/1.17	117 -ssList(A) | totalorderP(A) | -leq(f7(A),f8(A)) # label(ax9) # label(axiom).  [clausify(20)].
0.81/1.17	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(117,b,110,b)].
0.96/1.23	118 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom).  [clausify(46)].
0.96/1.23	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(118,b,110,b)].
0.96/1.23	119 totalorderP(nil) # label(ax62) # label(axiom).  [assumption].
0.96/1.23	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,110,b)].
0.96/1.23	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(74)].
0.96/1.23	121 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom).  [clausify(28)].
0.96/1.23	122 strictorderP(nil) # label(ax64) # label(axiom).  [assumption].
0.96/1.23	123 -ssList(A) | ssItem(f35(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	124 -ssList(A) | ssItem(f36(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	125 -ssList(A) | ssList(f37(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	126 -ssList(A) | ssList(f38(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	127 -ssList(A) | ssList(f39(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	128 -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.96/1.23	129 -ssList(A) | -lt(f35(A),f36(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	130 -ssList(A) | -lt(f36(A),f35(A)) | strictorderP(A) # label(ax10) # label(axiom).  [clausify(74)].
0.96/1.23	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(120,j,121,b)].
0.96/1.23	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(120,j,122,a)].
0.96/1.23	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(120,j,123,c)].
0.96/1.23	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(120,j,124,c)].
0.96/1.23	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(120,j,125,c)].
0.96/1.23	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(120,j,126,c)].
0.96/1.23	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(120,j,127,c)].
0.96/1.23	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(120,j,128,c)].
0.96/1.23	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(120,j,129,c)].
0.96/1.23	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(120,j,130,c)].
0.96/1.23	131 -ssList(A) | duplicatefreeP(A) | ssItem(f20(A)) # label(ax13) # label(axiom).  [clausify(34)].
0.96/1.23	132 -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)].
2.63/2.91	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(131,b,132,b)].
2.63/2.91	133 -ssList(A) | duplicatefreeP(A) | ssItem(f21(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.63/2.91	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(133,b,132,b)].
2.63/2.91	134 -ssList(A) | duplicatefreeP(A) | ssList(f22(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.63/2.91	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(134,b,132,b)].
2.63/2.91	135 -ssList(A) | duplicatefreeP(A) | ssList(f23(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.63/2.91	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(135,b,132,b)].
2.63/2.91	136 -ssList(A) | duplicatefreeP(A) | ssList(f24(A)) # label(ax13) # label(axiom).  [clausify(34)].
2.63/2.91	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(136,b,132,b)].
2.63/2.91	137 -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.63/2.91	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(137,b,132,b)].
2.63/2.91	138 -ssList(A) | duplicatefreeP(A) | f21(A) = f20(A) # label(ax13) # label(axiom).  [clausify(34)].
2.63/2.91	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(138,b,132,b)].
2.63/2.91	139 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom).  [clausify(50)].
2.63/2.91	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(139,b,132,b)].
2.63/2.91	140 duplicatefreeP(nil) # label(ax72) # label(axiom).  [assumption].
2.63/2.91	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(140,a,132,b)].
2.63/2.91	
2.63/2.91	============================== end predicate elimination =============
2.63/2.91	
2.63/2.91	Auto_denials:  (non-Horn, no changes).
2.63/2.91	
2.63/2.91	Term ordering decisions:
2.63/2.91	Function symbol KB weights:  nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=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.
2.63/2.91	
2.63/2.91	============================== end of process initial clauses ========
2.63/2.91	
2.63/2.91	============================== CLAUSES FOR SEARCH ====================
2.63/2.91	
2.63/2.91	============================== end of clauses for search =============
2.63/2.91	
2.63/2.91	============================== SEARCH ================================
2.63/2.91	
2.63/2.91	% Starting search at 0.58 seconds.
2.63/2.91	
2.63/2.91	Low Water (keep): wt=36.000, iters=3493
2.63/2.91	
2.63/2.91	Low Water (keep): wt=34.000, iters=3469
2.63/2.91	
2.63/2.91	Low Water (keep): wt=33.000, iters=3377
2.63/2.91	
2.63/2.91	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 1.06 sec).
2.63/2.91	
2.63/2.91	Low Water (keep): wt=32.000, iters=3407
2.63/2.91	
2.63/2.91	Low Water (keep): wt=29.000, iters=3417
2.63/2.91	
2.63/2.91	Low Water (keep): wt=23.000, iters=3454
2.63/2.91	
2.63/2.91	Low Water (keep): wt=22.000, iters=3422
2.63/2.91	
2.63/2.91	Low Water (keep): wt=21.000, iters=3432
2.63/2.91	
2.63/2.91	Low Water (keep): wt=20.000, iters=3444
2.63/2.91	
2.63/2.91	Low Water (keep): wt=19.000, iters=3354
2.63/2.91	
2.63/2.91	Low Water (keep): wt=18.000, iters=3751
2.63/2.91	
2.63/2.91	Low Water (keep): wt=17.000, iters=3357
2.63/2.91	
2.63/2.91	Low Water (keep): wt=16.000, iters=3396
2.63/2.91	
2.63/2.91	Low Water (keep): wt=14.000, iters=3438
7.65/7.94	
7.65/7.94	Low Water (displace): id=3382, wt=43.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=3408, wt=41.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=3772, wt=40.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=3448, wt=39.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=3796, wt=38.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=3466, wt=37.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=4661, wt=36.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=4968, wt=35.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=4697, wt=34.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=4935, wt=33.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=13557, wt=13.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=13620, wt=12.000
7.65/7.94	
7.65/7.94	Low Water (keep): wt=13.000, iters=3342
7.65/7.94	
7.65/7.94	Low Water (displace): id=15840, wt=11.000
7.65/7.94	
7.65/7.94	Low Water (keep): wt=12.000, iters=3346
7.65/7.94	
7.65/7.94	Low Water (displace): id=16333, wt=10.000
7.65/7.94	
7.65/7.94	Low Water (keep): wt=11.000, iters=3427
7.65/7.94	
7.65/7.94	Low Water (displace): id=17041, wt=9.000
7.65/7.94	
7.65/7.94	Low Water (displace): id=18562, wt=8.000
7.65/7.94	
7.65/7.94	Low Water (keep): wt=10.000, iters=3345
7.65/7.94	
7.65/7.94	Low Water (displace): id=20950, wt=7.000
7.65/7.94	
7.65/7.94	============================== PROOF =================================
7.65/7.94	% SZS status Theorem
7.65/7.94	% SZS output start Refutation
7.65/7.95	
7.65/7.95	% Proof 1 at 6.72 (+ 0.16) seconds.
7.65/7.95	% Length of proof is 31.
7.65/7.95	% Level of proof is 7.
7.65/7.95	% Maximum clause weight is 14.000.
7.65/7.95	% Given clauses 3268.
7.65/7.95	
7.65/7.95	45 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause).  [assumption].
7.65/7.95	67 (all U (ssList(U) -> (all V (ssList(V) -> (U != V <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
7.65/7.95	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].
7.65/7.95	87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> V != X | frontsegP(V,U) & neq(U,nil) | U = nil & V = nil | X != nil & W = nil | (all Y (ssList(Y) -> app(W,Y) != X | -equalelemsP(W) | (exists Z ((exists X1 ((exists X2 (app(X2,cons(Z,nil)) = W & ssList(X2))) & Y = app(cons(Z,nil),X1) & ssList(X1))) & ssItem(Z))))) | W != U)))))))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
7.65/7.95	181 ssList(nil) # label(ax17) # label(axiom).  [assumption].
7.65/7.95	213 -ssList(A) | frontsegP(A,A) # label(ax42) # label(axiom).  [clausify(45)].
7.65/7.95	244 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # label(axiom).  [clausify(67)].
7.65/7.95	263 -ssList(A) | -ssList(B) | -ssList(C) | -frontsegP(A,B) | frontsegP(app(A,C),B) # label(ax43) # label(axiom).  [clausify(80)].
7.65/7.95	278 ssList(c3) # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	282 c6 = c4 # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	283 -frontsegP(c4,c3) | -neq(c3,nil) # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	284 nil != c3 | nil != c4 # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	285 c3 != nil | c4 != nil.  [copy(284),flip(a),flip(b)].
7.65/7.95	286 nil = c6 | nil != c5 # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	287 c4 = nil | c5 != nil.  [copy(286),rewrite([282(2)]),flip(a),flip(b)].
7.65/7.95	288 ssList(c7) # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	289 app(c5,c7) = c6 # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	290 app(c5,c7) = c4.  [copy(289),rewrite([282(4)])].
7.65/7.95	292 c5 = c3 # label(co1) # label(negated_conjecture).  [clausify(87)].
7.65/7.95	444 -ssList(A) | -ssList(B) | -frontsegP(A,A) | frontsegP(app(A,B),A).  [factor(263,a,b)].
7.65/7.95	456 app(c3,c7) = c4.  [back_rewrite(290),rewrite([292(1)])].
7.65/7.95	457 c4 = nil | c3 != nil.  [back_rewrite(287),rewrite([292(4)])].
7.65/7.95	1701 -ssList(A) | nil = A | neq(A,nil).  [resolve(244,b,181,a)].
7.65/7.95	1770 frontsegP(c3,c3).  [resolve(278,a,213,a)].
7.65/7.95	5000 -ssList(A) | frontsegP(app(c3,A),c3).  [resolve(1770,a,444,c),unit_del(a,278)].
7.65/7.95	15935 c3 = nil | neq(c3,nil).  [resolve(1701,a,278,a),flip(a)].
7.65/7.95	27307 c3 = nil | -frontsegP(c4,c3).  [resolve(15935,b,283,b)].
7.65/7.95	39205 frontsegP(c4,c3).  [resolve(5000,a,288,a),rewrite([456(3)])].
7.65/7.95	39207 c3 = nil.  [back_unit_del(27307),unit_del(b,39205)].
7.65/7.95	39226 c4 = nil.  [back_rewrite(457),rewrite([39207(4)]),xx(b)].
7.65/7.95	39230 $F.  [back_rewrite(285),rewrite([39207(1),39226(4)]),xx(a),xx(b)].
7.65/7.95	
7.65/7.95	% SZS output end Refutation
7.65/7.95	============================== end of proof ==========================
7.65/7.95	
7.65/7.95	============================== STATISTICS ============================
7.65/7.95	
7.65/7.95	Given=3268. Generated=272244. Kept=39041. proofs=1.
7.65/7.95	Usable=2454. Sos=7060. Demods=367. Limbo=23, Disabled=29753. Hints=0.
7.65/7.95	Megabytes=32.97.
7.65/7.95	User_CPU=6.72, System_CPU=0.16, Wall_clock=7.
7.65/7.95	
7.65/7.95	============================== end of statistics =====================
7.65/7.95	
7.65/7.95	============================== end of search =========================
7.65/7.95	
7.65/7.95	THEOREM PROVED
7.65/7.95	% SZS status Theorem
7.65/7.95	
7.65/7.95	Exiting with 1 proof.
7.65/7.95	
7.65/7.95	Process 32484 exit (max_proofs) Wed Jul 14 13:27:07 2021
7.65/7.95	Prover9 interrupted
7.65/7.95	EOF