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.12/0.33	% Computer : n022.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 09:19:59 EDT 2023
0.12/0.33	% CPUTime  : 
0.45/1.14	============================== Prover9 ===============================
0.45/1.14	Prover9 (32) version 2009-11A, November 2009.
0.45/1.14	Process 10966 was started by sandbox2 on n022.cluster.edu,
0.45/1.14	Mon Jul  3 09:19:59 2023
0.45/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_10642_n022.cluster.edu".
0.45/1.14	============================== end of head ===========================
0.45/1.14	
0.45/1.14	============================== INPUT =================================
0.45/1.14	
0.45/1.14	% Reading from file /tmp/Prover9_10642_n022.cluster.edu
0.45/1.14	
0.45/1.14	set(prolog_style_variables).
0.45/1.14	set(auto2).
0.45/1.14	    % set(auto2) -> set(auto).
0.45/1.14	    % set(auto) -> set(auto_inference).
0.45/1.14	    % set(auto) -> set(auto_setup).
0.45/1.14	    % set(auto_setup) -> set(predicate_elim).
0.45/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.14	    % set(auto) -> set(auto_limits).
0.45/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.14	    % set(auto) -> set(auto_denials).
0.45/1.14	    % set(auto) -> set(auto_process).
0.45/1.14	    % set(auto2) -> assign(new_constants, 1).
0.45/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.14	    % set(auto2) -> assign(max_hours, 1).
0.45/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.14	    % set(auto2) -> set(sort_initial_sos).
0.45/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.14	    % set(auto2) -> assign(max_megs, 400).
0.45/1.14	    % set(auto2) -> assign(stats, some).
0.45/1.14	    % set(auto2) -> clear(echo_input).
0.45/1.14	    % set(auto2) -> set(quiet).
0.45/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.14	    % set(auto2) -> clear(print_given).
0.45/1.14	assign(lrs_ticks,-1).
0.45/1.14	assign(sos_limit,10000).
0.45/1.14	assign(order,kbo).
0.45/1.14	set(lex_order_vars).
0.45/1.14	clear(print_given).
0.45/1.14	
0.45/1.14	% formulas(sos).  % not echoed (123 formulas)
0.45/1.14	
0.45/1.14	============================== end of input ==========================
0.45/1.14	
0.45/1.14	% From the command line: assign(max_seconds, 1440).
0.45/1.14	
0.45/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.14	
0.45/1.14	% Formulas that are not ordinary clauses:
0.45/1.14	1 (all X all Y (Y = X | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	2 (all X all Y all W all V (s_e(Y,ext(X,Y,W,V),W,V) & s_t(X,Y,ext(X,Y,W,V)))) # label(aA4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	3 (all X all Y all Z all V all Z2 all V2 (-s_e(X,Y,Z,V) | -s_e(X,Y,Z2,V2) | s_e(Z,V,Z2,V2))) # label(aA2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	4 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(X,V,X1,V1) | -s_e(Y,V,Y1,V1) | s_e(Z,V,Z1,V1) | X = Y | -s_t(X1,Y1,Z1) | -s_t(X,Y,Z) | -s_e(Y,Z,Y1,Z1) | -s_e(X,Y,X1,Y1))) # label(aA5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	5 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	6 (all Xa all Xp all Xc all Xb all Xq ((-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xq,ip(Xa,Xp,Xc,Xb,Xq),Xa)) & (-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xp,ip(Xa,Xp,Xc,Xb,Xq),Xb)))) # label(aA7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	7 (all X all Y all Z (Y = X | -s_e(X,Y,Z,Z))) # label(aA3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	8 (all Xp all Xq all Xr all Xa (Xr = Xp | Xa != Xp | s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xp = Xq)) # label(aSatz6_15d) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	9 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xa,Xc,Xd) | Xc = Xb | -s_t(Xb,Xc,Xd))) # label(aSatz3_7a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	10 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	11 (all Xa all Xp all Xq (Xq = Xp | s(Xa,Xq) != s(Xa,Xp))) # label(aSatz7_9) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	12 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Xa1,Xc1) | s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_t(Xa1,Xb1,Xc1))) # label(aSatz4_3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	13 (all Xa all Xb all Xc all Xa1 all Xb1 (-s_col(Xa,Xb,Xc) | -s_e(Xa,Xb,Xa1,Xb1) | s_e3(Xa,Xb,Xc,Xa1,Xb1,insert5(Xa,Xb,Xc,Xa1,Xb1)))) # label(aSatz4_14) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	14 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_t(Xa1,Xb1,Xc1))) # label(aSatz4_6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	15 (all Xa all Xb all Xc (s_t(Xc,Xb,Xa) | -s_t(Xa,Xb,Xc))) # label(aSatz3_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	16 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | Xa != Xp) & (Xp != Xb | -sameside(Xa,Xp,Xb)) & (c63(Xa,Xp,Xb) != Xp | -sameside(Xa,Xp,Xb)) & (s_t(Xb,Xp,c63(Xa,Xp,Xb)) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | s_t(Xa,Xp,c63(Xa,Xp,Xb))))) # label(aSatz6_3a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	17 (all Xa all Xb all Xc (s_t(Xa,Xb,Xc) | -le(Xa,Xb,Xa,Xc) | -le(Xb,Xc,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	18 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	19 (all Xa all Xp all Xb (Xa = Xb | s(Xb,Xp) != s(Xa,Xp))) # label(aSatz7_18) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	20 (all Xa all Xb all Xc all Xd (le(Xc,Xd,Xa,Xb) | le(Xa,Xb,Xc,Xd))) # label(aSatz5_10) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	21 (all Xa all Xb all Xc all Xd ((-le(Xa,Xb,Xc,Xd) | ext(Xa,Xb,insert(Xa,Xb,Xc,Xd),Xd) = ins(Xc,Xd,Xa,Xb)) & (-le(Xa,Xb,Xc,Xd) | s_e(Xa,ins(Xc,Xd,Xa,Xb),Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | s_t(Xa,Xb,ins(Xc,Xd,Xa,Xb))))) # label(aSatz5_5a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	22 (all Xp all Xq all Xr all Xcs all Xa (s_e(Xp,Xq,Xr,Xcs) | -s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)))) # label(aSatz7_16b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	23 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | le(Xb,Xc,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12a2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	24 (all Xp all Xq all Xr all Xa (-s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr)) | s_t(Xp,Xq,Xr))) # label(aSatz7_15b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	25 (all Xa all Xp all Xb all Xc (sameside(Xa,Xp,Xc) | -sameside(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb))) # label(aSatz6_7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	26 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | -s_t(Xp,Xa,Xb) | le(Xp,Xa,Xp,Xb))) # label(aSatz6_13b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	27 (all Xa all Xp all Xb all Xc (sameside(Xa,Xp,Xb) | -s_t(Xb,Xp,Xc) | -s_t(Xa,Xp,Xc) | Xc = Xp | Xp = Xb | Xp = Xa)) # label(aSatz6_2a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	28 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_t(Xa,Xb,Xc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_t(Za,Zb,Zc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_e(Xa,Xc,Za,Zc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xd,Za,Zd)) & (-s_t(Xa,Xb,Xc) | -s_t(Za,Zb,Zc) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xc,Xd,Zc,Zd) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xb,Xc,Zb,Zc) | -s_e(Xa,Xc,Za,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xc,Xd,Zc,Zd)) & (s_e(Xb,Xc,Zb,Zc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn4_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	29 (all Xa all Xb all Xd all Xc (s_t(Xa,Xc,Xd) | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	30 (all Xp all Xq all Xr all Xa (s_col(Xa,Xp,Xq) | -sameside(Xa,Xp,Xr) | -s_t(Xq,Xp,Xr) | Xp = Xr | Xp = Xq)) # label(aSatz6_15c) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	31 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | -le(Xp,Xa,Xp,Xb) | s_t(Xp,Xa,Xb))) # label(aSatz6_13a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	32 (all Xb all Xa ext(Xa,Xb,alpha,gamma) != Xb) # label(aSatz3_14b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	33 (all Xa all Xb all Xc all Xa1 all Xc1 ((-s_e(Xa,Xc,Xa1,Xc1) | s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_t(Xa,Xb,Xc)) & (-s_t(Xa,Xb,Xc) | s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1)))) # label(aSatz4_5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.14	34 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 ((s_m(Xa1,Xm1,Xb1) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_m(Xa2,Xm2,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_t(Xb1,Xc,Xb2) | -s_e(Xc,Xa1,Xc,Xb1) | -s_m(Xa1,Xm1,Xb1) | s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | -s_m(Xa2,Xm2,Xb2) | -s_e(Xc,Xa2,Xc,Xb2) | -s_t(Xa1,Xc,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_e(Xc,Xa2,Xc,Xb2)) & (s_e(Xc,Xa1,Xc,Xb1) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_t(Xb1,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_t(Xa1,Xc,Xa2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)))) # label(d_Defn7_23) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	35 (all Xa all Xb all Xc (s_col(Xc,Xb,Xa) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11c) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	36 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xa,Xc,Xb))) # label(aSatz4_11e) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	37 (all Xa1 all Xa2 all Xa3 all Xb1 all Xb2 all Xb3 ((-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa2,Xa3,Xb2,Xb3)) & (-s_e(Xa2,Xa3,Xb2,Xb3) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa1,Xa3,Xb1,Xb3) | -s_e(Xa1,Xa2,Xb1,Xb2)) & (s_e(Xa1,Xa3,Xb1,Xb3) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa2,Xb1,Xb2)))) # label(d_Defn4_4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	38 (all Xa all Xb all Xc all Xd (s_e(Xb,Xa,Xc,Xd) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	39 (all Xa all Xb all Xc all Xd all Xe (-s_e(Xa,Xe,Xc,Xd) | -s_t(Xa,Xb,Xe) | le(Xa,Xb,Xc,Xd))) # label(aSatz5_5b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	40 (all Xa all Xm (-s_m(Xa,Xm,Xa) | Xm = Xa)) # label(aSatz7_3a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	41 (all Xa all Xp all Xb ((-s_t(Xp,Xb,Xa) | sameside(Xa,Xp,Xb) | Xb = Xp | Xp = Xa) & (-s_t(Xp,Xa,Xb) | xb = Xp | sameside(Xa,Xp,Xb) | Xa = Xp) & (s_t(Xp,Xa,Xb) | s_t(Xp,Xb,Xa) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | Xp != Xb) & (-sameside(Xa,Xp,Xb) | Xp != Xa))) # label(d_Defn6_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	42 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_t(Xa1,Xb1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1))) # label(aSatz2_11) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	43 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | s_col(Xa,Xp,Xb)))) # label(aSatz6_4a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	44 (all Xa all Xb all Xc all Xd (s_t(Xa,Xb,Xd) | Xc = Xb | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	45 (all Xa all Xm (Xm != Xa | s_m(Xa,Xm,Xa))) # label(aSatz7_3b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	46 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	47 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xc,Xd) | s_t(Xa,Xc,Xb) | s_t(Xa,Xb,Xc) | -s_t(Xa,Xb,Xd))) # label(aSatz5_3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	48 (all Xa all Xb all Xc ((s_t(Xa,Xb,Xc) | s_t(Xb,Xc,Xa) | s_t(Xc,Xa,Xb) | -s_col(Xa,Xb,Xc)) & (s_col(Xa,Xb,Xc) | -s_t(Xa,Xb,Xc)) & (-s_t(Xc,Xa,Xb) | s_col(Xa,Xb,Xc)) & (-s_t(Xb,Xc,Xa) | s_col(Xa,Xb,Xc)))) # label(d_Defn4_10) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	49 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | -s_t(Xb,Xa,Xc) | Xa = Xb)) # label(aSatz3_4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	50 (all Xa all Xp all Xr all Xq (Xr != s(Xa,Xq) | Xq = Xp | s(Xa,Xp) != Xr)) # label(aSatz7_8) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	51 (all Xa all Xc all Xb all Xc1 (-s_t(Xa,Xc,Xb) | -s_e(Xb,Xc,Xb,Xc1) | Xc = Xc1 | -s_e(Xa,Xc,Xa,Xc1))) # label(aSatz4_19) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	52 (all Xa all Xb all Xc all Xd all Xe all Xf (-le(Xa,Xb,Xc,Xd) | le(Xa,Xb,Xe,Xf) | -le(Xc,Xd,Xe,Xf))) # label(aSatz5_8) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	53 (all Xa all Xb all Xa1 all Xc1 ext(ext(Xc1,Xa1,alpha,gamma),Xa1,Xa,Xb) = insert(Xa,Xb,Xa1,Xc1)) # label(d_insert) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	54 (all Xr all Xa all Xb all Xc ((s_e(Xa,insert(Xb,Xc,Xa,Xr),Xb,Xc) | Xc = Xb | Xa = Xr) & (Xr = Xa | sameside(insert(Xb,Xc,Xa,Xr),Xa,Xr) | Xb = Xc))) # label(aSatz6_11a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	55 (all Xp all Xq all Xr all Xa (Xp = Xa | sameside(Xa,Xp,Xq) | sameside(Xa,Xp,Xr) | -s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xr = Xp | Xq = Xp)) # label(aSatz6_15a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	56 (all Xa all Xb all Xc all Xd (s_t(Xa,Xb,Xd) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_6b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	57 (all Xa all Xp (Xa = Xp | sameside(Xa,Xp,Xa))) # label(aSatz6_5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	58 (all Xa all Xb all Xp all Xq all Xc all Xd all Xe (Xq = Xp | -s_col(Xa,Xb,Xd) | -s_col(Xp,Xq,Xd) | s_col(Xp,Xq,Xe) | -s_col(Xa,Xb,Xe) | Xc = Xd | -s_col(Xp,Xq,Xc) | -s_col(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz6_21) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	59 (all Xa all Xb all Xp all Xq all Xr (-s_col(Xp,Xq,Xa) | -s_col(Xp,Xq,Xr) | s_col(Xa,Xb,Xr) | -s_col(Xp,Xq,Xb) | Xp = Xq | Xa = Xb)) # label(aSatz6_18) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	60 (all Xa all Xb all Xc (s_col(Xb,Xa,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11d) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	61 (all Xa all Xm all Xb (-s_m(Xa,Xm,Xb) | s_m(Xb,Xm,Xa))) # label(aSatz7_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	62 (all Xa all Xb all Xc all Xd all Xe all Xf (-s_e(Xc,Xd,Xe,Xf) | s_e(Xa,Xb,Xe,Xf) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	63 (all Xa all Xb all Xc (s_col(Xb,Xc,Xa) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	64 (all Xa all Xb (Xb = Xa | -s_col(Xa,Xb,pointOffLine(Xa,Xb)))) # label(aSatz6_25) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	65 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xc,Xd,Xa,Xb))) # label(aSatz2_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	66 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	67 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_t(Xa,Xb,Xc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_t(Za,Zb,Zc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_e(Xb,Xd,Zb,Zd) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xb,Xc,Zb,Zc) | -s_e(Xb,Xd,Zb,Zd) | s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xa,Xb,Za,Zb) | -s_t(Za,Zb,Zc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xd,Za,Zd)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xb,Za,Zb)))) # label(d_Defn2_10) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	68 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	69 (all Xa all Xc all Xd le(Xa,Xa,Xc,Xd)) # label(aSatz5_11) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	70 (all Xp all Xq all Xr all Xcs all Xa (-s_e(Xp,Xq,Xr,Xcs) | s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)))) # label(aSatz7_16a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	71 (all Xq all Xa all Xd all Xb all Xc (Xq = Xa | ext(Xq,Xa,Xb,Xc) = Xd | -s_e(Xa,Xd,Xb,Xc) | -s_t(Xq,Xa,Xd))) # label(aSatz2_12) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	72 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | le(Xa,Xb,Xa,Xc) | -s_t(Xa,Xb,Xc))) # label(aSatz5_12a1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	73 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_e(Xa,Xb,Xa1,Xb1) | le(Xa1,Xb1,Xc1,Xd1) | -s_e(Xc,Xd,Xc1,Xd1) | -le(Xa,Xb,Xc,Xd))) # label(aSatz5_6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	74 (all Xa all Xb all Xc all Xp all Xq (Xb = Xa | -s_col(Xa,Xb,Xc) | -s_e(Xa,Xp,Xa,Xq) | -s_e(Xb,Xp,Xb,Xq) | s_e(Xc,Xp,Xc,Xq))) # label(aSatz4_17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	75 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xd,Xc))) # label(aSatz2_5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	76 (all Xp all Xq all Xr all Xa (-s_t(Xp,Xq,Xr) | s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr)))) # label(aSatz7_15a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	77 (all Xp all Xa all Xr all Xq (Xr = Xq | -s_m(Xp,Xa,Xq) | -s_m(Xp,Xa,Xr))) # label(aSatz7_4b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	78 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xb,Xa,Xd,Xc))) # label(aSatz2_14) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	79 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	80 (all Xp all Xq all Xr (Xp = Xq | -s_col(Xp,Xq,Xr) | s_col(Xq,Xp,Xr))) # label(aSatz6_17b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	81 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((-s_t(Xa,Xb,Xc) | -s_t(Xa,Xp,Xa1) | s_t(Xp,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xc) | -s_t(Xa1,Xb1,Xc)) & (-s_t(Xa,Xb,Xc) | s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1) | -s_t(Xa,Xp,Xa1) | -s_t(Xa1,Xb1,Xc)))) # label(aSatz3_17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	82 (all Xp all Xa all Xq (s(Xa,Xp) = Xq | -s_m(Xp,Xa,Xq))) # label(aSatz7_6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	83 (all Xa all Xm all Xb ((s_t(Xa,Xm,Xb) | -s_m(Xa,Xm,Xb)) & (s_m(Xa,Xm,Xb) | -s_e(Xm,Xa,Xm,Xb) | -s_t(Xa,Xm,Xb)) & (-s_m(Xa,Xm,Xb) | s_e(Xm,Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	84 (all Xa all Xb all Xc all XA all XB all XC (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xb,XB,XC) | s_e(Xa,Xc,XA,XC) | -s_e(Xb,Xc,XA,XB) | -s_t(XA,XB,XC))) # label(aSatz2_15) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	85 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xc,Xd,Xc1,Xd1) | Xa = Xb)) # label(aSatz4_16) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	86 (all Xa all Xp all Xb all Xc (sameside(Xa,Xp,Xb) | Xp = Xa | Xc = Xp | -s_t(Xa,Xp,Xc) | -s_t(Xb,Xp,Xc) | Xp = Xb)) # label(aSatz6_3b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	87 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	88 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-sameside(Xa1,Xb1,Xc1) | -s_e(Xb,Xa,Xb1,Xa1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -sameside(Xa,Xb,Xc))) # label(aSatz6_28) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	89 (all Xa all Xp all Xb all Xc (s_t(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xc) | Xp = Xc | Xp = Xb | Xa = Xp)) # label(aSatz6_2b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	90 (all Xp all Xq (Xp = Xq | s_col(Xp,Xq,Xp))) # label(aSatz6_17a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	91 (all Xa all Xb all Xc all Xc1 (Xa = Xb | -s_col(Xa,Xb,Xc) | -s_e(Xa,Xc,Xa,Xc1) | -s_e(Xb,Xc,Xb,Xc1) | Xc1 = Xc)) # label(aSatz4_18) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	92 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (s_e(Xb,Xd,Xb1,Xd1) | -s_ifs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1))) # label(aSatz4_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	93 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xc,Xa,Xb))) # label(aSatz4_11b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	94 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | sameside(Xb,Xp,Xa))) # label(aSatz6_6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	95 (all Xa all Xp all Xb (-s_col(Xa,Xp,Xb) | s_t(Xa,Xp,Xb) | sameside(Xa,Xp,Xb))) # label(aSatz6_4b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	96 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	97 (all Xp all Xa all Xq all Xb (-s_m(Xp,Xa,Xq) | -s_m(Xp,Xb,Xq) | Xb = Xa)) # label(aSatz7_17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	98 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_col(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_col(Xa1,Xb1,Xc1))) # label(aSatz4_13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	99 (all Xb all Xc all Xa (Xb = Xc | -s_e(Xb,Xc,Xa,Xa))) # label(aSatz2_13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	100 (all Xa all Xb all Xc all Xd all Y ((-s_t(Xc,Y,Xd) | -s_e(Xa,Xb,Xc,Y) | le(Xa,Xb,Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xc,insert(Xa,Xb,Xc,Xd))) & (-le(Xa,Xb,Xc,Xd) | s_t(Xc,insert(Xa,Xb,Xc,Xd),Xd)))) # label(d_Defn5_4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	101 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xb,Xd) | -s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xc))) # label(aSatz3_5a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	102 (all Xr all Xa all Xb all Xc all Xp all Xq (Xr = Xa | Xb = Xc | -sameside(Xq,Xa,Xr) | Xq = Xp | -s_e(Xa,Xq,Xb,Xc) | -s_e(Xa,Xp,Xb,Xc) | -sameside(Xp,Xa,Xr))) # label(aSatz6_11b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	103 (all Xp all Xq all Xcs all Xr (Xq = Xp | Xp = Xcs | -s_col(Xp,Xq,Xr) | s_col(Xp,Xcs,Xr) | -s_col(Xp,Xq,Xcs))) # label(aSatz6_16b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	104 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xb,Xc,Xd) | -s_t(Xa,Xc,Xd))) # label(aSatz3_6a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	105 (all Xa all Xb all Xc all Xd (Xa = Xb | s_t(Xc,Xd,Xb) | s_t(Xd,Xc,Xb) | -s_t(Xd,Xa,Xb) | -s_t(Xc,Xa,Xb))) # label(aSatz6_16a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	106 (all Xa all Xb all Xc all Xd (Xa = Xb | -s_t(Xa,Xb,Xd) | s_t(Xb,Xd,Xc) | s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz5_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	107 (all Xa all Xp (Xp != s(Xa,Xp) | Xp = Xa)) # label(aSatz7_10a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	108 (all Xp all Xq all Xa s_e(Xp,Xq,s(Xa,Xp),s(Xa,Xq))) # label(aSatz7_13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	109 (all Xa all Xb all Xc all Xd (-le(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xc,Xd) | -le(Xc,Xd,Xa,Xb))) # label(aSatz5_9) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	110 (all Xa all Xb all Xc (-s_e(Xa,Xc,Xa,Xb) | Xc = Xb | -s_t(Xa,Xb,Xc))) # label(aNarbouxLemma1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	111 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 ((s_col(Xa,Xb,Xc) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (s_e(Xa,Xd,Xa1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (-s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_e(Xa,Xd,Xa1,Xd1) | -s_e(Xb,Xd,Xb1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_col(Xa,Xb,Xc)) & (s_e(Xb,Xd,Xb1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)))) # label(d_Defn4_15) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	112 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	113 (all Xa all Xp (s(Xa,Xp) = Xp | Xp != Xa)) # label(aSatz7_10b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	114 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	115 (all Xa all Xb all Xc all Xd (Xa = Xb | -s_t(Xa,Xb,Xc) | -s_t(Xa,Xb,Xd) | s_t(Xa,Xd,Xc) | s_t(Xa,Xc,Xd))) # label(aSatz5_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	116 (all Xp all Xq all Xr all Xa (Xp = Xq | Xr = Xp | -sameside(Xa,Xp,Xq) | s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr))) # label(aSatz6_15b) # label(axiom) # label(non_clause).  [assumption].
0.45/1.15	117 -(all Xa all Xb all Xp (s(Xa,s(Xb,Xp)) != s(Xb,s(Xa,Xp)) | Xb = Xa)) # label(aSatz7_19) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.15	
0.45/1.15	============================== end of process non-clausal formulas ===
0.45/1.15	
0.45/1.15	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.15	
0.45/1.15	============================== PREDICATE ELIMINATION =================
0.45/1.15	118 -s_t(A,B,C) | -s_e3(A,B,C,D,E,F) | s_t(D,E,F) # label(aSatz4_6) # label(axiom).  [clausify(14)].
0.45/1.15	119 -s_col(A,B,C) | -s_e(A,B,D,E) | s_e3(A,B,C,D,E,insert5(A,B,C,D,E)) # label(aSatz4_14) # label(axiom).  [clausify(13)].
0.45/1.15	Derived: -s_t(A,B,C) | s_t(D,E,insert5(A,B,C,D,E)) | -s_col(A,B,C) | -s_e(A,B,D,E).  [resolve(118,b,119,c)].
0.45/1.15	120 -s_e(A,B,C,D) | s_e3(A,E,B,C,insert(A,E,C,D),D) | -s_t(A,E,B) # label(aSatz4_5) # label(axiom).  [clausify(33)].
0.45/1.15	121 -s_e3(A,B,C,D,E,F) | s_e(B,C,E,F) # label(d_Defn4_4) # label(axiom).  [clausify(37)].
0.45/1.15	Derived: s_e(A,B,C,insert5(D,A,B,E,C)) | -s_col(D,A,B) | -s_e(D,A,E,C).  [resolve(121,a,119,c)].
0.45/1.15	Derived: s_e(A,B,insert(C,A,D,E),E) | -s_e(C,B,D,E) | -s_t(C,A,B).  [resolve(121,a,120,b)].
0.45/1.15	122 -s_e(A,B,C,D) | s_e3(E,A,B,F,C,D) | -s_e(E,B,F,D) | -s_e(E,A,F,C) # label(d_Defn4_4) # label(axiom).  [clausify(37)].
0.45/1.16	Derived: -s_e(A,B,C,D) | -s_e(E,B,F,D) | -s_e(E,A,F,C) | -s_t(E,A,B) | s_t(F,C,D).  [resolve(122,b,118,b)].
0.45/1.16	123 s_e(A,B,C,D) | -s_e3(A,E,B,C,F,D) # label(d_Defn4_4) # label(axiom).  [clausify(37)].
0.45/1.16	Derived: s_e(A,B,C,insert5(A,D,B,C,E)) | -s_col(A,D,B) | -s_e(A,D,C,E).  [resolve(123,b,119,c)].
0.45/1.16	124 -s_e3(A,B,C,D,E,F) | s_e(A,B,D,E) # label(d_Defn4_4) # label(axiom).  [clausify(37)].
0.45/1.16	Derived: s_e(A,B,C,insert(A,B,C,D)) | -s_e(A,E,C,D) | -s_t(A,B,E).  [resolve(124,a,120,b)].
0.45/1.16	125 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | s_col(D,E,F) # label(aSatz4_13) # label(axiom).  [clausify(98)].
0.45/1.16	Derived: -s_col(A,B,C) | s_col(D,E,insert5(A,B,C,D,E)) | -s_col(A,B,C) | -s_e(A,B,D,E).  [resolve(125,b,119,c)].
0.45/1.16	Derived: -s_col(A,B,C) | s_col(D,insert(A,B,D,E),E) | -s_e(A,C,D,E) | -s_t(A,B,C).  [resolve(125,b,120,b)].
0.45/1.16	Derived: -s_col(A,B,C) | s_col(D,E,F) | -s_e(B,C,E,F) | -s_e(A,C,D,F) | -s_e(A,B,D,E).  [resolve(125,b,122,b)].
0.45/1.16	126 -s_e3(A,B,C,D,E,F) | -s_e(A,V6,D,V7) | -s_e(B,V6,E,V7) | s_fs(A,B,C,V6,D,E,F,V7) | -s_col(A,B,C) # label(d_Defn4_15) # label(axiom).  [clausify(111)].
0.45/1.16	Derived: -s_e(A,B,C,D) | -s_e(E,B,F,D) | s_fs(A,E,V6,B,C,F,insert5(A,E,V6,C,F),D) | -s_col(A,E,V6) | -s_col(A,E,V6) | -s_e(A,E,C,F).  [resolve(126,a,119,c)].
0.45/1.16	Derived: -s_e(A,B,C,D) | -s_e(E,B,insert(A,E,C,F),D) | s_fs(A,E,V6,B,C,insert(A,E,C,F),F,D) | -s_col(A,E,V6) | -s_e(A,V6,C,F) | -s_t(A,E,V6).  [resolve(126,a,120,b)].
0.45/1.16	Derived: -s_e(A,B,C,D) | -s_e(E,B,F,D) | s_fs(A,E,V6,B,C,F,V7,D) | -s_col(A,E,V6) | -s_e(E,V6,F,V7) | -s_e(A,V6,C,V7) | -s_e(A,E,C,F).  [resolve(126,a,122,b)].
0.45/1.16	127 -s_fs(A,B,C,D,E,F,V6,V7) | s_e3(A,B,C,E,F,V6) # label(d_Defn4_15) # label(axiom).  [clausify(111)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | -s_t(A,B,C) | s_t(E,F,V6).  [resolve(127,b,118,b)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6).  [resolve(127,b,121,a)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6).  [resolve(127,b,123,b)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F).  [resolve(127,b,124,a)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | -s_col(A,B,C) | s_col(E,F,V6).  [resolve(127,b,125,b)].
0.45/1.16	Derived: -s_fs(A,B,C,D,E,F,V6,V7) | -s_e(A,V8,E,V9) | -s_e(B,V8,F,V9) | s_fs(A,B,C,V8,E,F,V6,V9) | -s_col(A,B,C).  [resolve(127,b,126,a)].
0.45/1.16	128 -s_t(A,B,C) | -s_t(D,E,F) | -s_e(A,V6,D,V7) | -s_e(C,V6,F,V7) | s_ifs(A,B,C,V6,D,E,F,V7) | -s_e(B,C,E,F) | -s_e(A,C,D,F) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	129 s_t(A,B,C) | -s_ifs(A,B,C,D,E,F,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	130 s_t(A,B,C) | -s_ifs(D,E,F,V6,A,B,C,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	131 s_e(A,B,C,D) | -s_ifs(A,E,B,F,C,V6,D,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	132 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	133 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(C,D,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	134 s_e(A,B,C,D) | -s_ifs(E,A,B,F,V6,C,D,V7) # label(d_Defn4_1) # label(axiom).  [clausify(28)].
0.45/1.16	135 s_e(A,B,C,D) | -s_ifs(E,A,F,B,V6,C,V7,D) # label(aSatz4_2) # label(axiom).  [clausify(92)].
0.45/1.16	Derived: s_e(A,B,C,D) | -s_t(E,A,F) | -s_t(V6,C,V7) | -s_e(E,B,V6,D) | -s_e(F,B,V7,D) | -s_e(A,F,C,V7) | -s_e(E,F,V6,V7).  [resolve(135,b,128,e)].
0.45/1.16	136 -s_t(A,B,C) | -s_e(B,D,B,A) | -s_m(D,E,A) | s_kf(D,E,A,B,C,F,V6) | -s_m(V6,F,C) | -s_e(B,V6,B,C) | -s_t(D,B,V6) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	137 s_m(A,B,C) | -s_kf(A,B,C,D,E,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	138 s_m(A,B,C) | -s_kf(D,E,F,V6,C,B,A) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	139 -s_kf(A,B,C,D,E,F,V6) | s_e(D,V6,D,E) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	140 s_e(A,B,A,C) | -s_kf(B,D,C,A,E,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	141 s_t(A,B,C) | -s_kf(D,E,A,B,C,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	142 s_t(A,B,C) | -s_kf(A,D,E,B,F,V6,C) # label(d_Defn7_23) # label(axiom).  [clausify(34)].
0.45/1.16	143 -s_t(A,B,C) | -s_e(B,C,D,E) | -s_e(B,F,D,V6) | s_afs(A,B,C,F,V7,D,E,V6) | -s_e(A,F,V7,V6) | -s_e(A,B,V7,D) | -s_t(V7,D,E) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	144 s_t(A,B,C) | -s_afs(A,B,C,D,E,F,V6,V7) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	145 s_t(A,B,C) | -s_afs(D,E,F,V6,A,B,C,V7) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	146 s_e(A,B,C,D) | -s_afs(E,A,F,B,V6,C,V7,D) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	147 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	148 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	149 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F) # label(d_Defn2_10) # label(axiom).  [clausify(67)].
3.79/4.09	
3.79/4.09	============================== end predicate elimination =============
3.79/4.09	
3.79/4.09	Auto_denials:  (non-Horn, no changes).
3.79/4.09	
3.79/4.09	Term ordering decisions:
3.79/4.09	Function symbol KB weights:  alpha=1. gamma=1. xb=1. beta=1. c1=1. c2=1. c3=1. s=1. pointOffLine=1. c63=1. insert=1. ext=1. ins=1. insert5=1. ip=1. crossbar=1.
3.79/4.09	
3.79/4.09	============================== end of process initial clauses ========
3.79/4.09	
3.79/4.09	============================== CLAUSES FOR SEARCH ====================
3.79/4.09	
3.79/4.09	============================== end of clauses for search =============
3.79/4.09	
3.79/4.09	============================== SEARCH ================================
3.79/4.09	
3.79/4.09	% Starting search at 0.06 seconds.
3.79/4.09	
3.79/4.09	Low Water (keep): wt=50.000, iters=3501
3.79/4.09	
3.79/4.09	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 48 (0.00 of 0.73 sec).
3.79/4.09	
3.79/4.09	Low Water (keep): wt=47.000, iters=3501
3.79/4.09	
3.79/4.09	Low Water (keep): wt=45.000, iters=3460
3.79/4.09	
3.79/4.09	Low Water (keep): wt=43.000, iters=3346
3.79/4.09	
3.79/4.09	Low Water (keep): wt=42.000, iters=3391
3.79/4.09	
3.79/4.09	Low Water (keep): wt=41.000, iters=3423
3.79/4.09	
3.79/4.09	Low Water (keep): wt=39.000, iters=3373
3.79/4.09	
3.79/4.09	Low Water (keep): wt=38.000, iters=3333
3.79/4.09	
3.79/4.09	Low Water (keep): wt=37.000, iters=3389
3.79/4.09	
3.79/4.09	Low Water (keep): wt=36.000, iters=3417
3.79/4.09	
3.79/4.09	Low Water (keep): wt=34.000, iters=3335
3.79/4.09	
3.79/4.09	Low Water (keep): wt=33.000, iters=3388
3.79/4.09	
3.79/4.09	Low Water (keep): wt=32.000, iters=3360
3.79/4.09	
3.79/4.09	Low Water (keep): wt=31.000, iters=3434
3.79/4.09	
3.79/4.09	Low Water (keep): wt=30.000, iters=3351
3.79/4.09	
3.79/4.09	Low Water (keep): wt=29.000, iters=3333
3.79/4.09	
3.79/4.09	Low Water (keep): wt=28.000, iters=3334
3.79/4.09	
3.79/4.09	Low Water (keep): wt=27.000, iters=3378
3.79/4.09	
3.79/4.09	Low Water (keep): wt=26.000, iters=3393
3.79/4.09	
3.79/4.09	Low Water (keep): wt=25.000, iters=3333
3.79/4.09	
3.79/4.09	Low Water (keep): wt=24.000, iters=3406
3.79/4.09	
3.79/4.09	Low Water (keep): wt=23.000, iters=3340
3.79/4.09	
3.79/4.09	Low Water (keep): wt=22.000, iters=3373
3.79/4.09	
3.79/4.09	Low Water (displace): id=3936, wt=98.000
3.79/4.09	
3.79/4.09	Low Water (displace): id=2715, wt=90.000
3.79/4.09	
3.79/4.09	Low Water (displace): id=11833, wt=13.000
3.79/4.09	
3.79/4.09	Low Water (keep): wt=21.000, iters=3346
3.79/4.09	
3.79/4.09	Low Water (displace): id=12476, wt=12.000
3.79/4.09	
3.79/4.09	Low Water (keep): wt=20.000, iters=5779
3.79/4.09	
3.79/4.09	Low Water (keep): wt=18.000, iters=4495
3.79/4.09	
3.79/4.09	Low Water (keep): wt=17.000, iters=4179
3.79/4.09	
3.79/4.09	Low Water (keep): wt=16.000, iters=3586
3.79/4.09	
3.79/4.09	Low Water (displace): id=15773, wt=11.000
3.79/4.09	
3.79/4.09	Low Water (keep): wt=15.000, iters=3536
3.79/4.09	
3.79/4.09	============================== PROOF =================================
3.79/4.09	% SZS status Theorem
3.79/4.09	% SZS output start Refutation
3.79/4.09	
3.79/4.09	% Proof 1 at 2.86 (+ 0.11) seconds.
3.79/4.09	% Length of proof is 34.
3.79/4.09	% Level of proof is 7.
3.79/4.09	% Maximum clause weight is 18.000.
3.79/4.09	% Given clauses 2640.
3.79/4.09	
3.79/4.09	10 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	19 (all Xa all Xp all Xb (Xa = Xb | s(Xb,Xp) != s(Xa,Xp))) # label(aSatz7_18) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	70 (all Xp all Xq all Xr all Xcs all Xa (-s_e(Xp,Xq,Xr,Xcs) | s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)))) # label(aSatz7_16a) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	76 (all Xp all Xq all Xr all Xa (-s_t(Xp,Xq,Xr) | s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr)))) # label(aSatz7_15a) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	83 (all Xa all Xm all Xb ((s_t(Xa,Xm,Xb) | -s_m(Xa,Xm,Xb)) & (s_m(Xa,Xm,Xb) | -s_e(Xm,Xa,Xm,Xb) | -s_t(Xa,Xm,Xb)) & (-s_m(Xa,Xm,Xb) | s_e(Xm,Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	87 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	97 (all Xp all Xa all Xq all Xb (-s_m(Xp,Xa,Xq) | -s_m(Xp,Xb,Xq) | Xb = Xa)) # label(aSatz7_17) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	113 (all Xa all Xp (s(Xa,Xp) = Xp | Xp != Xa)) # label(aSatz7_10b) # label(axiom) # label(non_clause).  [assumption].
3.79/4.09	117 -(all Xa all Xb all Xp (s(Xa,s(Xb,Xp)) != s(Xb,s(Xa,Xp)) | Xb = Xa)) # label(aSatz7_19) # label(negated_conjecture) # label(non_clause).  [assumption].
3.79/4.09	164 s(A,s(A,B)) = B # label(aSatz7_7) # label(axiom).  [clausify(10)].
3.79/4.09	176 A = B | s(A,C) != s(B,C) # label(aSatz7_18) # label(axiom).  [clausify(19)].
3.79/4.09	237 -s_e(A,B,C,D) | s_e(s(E,A),s(E,B),s(E,C),s(E,D)) # label(aSatz7_16a) # label(axiom).  [clausify(70)].
3.79/4.09	243 -s_t(A,B,C) | s_t(s(D,A),s(D,B),s(D,C)) # label(aSatz7_15a) # label(axiom).  [clausify(76)].
3.79/4.09	249 s_t(A,B,C) | -s_m(A,B,C) # label(d_Defn7_1) # label(axiom).  [clausify(83)].
3.79/4.09	250 s_m(A,B,C) | -s_e(B,A,B,C) | -s_t(A,B,C) # label(d_Defn7_1) # label(axiom).  [clausify(83)].
3.79/4.09	251 -s_m(A,B,C) | s_e(B,A,B,C) # label(d_Defn7_1) # label(axiom).  [clausify(83)].
3.79/4.09	254 s_m(A,B,s(B,A)) # label(aSatz7_4a) # label(axiom).  [clausify(87)].
3.79/4.09	262 -s_m(A,B,C) | -s_m(A,D,C) | D = B # label(aSatz7_17) # label(axiom).  [clausify(97)].
3.79/4.09	283 s(A,B) = B | B != A # label(aSatz7_10b) # label(axiom).  [clausify(113)].
3.79/4.09	286 s(c2,s(c1,c3)) = s(c1,s(c2,c3)) # label(aSatz7_19) # label(negated_conjecture).  [clausify(117)].
3.79/4.09	287 c2 != c1 # label(aSatz7_19) # label(negated_conjecture).  [clausify(117)].
3.79/4.09	527 s_e(A,B,A,s(A,B)).  [resolve(254,a,251,a)].
3.79/4.09	528 s_t(A,B,s(B,A)).  [resolve(254,a,249,b)].
3.79/4.09	552 -s_m(A,B,s(C,A)) | C = B.  [resolve(262,b,254,a)].
3.79/4.09	611 s(A,A) = A.  [resolve(283,b,164,a),rewrite([164(2),164(3)])].
3.79/4.09	627 s(c2,s(c1,s(c2,c3))) = s(c1,c3).  [para(286(a,1),164(a,1,2))].
3.79/4.09	871 A = B | s(A,B) != B.  [para(611(a,1),176(b,2))].
3.79/4.09	901 s_t(s(A,B),s(A,C),s(A,s(C,B))).  [resolve(528,a,243,a)].
3.79/4.09	1144 s_e(s(A,B),s(A,C),s(A,B),s(A,s(B,C))).  [resolve(527,a,237,a)].
3.79/4.09	21756 s_t(c3,s(c2,c1),s(c1,c3)).  [para(627(a,1),901(a,3)),rewrite([164(5)])].
3.79/4.09	25053 s_e(s(c2,c1),c3,s(c2,c1),s(c1,c3)).  [para(627(a,1),1144(a,4)),rewrite([164(8)])].
3.79/4.09	25072 s_m(c3,s(c2,c1),s(c1,c3)).  [resolve(25053,a,250,b),unit_del(b,21756)].
3.79/4.09	25077 s(c2,c1) = c1.  [resolve(25072,a,552,a),flip(a)].
3.79/4.09	25191 $F.  [resolve(25077,a,871,b),unit_del(a,287)].
3.79/4.09	
3.79/4.09	% SZS output end Refutation
3.79/4.09	============================== end of proof ==========================
3.79/4.09	
3.79/4.09	============================== STATISTICS ============================
3.79/4.09	
3.79/4.09	Given=2640. Generated=204843. Kept=25029. proofs=1.
3.79/4.09	Usable=2380. Sos=9859. Demods=52. Limbo=0, Disabled=12981. Hints=0.
3.79/4.09	Megabytes=13.52.
3.79/4.09	User_CPU=2.86, System_CPU=0.11, Wall_clock=3.
3.79/4.09	
3.79/4.09	============================== end of statistics =====================
3.79/4.09	
3.79/4.09	============================== end of search =========================
3.79/4.09	
3.79/4.09	THEOREM PROVED
3.79/4.09	% SZS status Theorem
3.79/4.09	
3.79/4.09	Exiting with 1 proof.
3.79/4.09	
3.79/4.09	Process 10966 exit (max_proofs) Mon Jul  3 09:20:02 2023
3.79/4.09	Prover9 interrupted
3.79/4.09	EOF