0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n010.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.19/0.34	% CPULimit   : 1200
0.19/0.34	% DateTime   : Tue Jul 13 13:53:06 EDT 2021
0.19/0.34	% CPUTime    : 
1.03/1.37	============================== Prover9 ===============================
1.03/1.37	Prover9 (32) version 2009-11A, November 2009.
1.03/1.37	Process 5098 was started by sandbox2 on n010.cluster.edu,
1.03/1.37	Tue Jul 13 13:53:07 2021
1.03/1.37	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_4944_n010.cluster.edu".
1.03/1.37	============================== end of head ===========================
1.03/1.37	
1.03/1.37	============================== INPUT =================================
1.03/1.37	
1.03/1.37	% Reading from file /tmp/Prover9_4944_n010.cluster.edu
1.03/1.37	
1.03/1.37	set(prolog_style_variables).
1.03/1.37	set(auto2).
1.03/1.37	    % set(auto2) -> set(auto).
1.03/1.37	    % set(auto) -> set(auto_inference).
1.03/1.37	    % set(auto) -> set(auto_setup).
1.03/1.37	    % set(auto_setup) -> set(predicate_elim).
1.03/1.37	    % set(auto_setup) -> assign(eq_defs, unfold).
1.03/1.37	    % set(auto) -> set(auto_limits).
1.03/1.37	    % set(auto_limits) -> assign(max_weight, "100.000").
1.03/1.37	    % set(auto_limits) -> assign(sos_limit, 20000).
1.03/1.37	    % set(auto) -> set(auto_denials).
1.03/1.37	    % set(auto) -> set(auto_process).
1.03/1.37	    % set(auto2) -> assign(new_constants, 1).
1.03/1.37	    % set(auto2) -> assign(fold_denial_max, 3).
1.03/1.37	    % set(auto2) -> assign(max_weight, "200.000").
1.03/1.37	    % set(auto2) -> assign(max_hours, 1).
1.03/1.37	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
1.03/1.37	    % set(auto2) -> assign(max_seconds, 0).
1.03/1.37	    % set(auto2) -> assign(max_minutes, 5).
1.03/1.37	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
1.03/1.37	    % set(auto2) -> set(sort_initial_sos).
1.03/1.37	    % set(auto2) -> assign(sos_limit, -1).
1.03/1.37	    % set(auto2) -> assign(lrs_ticks, 3000).
1.03/1.37	    % set(auto2) -> assign(max_megs, 400).
1.03/1.37	    % set(auto2) -> assign(stats, some).
1.03/1.37	    % set(auto2) -> clear(echo_input).
1.03/1.37	    % set(auto2) -> set(quiet).
1.03/1.37	    % set(auto2) -> clear(print_initial_clauses).
1.03/1.37	    % set(auto2) -> clear(print_given).
1.03/1.37	assign(lrs_ticks,-1).
1.03/1.37	assign(sos_limit,10000).
1.03/1.37	assign(order,kbo).
1.03/1.37	set(lex_order_vars).
1.03/1.37	clear(print_given).
1.03/1.37	
1.03/1.37	% formulas(sos).  % not echoed (123 formulas)
1.03/1.37	
1.03/1.37	============================== end of input ==========================
1.03/1.37	
1.03/1.37	% From the command line: assign(max_seconds, 1200).
1.03/1.37	
1.03/1.37	============================== PROCESS NON-CLAUSAL FORMULAS ==========
1.03/1.37	
1.03/1.37	% Formulas that are not ordinary clauses:
1.03/1.37	1 (all X all Y all Z all V all Z2 all V2 (-s_e(X,Y,Z,V) | s_e(Z,V,Z2,V2) | -s_e(X,Y,Z2,V2))) # label(aA2) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	2 (all X all Y all Z (X = Y | -s_e(X,Y,Z,Z))) # label(aA3) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	3 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	4 (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].
1.03/1.37	5 (all X all Y (Y = X | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	6 (all Xa all Xp all Xc all Xb all Xq ((-s_t(Xa,Xp,Xc) | s_t(Xp,ip(Xa,Xp,Xc,Xb,Xq),Xb) | -s_t(Xb,Xq,Xc)) & (-s_t(Xa,Xp,Xc) | -s_t(Xb,Xq,Xc) | s_t(Xq,ip(Xa,Xp,Xc,Xb,Xq),Xa)))) # label(aA7) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	7 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(Y,V,Y1,V1) | -s_t(X1,Y1,Z1) | s_e(Z,V,Z1,V1) | Y = X | -s_t(X,Y,Z) | -s_e(X,V,X1,V1) | -s_e(Y,Z,Y1,Z1) | -s_e(X,Y,X1,Y1))) # label(aA5) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	8 (all Xp all Xq all Xr all Xa (Xq = Xp | -s_t(Xq,Xp,Xr) | -sameside(Xa,Xp,Xr) | s_col(Xa,Xp,Xq) | Xp = Xr)) # label(aSatz6_15c) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	9 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xa,Xb,Xd) | s_t(Xb,Xc,Xd) | s_t(Xb,Xd,Xc) | Xa = Xb)) # label(aSatz5_2) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	10 (all Xa all Xp (sameside(Xa,Xp,Xa) | Xp = Xa)) # label(aSatz6_5) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	11 (all Xa all Xb (-s_col(Xa,Xb,pointOffLine(Xa,Xb)) | Xb = Xa)) # label(aSatz6_25) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	12 (all Xa all Xp all Xb (le(Xp,Xa,Xp,Xb) | -s_t(Xp,Xa,Xb) | -sameside(Xa,Xp,Xb))) # label(aSatz6_13b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	13 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | -le(Xa,Xb,Xa,Xc) | -le(Xb,Xc,Xa,Xc) | s_t(Xa,Xb,Xc))) # label(aSatz5_12b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	14 (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].
1.03/1.37	15 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xb,Xc,Xa))) # label(aSatz4_11a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	16 (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].
1.03/1.37	17 (all Xa all Xc all Xb all Xc1 (-s_t(Xa,Xc,Xb) | -s_e(Xa,Xc,Xa,Xc1) | -s_e(Xb,Xc,Xb,Xc1) | Xc1 = Xc)) # label(aSatz4_19) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	18 (all Xp all Xq all Xr all Xa (Xr = Xp | -s_t(Xq,Xp,Xr) | s_col(Xa,Xp,Xq) | Xa != Xp | Xp = Xq)) # label(aSatz6_15d) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	19 (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_e(Xm,Xa,Xm,Xb) | s_m(Xa,Xm,Xb) | -s_t(Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	20 (all Xa all Xb all Xc all Xd (Xa = Xb | s_t(Xa,Xd,Xc) | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz5_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	21 (all Xa all Xb all Xc all Xc1 (-s_e(Xa,Xc,Xa,Xc1) | -s_e(Xb,Xc,Xb,Xc1) | Xc1 = Xc | -s_col(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz4_18) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	22 (all Xa all Xb all Xc all Xd (s_t(Xa,Xb,Xd) | Xb = Xc | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	23 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	24 (all Xp all Xq (s_col(Xp,Xq,Xp) | Xp = Xq)) # label(aSatz6_17a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	25 (all Xa all Xb all Xd all Xc (-s_t(Xa,Xb,Xd) | -s_t(Xb,Xc,Xd) | s_t(Xa,Xc,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	26 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	27 (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].
1.03/1.37	28 (all Xa all Xb all Xd all Xc (-s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xc) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	29 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (Xb = Xa | s_e(Xc,Xd,Xc1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1))) # label(aSatz4_16) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	30 (all Xa all Xm (s_m(Xa,Xm,Xa) | Xm != Xa)) # label(aSatz7_3b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	31 (all Xa all Xp all Xb (s_t(Xa,Xp,Xb) | -s_col(Xa,Xp,Xb) | sameside(Xa,Xp,Xb))) # label(aSatz6_4b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	32 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | s_t(Xa1,Xb1,Xc1) | -s_t(Xa,Xb,Xc))) # label(aSatz4_6) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	33 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa1,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1) | -s_t(Xa,Xb,Xc))) # label(aSatz2_11) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	34 (all Xa all Xb all Xc all Xd ((ins(Xc,Xd,Xa,Xb) = ext(Xa,Xb,insert(Xa,Xb,Xc,Xd),Xd) | -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)) | -le(Xa,Xb,Xc,Xd)))) # label(aSatz5_5a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	35 (all Xa all Xm (Xm = Xa | -s_m(Xa,Xm,Xa))) # label(aSatz7_3a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	36 (all Xa all Xb all Xc (le(Xa,Xb,Xa,Xc) | -s_t(Xa,Xb,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12a1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	37 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_t(Xa,Xb,Xc)) & (s_e(Xb,Xd,Zb,Zd) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_t(Za,Zb,Zc) | -s_e(Xa,Xb,Za,Zb) | -s_e(Xb,Xd,Zb,Zd) | s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xb,Xc,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)) & (s_t(Za,Zb,Zc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn2_10) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	38 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((-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)) & (-s_t(Xa,Xb,Xc) | -s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xp,Xa1) | s_t(Xp,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xc)))) # label(aSatz3_17) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	39 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	40 (all Xp all Xq all Xr all Xcs all Xa (-s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)) | s_e(Xp,Xq,Xr,Xcs))) # label(aSatz7_16b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	41 (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)) & (s_e(Xa,Xb,Xc,insert(Xa,Xb,Xc,Xd)) | -le(Xa,Xb,Xc,Xd)) & (s_t(Xc,insert(Xa,Xb,Xc,Xd),Xd) | -le(Xa,Xb,Xc,Xd)))) # label(d_Defn5_4) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	42 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xa,Xc,Xd) | s_t(Xa,Xb,Xd))) # label(aSatz3_6b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	43 (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].
1.03/1.37	44 (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_15a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	45 (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].
1.03/1.37	46 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e(Xb,Xa,Xb1,Xa1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -sameside(Xa1,Xb1,Xc1) | -sameside(Xa,Xb,Xc))) # label(aSatz6_28) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	47 (all Xa all Xp all Xb (Xb = Xa | s(Xa,Xp) != s(Xb,Xp))) # label(aSatz7_18) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	48 (all Xp all Xa all Xr all Xq (-s_m(Xp,Xa,Xr) | Xq = Xr | -s_m(Xp,Xa,Xq))) # label(aSatz7_4b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	49 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	50 (all Xr all Xa all Xb all Xc all Xp all Xq (Xc = Xb | -sameside(Xp,Xa,Xr) | -s_e(Xa,Xp,Xb,Xc) | -s_e(Xa,Xq,Xb,Xc) | Xq = Xp | -sameside(Xq,Xa,Xr) | Xr = Xa)) # label(aSatz6_11b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	51 (all Xa all Xp all Xb ((Xp != Xa | -sameside(Xa,Xp,Xb)) & (Xb != Xp | -sameside(Xa,Xp,Xb)) & (Xp != c63(Xa,Xp,Xb) | -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].
1.03/1.37	52 (all Xa all Xb all Xc (-s_e(Xa,Xc,Xa,Xb) | Xb = Xc | -s_t(Xa,Xb,Xc))) # label(aNarbouxLemma1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	53 (all Xa all Xb all Xc ((-s_t(Xa,Xb,Xc) | s_col(Xa,Xb,Xc)) & (s_col(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(Xb,Xc,Xa) | s_t(Xc,Xa,Xb)))) # label(d_Defn4_10) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	54 (all Xa all Xp (Xp != s(Xa,Xp) | Xp = Xa)) # label(aSatz7_10a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	55 (all Xa all Xb all Xc all Xd (s_t(Xb,Xc,Xd) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_6a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	56 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	57 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xc,Xb,Xa))) # label(aSatz4_11c) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	58 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	59 (all Xa all Xp all Xr all Xq (s(Xa,Xp) != Xr | s(Xa,Xq) != Xr | Xp = Xq)) # label(aSatz7_8) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	60 (all Xa all Xb all Xp all Xq all Xr (Xp = Xq | -s_col(Xp,Xq,Xr) | s_col(Xa,Xb,Xr) | -s_col(Xp,Xq,Xb) | -s_col(Xp,Xq,Xa) | Xb = Xa)) # label(aSatz6_18) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	61 (all Xa all Xb all Xc all Xd (Xb = Xa | -s_t(Xc,Xa,Xb) | -s_t(Xd,Xa,Xb) | s_t(Xc,Xd,Xb) | s_t(Xd,Xc,Xb))) # label(aSatz6_16a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	62 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_e(Xc,Xd,Xc1,Xd1) | le(Xa1,Xb1,Xc1,Xd1) | -s_e(Xa,Xb,Xa1,Xb1) | -le(Xa,Xb,Xc,Xd))) # label(aSatz5_6) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	63 (all Xa all Xb all Xc (-s_t(Xb,Xa,Xc) | Xa = Xb | -s_t(Xa,Xb,Xc))) # label(aSatz3_4) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	64 (all Xa1 all Xa2 all Xa3 all Xb1 all Xb2 all Xb3 ((s_e(Xa1,Xa2,Xb1,Xb2) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa3,Xb1,Xb3)) & (s_e(Xa2,Xa3,Xb2,Xb3) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)) & (-s_e(Xa1,Xa2,Xb1,Xb2) | -s_e(Xa1,Xa3,Xb1,Xb3) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa2,Xa3,Xb2,Xb3)))) # label(d_Defn4_4) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	65 (all Xp all Xq all Xr all Xa (Xr = Xp | -s_t(Xq,Xp,Xr) | sameside(Xa,Xp,Xr) | sameside(Xa,Xp,Xq) | Xa = Xp | -s_col(Xa,Xp,Xq) | Xp = Xq)) # label(aSatz6_15a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	66 (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].
1.03/1.37	67 (all Xa all Xc all Xd le(Xa,Xa,Xc,Xd)) # label(aSatz5_11) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	68 (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].
1.03/1.37	69 (all Xa all Xb all Xc all Xd all Xe (-s_t(Xa,Xb,Xe) | -s_e(Xa,Xe,Xc,Xd) | le(Xa,Xb,Xc,Xd))) # label(aSatz5_5b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	70 (all Xa all Xp all Xb all Xc (sameside(Xa,Xp,Xb) | Xb = Xp | -s_t(Xa,Xp,Xc) | -s_t(Xb,Xp,Xc) | Xp = Xc | Xa = Xp)) # label(aSatz6_3b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	71 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 ((s_t(Xb1,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_e(Xc,Xa2,Xc,Xb2)) & (s_m(Xa2,Xm2,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_m(Xa1,Xm1,Xb1) | -s_m(Xa2,Xm2,Xb2) | s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | -s_e(Xc,Xa2,Xc,Xb2) | -s_e(Xc,Xa1,Xc,Xb1) | -s_t(Xb1,Xc,Xb2) | -s_t(Xa1,Xc,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_m(Xa1,Xm1,Xb1)) & (s_e(Xc,Xa1,Xc,Xb1) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_t(Xa1,Xc,Xa2)))) # label(d_Defn7_23) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	72 (all Xb all Xc all Xa (Xb = Xc | -s_e(Xb,Xc,Xa,Xa))) # label(aSatz2_13) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	73 (all Xa all Xp all Xb all Xc (Xp = Xa | -s_t(Xa,Xp,Xc) | s_t(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb) | Xp = Xc | Xp = Xb)) # label(aSatz6_2b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	74 (all Xb all Xa Xb != ext(Xa,Xb,alpha,gamma)) # label(aSatz3_14b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	75 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_col(Xa,Xb,Xc) | s_col(Xa1,Xb1,Xc1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1))) # label(aSatz4_13) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	76 (all Xp all Xq all Xr (s_col(Xq,Xp,Xr) | -s_col(Xp,Xq,Xr) | Xp = Xq)) # label(aSatz6_17b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	77 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	78 (all Xa all Xb all Xc all Xd (-le(Xa,Xb,Xc,Xd) | -le(Xc,Xd,Xa,Xb) | s_e(Xa,Xb,Xc,Xd))) # label(aSatz5_9) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	79 (all Xa all Xb all Xc all Xa1 all Xc1 ((s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1) | -s_t(Xa,Xb,Xc)) & (-s_t(Xa,Xb,Xc) | s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1)))) # label(aSatz4_5) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	80 (all Xa all Xp (Xp != Xa | s(Xa,Xp) = Xp)) # label(aSatz7_10b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	81 (all Xa all Xp all Xb ((Xa != Xp | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | s_t(Xp,Xb,Xa) | s_t(Xp,Xa,Xb)) & (Xp = Xb | sameside(Xa,Xp,Xb) | Xp = Xa | -s_t(Xp,Xb,Xa)) & (-s_t(Xp,Xa,Xb) | sameside(Xa,Xp,Xb) | xb = Xp | Xa = Xp) & (Xb != Xp | -sameside(Xa,Xp,Xb)))) # label(d_Defn6_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	82 (all Xa all Xb all Xp all Xq all Xc all Xd all Xe (Xb = Xa | -s_col(Xa,Xb,Xe) | s_col(Xp,Xq,Xe) | Xc = Xd | -s_col(Xp,Xq,Xd) | -s_col(Xa,Xb,Xd) | -s_col(Xp,Xq,Xc) | -s_col(Xa,Xb,Xc) | Xp = Xq)) # label(aSatz6_21) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	83 (all Xp all Xa all Xq all Xb (-s_m(Xp,Xa,Xq) | Xa = Xb | -s_m(Xp,Xb,Xq))) # label(aSatz7_17) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	84 (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].
1.03/1.37	85 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 ((s_e(Xa,Xd,Xa1,Xd1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xb,Xd,Xb1,Xd1)) & (-s_col(Xa,Xb,Xc) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_e(Xb,Xd,Xb1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e(Xa,Xd,Xa1,Xd1)) & (s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)) & (s_col(Xa,Xb,Xc) | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1)))) # label(d_Defn4_15) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	86 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (s_e(Xa,Xb,Xa1,Xb1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_e(Xa,Xc,Xa1,Xc1) | -s_t(Xa1,Xb1,Xc1) | -s_t(Xa,Xb,Xc))) # label(aSatz4_3) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	87 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	88 (all Xa all Xb all Xc all XA all XB all XC (-s_t(XA,XB,XC) | -s_e(Xb,Xc,XA,XB) | s_e(Xa,Xc,XA,XC) | -s_e(Xa,Xb,XB,XC) | -s_t(Xa,Xb,Xc))) # label(aSatz2_15) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	89 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	90 (all Xa all Xp all Xb all Xc (Xb = Xp | Xc = Xp | -s_t(Xb,Xp,Xc) | sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xc) | Xa = Xp)) # label(aSatz6_2a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	91 (all Xa all Xp all Xb all Xc (-sameside(Xa,Xp,Xb) | sameside(Xa,Xp,Xc) | -sameside(Xb,Xp,Xc))) # label(aSatz6_7) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	92 (all Xp all Xq all Xr all Xcs all Xa (s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)) | -s_e(Xp,Xq,Xr,Xcs))) # label(aSatz7_16a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	93 (all Xa all Xb all Xc all Xd all Xe all Xf (-le(Xc,Xd,Xe,Xf) | le(Xa,Xb,Xe,Xf) | -le(Xa,Xb,Xc,Xd))) # label(aSatz5_8) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	94 (all Xp all Xq all Xr all Xa (Xp = Xq | -sameside(Xa,Xp,Xq) | s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xr = Xp)) # label(aSatz6_15b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	95 (all Xa all Xb all Xd all Xc (s_t(Xa,Xb,Xc) | s_t(Xa,Xc,Xb) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz5_3) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	96 (all Xa all Xb all Xc all Xa1 all Xb1 (-s_col(Xa,Xb,Xc) | s_e3(Xa,Xb,Xc,Xa1,Xb1,insert5(Xa,Xb,Xc,Xa1,Xb1)) | -s_e(Xa,Xb,Xa1,Xb1))) # label(aSatz4_14) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	97 (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].
1.03/1.37	98 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	99 (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_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (s_e(Xa,Xd,Za,Zd) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xc,Xd,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xb,Xc,Zb,Zc) | -s_e(Xc,Xd,Zc,Zd) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xa,Xc,Za,Zc) | -s_t(Za,Zb,Zc)) & (s_e(Xa,Xc,Za,Zc) | -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)))) # label(d_Defn4_1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	100 (all Xp all Xa all Xq (-s_m(Xp,Xa,Xq) | Xq = s(Xa,Xp))) # label(aSatz7_6) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	101 (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].
1.03/1.37	102 (all Xa all Xm all Xb (s_m(Xb,Xm,Xa) | -s_m(Xa,Xm,Xb))) # label(aSatz7_2) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	103 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | Xc = Xb | s_t(Xa,Xc,Xd) | -s_t(Xb,Xc,Xd))) # label(aSatz3_7a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	104 (all Xa all Xp all Xb (sameside(Xb,Xp,Xa) | -sameside(Xa,Xp,Xb))) # label(aSatz6_6) # label(axiom) # label(non_clause).  [assumption].
1.03/1.37	105 (all Xa all Xb all Xc all Xd all Xe all Xf (-s_e(Xa,Xb,Xc,Xd) | -s_e(Xc,Xd,Xe,Xf) | s_e(Xa,Xb,Xe,Xf))) # label(aSatz2_3) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	106 (all Xa all Xp all Xq (Xq = Xp | s(Xa,Xp) != s(Xa,Xq))) # label(aSatz7_9) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	107 (all Xp all Xq all Xcs all Xr (Xcs = Xp | s_col(Xp,Xcs,Xr) | -s_col(Xp,Xq,Xr) | -s_col(Xp,Xq,Xcs) | Xp = Xq)) # label(aSatz6_16b) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	108 (all Xq all Xa all Xd all Xb all Xc (-s_e(Xa,Xd,Xb,Xc) | ext(Xq,Xa,Xb,Xc) = Xd | -s_t(Xq,Xa,Xd) | Xq = Xa)) # label(aSatz2_12) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	109 (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].
1.03/1.38	110 (all Xa all Xb all Xc all Xd (le(Xa,Xb,Xc,Xd) | le(Xc,Xd,Xa,Xb))) # label(aSatz5_10) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	111 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | -s_t(Xa,Xb,Xc) | le(Xb,Xc,Xa,Xc))) # label(aSatz5_12a2) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	112 (all Xr all Xa all Xb all Xc ((Xr = Xa | Xc = Xb | s_e(Xa,insert(Xb,Xc,Xa,Xr),Xb,Xc)) & (Xb = Xc | sameside(insert(Xb,Xc,Xa,Xr),Xa,Xr) | Xa = Xr))) # label(aSatz6_11a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	113 (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].
1.03/1.38	114 (all Xa all Xp all Xb ((s_col(Xa,Xp,Xb) | -sameside(Xa,Xp,Xb)) & (-s_t(Xa,Xp,Xb) | -sameside(Xa,Xp,Xb)))) # label(aSatz6_4a) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	115 (all Xa all Xb all Xa1 all Xc1 insert(Xa,Xb,Xa1,Xc1) = ext(ext(Xc1,Xa1,alpha,gamma),Xa1,Xa,Xb)) # label(d_insert) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	116 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | s_t(Xc,Xb,Xa))) # label(aSatz3_2) # label(axiom) # label(non_clause).  [assumption].
1.03/1.38	117 -(all Xa all Xb all Xp (Xb = Xa | s(Xa,s(Xb,Xp)) != s(Xb,s(Xa,Xp)))) # label(aSatz7_19) # label(negated_conjecture) # label(non_clause).  [assumption].
1.03/1.38	
1.03/1.38	============================== end of process non-clausal formulas ===
1.03/1.38	
1.03/1.38	============================== PROCESS INITIAL CLAUSES ===============
1.03/1.38	
1.03/1.38	============================== PREDICATE ELIMINATION =================
1.03/1.38	118 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | -s_e(B,V6,E,V7) | s_fs(A,B,C,V6,D,E,F,V7) | -s_e(A,V6,D,V7) # label(d_Defn4_15) # label(axiom).  [clausify(85)].
1.03/1.38	119 A = B | s_e(C,D,E,F) | -s_fs(B,A,C,D,V6,V7,E,F) # label(aSatz4_16) # label(axiom).  [clausify(29)].
1.03/1.38	120 s_e(A,B,C,D) | -s_fs(A,E,F,B,C,V6,V7,D) # label(d_Defn4_15) # label(axiom).  [clausify(85)].
1.03/1.38	121 -s_fs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(d_Defn4_15) # label(axiom).  [clausify(85)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | -s_e(B,V6,E,V7) | -s_e(A,V6,D,V7) | B = A | s_e(C,V6,F,V7).  [resolve(118,d,119,c)].
1.03/1.38	122 s_e3(A,B,C,D,E,F) | -s_fs(A,B,C,V6,D,E,F,V7) # label(d_Defn4_15) # label(axiom).  [clausify(85)].
1.03/1.38	123 s_col(A,B,C) | -s_fs(A,B,C,D,E,F,V6,V7) # label(d_Defn4_15) # label(axiom).  [clausify(85)].
1.03/1.38	124 -s_e(A,B,C,D) | -s_e(A,E,C,F) | s_e3(A,B,E,C,D,F) | -s_e(B,E,D,F) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
1.03/1.38	125 -s_e3(A,B,C,D,E,F) | s_t(D,E,F) | -s_t(A,B,C) # label(aSatz4_6) # label(axiom).  [clausify(32)].
1.03/1.38	126 s_e(A,B,C,D) | -s_e3(A,B,E,C,D,F) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
1.03/1.38	127 -s_e3(A,B,C,D,E,F) | s_e(A,C,D,F) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
1.03/1.38	128 s_e(A,B,C,D) | -s_e3(E,A,B,F,C,D) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
1.03/1.38	Derived: -s_e(A,B,C,D) | -s_e(A,E,C,F) | -s_e(B,E,D,F) | s_t(C,D,F) | -s_t(A,B,E).  [resolve(124,c,125,a)].
1.03/1.38	129 -s_col(A,B,C) | s_col(D,E,F) | -s_e3(A,B,C,D,E,F) # label(aSatz4_13) # label(axiom).  [clausify(75)].
1.03/1.38	Derived: -s_col(A,B,C) | s_col(D,E,F) | -s_e(A,B,D,E) | -s_e(A,C,D,F) | -s_e(B,C,E,F).  [resolve(129,c,124,c)].
1.03/1.38	130 -s_t(A,B,C) | s_e3(A,B,C,D,insert(A,B,D,E),E) | -s_e(A,C,D,E) # label(aSatz4_5) # label(axiom).  [clausify(79)].
1.03/1.38	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_t(D,insert(A,B,D,E),E) | -s_t(A,B,C).  [resolve(130,b,125,a)].
1.03/1.38	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_e(A,B,D,insert(A,B,D,E)).  [resolve(130,b,126,b)].
1.03/1.38	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_e(B,C,insert(A,B,D,E),E).  [resolve(130,b,128,b)].
1.03/1.38	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | -s_col(A,B,C) | s_col(D,insert(A,B,D,E),E).  [resolve(130,b,129,c)].
1.03/1.38	131 -s_col(A,B,C) | s_e3(A,B,C,D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) # label(aSatz4_14) # label(axiom).  [clausify(96)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_t(D,E,insert5(A,B,C,D,E)) | -s_t(A,B,C).  [resolve(131,b,125,a)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_e(A,C,D,insert5(A,B,C,D,E)).  [resolve(131,b,127,a)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_e(B,C,E,insert5(A,B,C,D,E)).  [resolve(131,b,128,b)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | -s_col(A,B,C) | s_col(D,E,insert5(A,B,C,D,E)).  [resolve(131,b,129,c)].
1.03/1.38	132 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | -s_e(B,V6,E,V7) | -s_e(A,V6,D,V7) | B = A | s_e(C,V6,F,V7).  [resolve(118,d,119,c)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(B,D,E,F) | -s_e(A,D,V6,F) | B = A | s_e(C,D,V7,F) | -s_e(A,B,V6,E) | -s_e(A,C,V6,V7) | -s_e(B,C,E,V7).  [resolve(132,b,124,c)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(B,D,insert(A,B,E,F),V6) | -s_e(A,D,E,V6) | B = A | s_e(C,D,F,V6) | -s_t(A,B,C) | -s_e(A,C,E,F).  [resolve(132,b,130,b)].
1.03/1.38	Derived: -s_col(A,B,C) | -s_e(B,D,E,F) | -s_e(A,D,V6,F) | B = A | s_e(C,D,insert5(A,B,C,V6,E),F) | -s_col(A,B,C) | -s_e(A,B,V6,E).  [resolve(132,b,131,b)].
1.03/1.38	133 -s_t(A,B,C) | -s_t(D,E,F) | -s_e(A,B,D,E) | -s_e(B,V6,E,V7) | s_afs(A,B,C,V6,D,E,F,V7) | -s_e(A,V6,D,V7) | -s_e(B,C,E,F) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	134 -s_afs(A,B,C,D,E,F,V6,V7) | s_t(A,B,C) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	135 s_e(A,B,C,D) | -s_afs(E,A,F,B,V6,C,V7,D) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	136 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	137 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	138 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,B,E,F) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	139 s_t(A,B,C) | -s_afs(D,E,F,V6,A,B,C,V7) # label(d_Defn2_10) # label(axiom).  [clausify(37)].
1.03/1.38	140 -s_m(A,B,C) | -s_m(D,E,F) | s_kf(A,B,C,V6,F,E,D) | -s_e(V6,D,V6,F) | -s_e(V6,A,V6,C) | -s_t(C,V6,F) | -s_t(A,V6,D) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	141 s_t(A,B,C) | -s_kf(D,E,A,B,C,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	142 -s_kf(A,B,C,D,E,F,V6) | s_e(D,V6,D,E) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	143 s_m(A,B,C) | -s_kf(D,E,F,V6,C,B,A) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	144 -s_kf(A,B,C,D,E,F,V6) | s_m(A,B,C) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	145 s_e(A,B,A,C) | -s_kf(B,D,C,A,E,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	146 -s_kf(A,B,C,D,E,F,V6) | s_t(A,D,V6) # label(d_Defn7_23) # label(axiom).  [clausify(71)].
1.03/1.38	147 -s_t(A,B,C) | -s_e(B,C,D,E) | -s_e(C,F,E,V6) | s_ifs(A,B,C,F,V7,D,E,V6) | -s_e(A,F,V7,V6) | -s_e(A,C,V7,E) | -s_t(V7,D,E) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	148 s_e(A,B,C,D) | -s_ifs(E,A,F,B,V6,C,V7,D) # label(aSatz4_2) # label(axiom).  [clausify(97)].
6.64/6.94	149 s_t(A,B,C) | -s_ifs(A,B,C,D,E,F,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	150 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	151 s_e(A,B,C,D) | -s_ifs(A,E,F,B,C,V6,V7,D) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	152 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(C,D,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	Derived: -s_t(A,B,C) | -s_e(B,C,D,E) | -s_e(C,F,E,V6) | -s_e(A,F,V7,V6) | -s_e(A,C,V7,E) | -s_t(V7,D,E) | s_e(B,F,D,V6).  [resolve(147,d,148,b)].
6.64/6.94	153 s_e(A,B,C,D) | -s_ifs(A,E,B,F,C,V6,D,V7) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	154 s_t(A,B,C) | -s_ifs(D,E,F,V6,A,B,C,V7) # label(d_Defn4_1) # label(axiom).  [clausify(99)].
6.64/6.94	
6.64/6.94	============================== end predicate elimination =============
6.64/6.94	
6.64/6.94	Auto_denials:  (non-Horn, no changes).
6.64/6.94	
6.64/6.94	Term ordering decisions:
6.64/6.94	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.
6.64/6.94	
6.64/6.94	============================== end of process initial clauses ========
6.64/6.94	
6.64/6.94	============================== CLAUSES FOR SEARCH ====================
6.64/6.94	
6.64/6.94	============================== end of clauses for search =============
6.64/6.94	
6.64/6.94	============================== SEARCH ================================
6.64/6.94	
6.64/6.94	% Starting search at 0.05 seconds.
6.64/6.94	
6.64/6.94	Low Water (keep): wt=34.000, iters=4651
6.64/6.94	
6.64/6.94	Low Water (keep): wt=31.000, iters=4262
6.64/6.94	
6.64/6.94	Low Water (keep): wt=30.000, iters=4123
6.64/6.94	
6.64/6.94	Low Water (keep): wt=26.000, iters=3493
6.64/6.94	
6.64/6.94	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 1.18 sec).
6.64/6.94	
6.64/6.94	Low Water (keep): wt=25.000, iters=3443
6.64/6.94	
6.64/6.94	Low Water (keep): wt=24.000, iters=3350
6.64/6.94	
6.64/6.94	Low Water (keep): wt=23.000, iters=3360
6.64/6.94	
6.64/6.94	Low Water (displace): id=6466, wt=72.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=4169, wt=68.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=1642, wt=66.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=4131, wt=64.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=2629, wt=62.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=6322, wt=60.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=5753, wt=58.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=3470, wt=56.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=6471, wt=54.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=11778, wt=22.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=11864, wt=20.000
6.64/6.94	
6.64/6.94	Low Water (displace): id=11869, wt=14.000
6.64/6.94	
6.64/6.94	Low Water (keep): wt=22.000, iters=3364
6.64/6.94	
6.64/6.94	Low Water (displace): id=11877, wt=12.000
6.64/6.94	
6.64/6.94	Low Water (keep): wt=21.000, iters=3336
6.64/6.94	
6.64/6.94	Low Water (keep): wt=20.000, iters=3335
6.64/6.94	
6.64/6.94	Low Water (keep): wt=19.000, iters=5808
6.64/6.94	
6.64/6.94	Low Water (keep): wt=18.000, iters=5146
6.64/6.94	
6.64/6.94	Low Water (keep): wt=16.000, iters=3690
6.64/6.94	
6.64/6.94	Low Water (displace): id=15445, wt=11.000
6.64/6.94	
6.64/6.94	Low Water (keep): wt=15.000, iters=4780
6.64/6.94	
6.64/6.94	============================== PROOF =================================
6.64/6.94	% SZS status Theorem
6.64/6.94	% SZS output start Refutation
6.64/6.94	
6.64/6.94	% Proof 1 at 5.36 (+ 0.21) seconds.
6.64/6.94	% Length of proof is 34.
6.64/6.94	% Level of proof is 7.
6.64/6.94	% Maximum clause weight is 18.000.
6.64/6.94	% Given clauses 2405.
6.64/6.94	
6.64/6.94	19 (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_e(Xm,Xa,Xm,Xb) | s_m(Xa,Xm,Xb) | -s_t(Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	23 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	39 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	44 (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_15a) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	47 (all Xa all Xp all Xb (Xb = Xa | s(Xa,Xp) != s(Xb,Xp))) # label(aSatz7_18) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	80 (all Xa all Xp (Xp != Xa | s(Xa,Xp) = Xp)) # label(aSatz7_10b) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	83 (all Xp all Xa all Xq all Xb (-s_m(Xp,Xa,Xq) | Xa = Xb | -s_m(Xp,Xb,Xq))) # label(aSatz7_17) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	92 (all Xp all Xq all Xr all Xcs all Xa (s_e(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr),s(Xa,Xcs)) | -s_e(Xp,Xq,Xr,Xcs))) # label(aSatz7_16a) # label(axiom) # label(non_clause).  [assumption].
6.64/6.94	117 -(all Xa all Xb all Xp (Xb = Xa | s(Xa,s(Xb,Xp)) != s(Xb,s(Xa,Xp)))) # label(aSatz7_19) # label(negated_conjecture) # label(non_clause).  [assumption].
6.64/6.94	178 s_t(A,B,C) | -s_m(A,B,C) # label(d_Defn7_1) # label(axiom).  [clausify(19)].
6.64/6.94	179 -s_m(A,B,C) | s_e(B,A,B,C) # label(d_Defn7_1) # label(axiom).  [clausify(19)].
6.64/6.94	180 -s_e(A,B,A,C) | s_m(B,A,C) | -s_t(B,A,C) # label(d_Defn7_1) # label(axiom).  [clausify(19)].
6.64/6.94	184 s_m(A,B,s(B,A)) # label(aSatz7_4a) # label(axiom).  [clausify(23)].
6.64/6.94	201 s(A,s(A,B)) = B # label(aSatz7_7) # label(axiom).  [clausify(39)].
6.64/6.94	208 s_t(s(A,B),s(A,C),s(A,D)) | -s_t(B,C,D) # label(aSatz7_15a) # label(axiom).  [clausify(44)].
6.64/6.94	211 A = B | s(A,C) != s(B,C) # label(aSatz7_18) # label(axiom).  [clausify(47)].
6.64/6.94	251 A != B | s(B,A) = A # label(aSatz7_10b) # label(axiom).  [clausify(80)].
6.64/6.94	256 -s_m(A,B,C) | D = B | -s_m(A,D,C) # label(aSatz7_17) # label(axiom).  [clausify(83)].
6.64/6.94	263 s_e(s(A,B),s(A,C),s(A,D),s(A,E)) | -s_e(B,C,D,E) # label(aSatz7_16a) # label(axiom).  [clausify(92)].
6.64/6.94	288 c2 != c1 # label(aSatz7_19) # label(negated_conjecture).  [clausify(117)].
6.64/6.94	289 s(c2,s(c1,c3)) = s(c1,s(c2,c3)) # label(aSatz7_19) # label(negated_conjecture).  [clausify(117)].
6.64/6.94	373 s_e(A,B,A,s(A,B)).  [resolve(184,a,179,a)].
6.64/6.94	374 s_t(A,B,s(B,A)).  [resolve(184,a,178,b)].
6.64/6.94	502 s(A,A) = A.  [resolve(251,a,201,a),rewrite([201(2),201(3)])].
6.64/6.94	513 -s_m(A,B,s(C,A)) | C = B.  [resolve(256,c,184,a)].
6.64/6.94	581 s(c2,s(c1,s(c2,c3))) = s(c1,c3).  [para(289(a,1),201(a,1,2))].
6.64/6.94	792 A = B | s(A,B) != B.  [para(502(a,1),211(b,2))].
6.64/6.94	817 s_t(s(A,B),s(A,C),s(A,s(C,B))).  [resolve(374,a,208,b)].
6.64/6.94	1024 s_e(s(A,B),s(A,C),s(A,B),s(A,s(B,C))).  [resolve(373,a,263,b)].
6.64/6.94	22052 s_t(c3,s(c2,c1),s(c1,c3)).  [para(581(a,1),817(a,3)),rewrite([201(5)])].
6.64/6.94	24319 s_e(s(c2,c1),c3,s(c2,c1),s(c1,c3)).  [para(581(a,1),1024(a,4)),rewrite([201(8)])].
6.64/6.94	24384 s_m(c3,s(c2,c1),s(c1,c3)).  [resolve(24319,a,180,a),unit_del(b,22052)].
6.64/6.94	24385 s(c2,c1) = c1.  [resolve(24384,a,513,a),flip(a)].
6.64/6.94	24500 $F.  [resolve(24385,a,792,b),unit_del(a,288)].
6.64/6.94	
6.64/6.94	% SZS output end Refutation
6.64/6.94	============================== end of proof ==========================
6.64/6.94	
6.64/6.94	============================== STATISTICS ============================
6.64/6.94	
6.64/6.94	Given=2405. Generated=183557. Kept=24334. proofs=1.
6.64/6.94	Usable=2227. Sos=9891. Demods=49. Limbo=0, Disabled=12403. Hints=0.
6.64/6.94	Megabytes=13.47.
6.64/6.94	User_CPU=5.36, System_CPU=0.21, Wall_clock=6.
6.64/6.94	
6.64/6.94	============================== end of statistics =====================
6.64/6.94	
6.64/6.94	============================== end of search =========================
6.64/6.94	
6.64/6.94	THEOREM PROVED
6.64/6.94	% SZS status Theorem
6.64/6.94	
6.64/6.94	Exiting with 1 proof.
6.64/6.94	
6.64/6.94	Process 5098 exit (max_proofs) Tue Jul 13 13:53:13 2021
6.64/6.94	Prover9 interrupted
6.64/6.94	EOF