0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n021.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 11:22:04 EDT 2019
0.12/0.33	% CPUTime    : 
0.84/1.16	============================== Prover9 ===============================
0.84/1.16	Prover9 (32) version 2009-11A, November 2009.
0.84/1.16	Process 26172 was started by sandbox2 on n021.cluster.edu,
0.84/1.16	Thu Aug 29 11:22:04 2019
0.84/1.16	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_26018_n021.cluster.edu".
0.84/1.16	============================== end of head ===========================
0.84/1.16	
0.84/1.16	============================== INPUT =================================
0.84/1.16	
0.84/1.16	% Reading from file /tmp/Prover9_26018_n021.cluster.edu
0.84/1.16	
0.84/1.16	set(prolog_style_variables).
0.84/1.16	set(auto2).
0.84/1.16	    % set(auto2) -> set(auto).
0.84/1.16	    % set(auto) -> set(auto_inference).
0.84/1.16	    % set(auto) -> set(auto_setup).
0.84/1.16	    % set(auto_setup) -> set(predicate_elim).
0.84/1.16	    % set(auto_setup) -> assign(eq_defs, unfold).
0.84/1.16	    % set(auto) -> set(auto_limits).
0.84/1.16	    % set(auto_limits) -> assign(max_weight, "100.000").
0.84/1.16	    % set(auto_limits) -> assign(sos_limit, 20000).
0.84/1.16	    % set(auto) -> set(auto_denials).
0.84/1.16	    % set(auto) -> set(auto_process).
0.84/1.16	    % set(auto2) -> assign(new_constants, 1).
0.84/1.16	    % set(auto2) -> assign(fold_denial_max, 3).
0.84/1.16	    % set(auto2) -> assign(max_weight, "200.000").
0.84/1.16	    % set(auto2) -> assign(max_hours, 1).
0.84/1.16	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.84/1.16	    % set(auto2) -> assign(max_seconds, 0).
0.84/1.16	    % set(auto2) -> assign(max_minutes, 5).
0.84/1.16	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.84/1.16	    % set(auto2) -> set(sort_initial_sos).
0.84/1.16	    % set(auto2) -> assign(sos_limit, -1).
0.84/1.16	    % set(auto2) -> assign(lrs_ticks, 3000).
0.84/1.16	    % set(auto2) -> assign(max_megs, 400).
0.84/1.16	    % set(auto2) -> assign(stats, some).
0.84/1.16	    % set(auto2) -> clear(echo_input).
0.84/1.16	    % set(auto2) -> set(quiet).
0.84/1.16	    % set(auto2) -> clear(print_initial_clauses).
0.84/1.16	    % set(auto2) -> clear(print_given).
0.84/1.16	assign(lrs_ticks,-1).
0.84/1.16	assign(sos_limit,10000).
0.84/1.16	assign(order,kbo).
0.84/1.16	set(lex_order_vars).
0.84/1.16	clear(print_given).
0.84/1.16	
0.84/1.16	% formulas(sos).  % not echoed (118 formulas)
0.84/1.16	
0.84/1.16	============================== end of input ==========================
0.84/1.16	
0.84/1.16	% From the command line: assign(max_seconds, 180).
0.84/1.16	
0.84/1.16	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.84/1.16	
0.84/1.16	% Formulas that are not ordinary clauses:
0.84/1.16	1 (all X all Y all W all V (s_t(X,Y,ext(X,Y,W,V)) & s_e(Y,ext(X,Y,W,V),W,V))) # label(aA4) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	2 (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) | Y = X | s_e(Z,V,Z1,V1) | -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.84/1.16	3 (all Xa all Xp all Xc all Xb all Xq ((-s_t(Xb,Xq,Xc) | s_t(Xp,ip(Xa,Xp,Xc,Xb,Xq),Xb) | -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)))) # label(aA7) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	4 (all X all Y all Z all V all Z2 all V2 (-s_e(X,Y,Z2,V2) | s_e(Z,V,Z2,V2) | -s_e(X,Y,Z,V))) # label(aA2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	5 (all X all Y (X = Y | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	6 (all X all Y all Z (X = Y | -s_e(X,Y,Z,Z))) # label(aA3) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	7 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	8 (all Xa all Xb all Xc all Xd (-s_t(Xc,Xa,Xb) | s_t(Xd,Xc,Xb) | s_t(Xc,Xd,Xb) | -s_t(Xd,Xa,Xb) | Xb = Xa)) # label(aSatz6_16a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	9 (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.84/1.16	10 (all Xb all Xc all Xa (Xb = Xc | -s_e(Xb,Xc,Xa,Xa))) # label(aSatz2_13) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	11 (all Xa all Xm (s_m(Xa,Xm,Xa) | Xm != Xa)) # label(aSatz7_3b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	12 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	13 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	14 (all Xa all Xb all Xc all Xd (s_e(Xc,Xd,Xa,Xb) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	15 (all Xa all Xb all Xc (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Xa,Xb) | Xc = Xb)) # label(aNarbouxLemma1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	16 (all Xa all Xp all Xr all Xq (s(Xa,Xp) != Xr | Xq = Xp | Xr != s(Xa,Xq))) # label(aSatz7_8) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	17 (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(Xa,Xd,Xa1,Xd1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xb,Xd,Xb1,Xd1)) & (-s_col(Xa,Xb,Xc) | -s_e(Xa,Xd,Xa1,Xd1) | -s_e(Xb,Xd,Xb1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e3(Xa,Xb,Xc,Xa1,Xb1,Xc1)) & (-s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_col(Xa,Xb,Xc)))) # label(d_Defn4_15) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	18 (all Xa all Xb all Xc all Xd all Y ((-le(Xa,Xb,Xc,Xd) | s_t(Xc,insert(Xa,Xb,Xc,Xd),Xd)) & (s_e(Xa,Xb,Xc,insert(Xa,Xb,Xc,Xd)) | -le(Xa,Xb,Xc,Xd)) & (-s_t(Xc,Y,Xd) | -s_e(Xa,Xb,Xc,Y) | le(Xa,Xb,Xc,Xd)))) # label(d_Defn5_4) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	19 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	20 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xd) | s_t(Xa,Xd,Xc) | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xc) | Xa = Xb)) # label(aSatz5_1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	21 (all Xa all Xb all Xc all Xd (-le(Xc,Xd,Xa,Xb) | s_e(Xa,Xb,Xc,Xd) | -le(Xa,Xb,Xc,Xd))) # label(aSatz5_9) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	22 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	23 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	24 (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_e(Xb,Xc,Zb,Zc)) & (s_e(Xb,Xd,Zb,Zd) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xd,Za,Zd) | s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xb,Xd,Zb,Zd) | -s_e(Xb,Xc,Zb,Zc) | -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_e(Xa,Xb,Za,Zb) | -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_t(Xa,Xb,Xc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn2_10) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	25 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 ((-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_t(Xb1,Xc,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_t(Xa1,Xc,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_e(Xc,Xa2,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2)) & (s_e(Xc,Xa1,Xc,Xb1) | -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.84/1.16	26 (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.84/1.16	27 (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) | Xb = Xa)) # label(aSatz5_2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	28 (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.84/1.16	29 (all Xa all Xb all Xp all Xq all Xc all Xd all Xe (Xb = Xa | Xp = Xq | -s_col(Xa,Xb,Xc) | -s_col(Xp,Xq,Xc) | -s_col(Xp,Xq,Xd) | -s_col(Xa,Xb,Xe) | s_col(Xp,Xq,Xe) | Xd = Xc | -s_col(Xa,Xb,Xd))) # label(aSatz6_21) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	30 (all Xp all Xq all Xr (Xq = Xp | -s_col(Xp,Xq,Xr) | s_col(Xq,Xp,Xr))) # label(aSatz6_17b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	31 (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.84/1.16	32 (all Xa all Xb all Xc all Xd ((s_t(Xa,Xb,ins(Xc,Xd,Xa,Xb)) | -le(Xa,Xb,Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | ext(Xa,Xb,insert(Xa,Xb,Xc,Xd),Xd) = ins(Xc,Xd,Xa,Xb)) & (s_e(Xa,ins(Xc,Xd,Xa,Xb),Xc,Xd) | -le(Xa,Xb,Xc,Xd)))) # label(aSatz5_5a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	33 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	34 (all Xa all Xb all Xc ((s_t(Xa,Xb,Xc) | s_t(Xc,Xa,Xb) | s_t(Xb,Xc,Xa) | -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.84/1.16	35 (all Xa all Xp all Xq (Xq = Xp | s(Xa,Xq) != s(Xa,Xp))) # label(aSatz7_9) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	36 (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.84/1.16	37 (all Xr all Xa all Xb all Xc ((Xa = Xr | sameside(insert(Xb,Xc,Xa,Xr),Xa,Xr) | Xb = Xc) & (Xc = Xb | s_e(Xa,insert(Xb,Xc,Xa,Xr),Xb,Xc) | Xr = Xa))) # label(aSatz6_11a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	38 (all Xa all Xp all Xb (s_t(Xp,Xa,Xb) | -le(Xp,Xa,Xp,Xb) | -sameside(Xa,Xp,Xb))) # label(aSatz6_13a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	39 (all Xp all Xq all Xr all Xa (Xp = Xq | Xr = Xp | -s_t(Xq,Xp,Xr) | Xa != Xp | s_col(Xa,Xp,Xq))) # label(aSatz6_15d) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	40 (all Xa all Xb all Xc all Xd all Xe (le(Xa,Xb,Xc,Xd) | -s_t(Xa,Xb,Xe) | -s_e(Xa,Xe,Xc,Xd))) # label(aSatz5_5b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	41 (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].
0.84/1.16	42 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_t(Xa,Xb,Xc)) & (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_e(Xc,Xd,Zc,Zd) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (-s_t(Xa,Xb,Xc) | -s_e(Xa,Xc,Za,Zc) | s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xc,Xd,Zc,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xb,Xc,Zb,Zc) | -s_t(Za,Zb,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xb,Xc,Zb,Zc)) & (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].
0.84/1.16	43 (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.84/1.16	44 (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.84/1.16	45 (all Xa all Xp all Xb all Xc (Xb = Xp | Xc = Xp | -s_t(Xa,Xp,Xc) | s_t(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb) | Xa = Xp)) # label(aSatz6_2b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	46 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	47 (all Xp all Xa all Xr all Xq (-s_m(Xp,Xa,Xr) | -s_m(Xp,Xa,Xq) | Xr = Xq)) # label(aSatz7_4b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	48 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-s_ifs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | s_e(Xb,Xd,Xb1,Xd1))) # label(aSatz4_2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	49 (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].
0.84/1.16	50 (all Xa all Xb all Xc all Xd (s_t(Xa,Xc,Xd) | Xc = Xb | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	51 (all Xa all Xp all Xb (sameside(Xb,Xp,Xa) | -sameside(Xa,Xp,Xb))) # label(aSatz6_6) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	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.84/1.16	53 (all Xa all Xb all Xc (s_col(Xc,Xa,Xb) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11b) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	54 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	55 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1) | -s_t(Xa1,Xb1,Xc1) | -s_t(Xa,Xb,Xc))) # label(aSatz2_11) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	56 (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.84/1.16	57 (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.84/1.16	58 (all Xa all Xc all Xd le(Xa,Xa,Xc,Xd)) # label(aSatz5_11) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	59 (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].
0.84/1.16	60 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((-s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xp,Xa1) | s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1) | -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)))) # label(aSatz3_17) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	61 (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.84/1.16	62 (all Xa all Xc all Xb all Xc1 (-s_t(Xa,Xc,Xb) | Xc1 = Xc | -s_e(Xb,Xc,Xb,Xc1) | -s_e(Xa,Xc,Xa,Xc1))) # label(aSatz4_19) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	63 (all Xp all Xq all Xr all Xa (Xa = Xp | sameside(Xa,Xp,Xr) | sameside(Xa,Xp,Xq) | -s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xp = Xr | Xp = Xq)) # label(aSatz6_15a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	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_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)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa3,Xb1,Xb3)))) # label(d_Defn4_4) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	65 (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.84/1.16	66 (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.84/1.16	67 (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.84/1.16	68 (all Xa all Xb (Xb = Xa | -s_col(Xa,Xb,pointOffLine(Xa,Xb)))) # label(aSatz6_25) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	69 (all Xa all Xb all Xc all Xp all Xq (Xa = Xb | -s_e(Xa,Xp,Xa,Xq) | s_e(Xc,Xp,Xc,Xq) | -s_e(Xb,Xp,Xb,Xq) | -s_col(Xa,Xb,Xc))) # label(aSatz4_17) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	70 (all Xa all Xp (Xp = Xa | s(Xa,Xp) != Xp)) # label(aSatz7_10a) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	71 (all Xq all Xa all Xd all Xb all Xc (-s_t(Xq,Xa,Xd) | -s_e(Xa,Xd,Xb,Xc) | Xd = ext(Xq,Xa,Xb,Xc) | Xq = Xa)) # label(aSatz2_12) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	72 (all Xa all Xb all Xc all Xd (s_e(Xa,Xb,Xd,Xc) | -s_e(Xa,Xb,Xc,Xd))) # label(aSatz2_5) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	73 (all Xp all Xq all Xr all Xa (Xr = Xp | -sameside(Xa,Xp,Xr) | s_col(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xq = Xp)) # label(aSatz6_15c) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	74 (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(Xb,Xc,XA,XB) | s_e(Xa,Xc,XA,XC) | -s_t(Xa,Xb,Xc))) # label(aSatz2_15) # label(axiom) # label(non_clause).  [assumption].
0.84/1.16	75 (all Xa all Xb all Xc all Xa1 all Xc1 ((-s_t(Xa,Xb,Xc) | s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1)) & (-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].
0.84/1.16	76 (all Xa all Xp (s(Xa,Xp) = Xp | Xp != Xa)) # label(aSatz7_10b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	77 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	78 (all Xa all Xm (Xa = Xm | -s_m(Xa,Xm,Xa))) # label(aSatz7_3a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	79 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | Xp != Xb) & (-sameside(Xa,Xp,Xb) | s_t(Xa,Xp,c63(Xa,Xp,Xb))) & (s_t(Xb,Xp,c63(Xa,Xp,Xb)) | -sameside(Xa,Xp,Xb)) & (Xp != c63(Xa,Xp,Xb) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | Xa != Xp))) # label(aSatz6_3a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	80 (all Xa all Xp all Xb ((-s_t(Xa,Xp,Xb) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | s_col(Xa,Xp,Xb)))) # label(aSatz6_4a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	81 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xa,Xc,Xd) | s_t(Xb,Xc,Xd))) # label(aSatz3_6a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	82 (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.87/1.16	83 (all Xa all Xb all Xp all Xq all Xr (Xb = Xa | -s_col(Xp,Xq,Xa) | -s_col(Xp,Xq,Xb) | -s_col(Xp,Xq,Xr) | s_col(Xa,Xb,Xr) | Xp = Xq)) # label(aSatz6_18) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	84 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (-le(Xa,Xb,Xc,Xd) | -s_e(Xc,Xd,Xc1,Xd1) | le(Xa1,Xb1,Xc1,Xd1) | -s_e(Xa,Xb,Xa1,Xb1))) # label(aSatz5_6) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	85 (all Xa all Xp all Xb all Xc (Xp = Xa | Xp = Xc | sameside(Xa,Xp,Xb) | -s_t(Xb,Xp,Xc) | -s_t(Xa,Xp,Xc) | Xp = Xb)) # label(aSatz6_2a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	86 (all Xa all Xb all Xc (-le(Xa,Xb,Xa,Xc) | -le(Xb,Xc,Xa,Xc) | s_t(Xa,Xb,Xc) | -s_col(Xa,Xb,Xc))) # label(aSatz5_12b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	87 (all Xp all Xq all Xr all Xa (Xp = Xq | s_col(Xa,Xp,Xq) | -sameside(Xa,Xp,Xq) | -s_t(Xq,Xp,Xr) | Xp = Xr)) # label(aSatz6_15b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	88 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xb,Xa1,Xb1) | -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].
0.87/1.16	89 (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.87/1.16	90 (all Xa all Xb all Xc (s_col(Xa,Xc,Xb) | -s_col(Xa,Xb,Xc))) # label(aSatz4_11e) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	91 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | le(Xb,Xc,Xa,Xc) | -s_t(Xa,Xb,Xc))) # label(aSatz5_12a2) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	92 (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].
0.87/1.16	93 (all Xa all Xb all Xc all Xc1 (-s_e(Xb,Xc,Xb,Xc1) | Xc = Xc1 | -s_e(Xa,Xc,Xa,Xc1) | -s_col(Xa,Xb,Xc) | Xa = Xb)) # label(aSatz4_18) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	94 (all Xp all Xq (Xp = Xq | s_col(Xp,Xq,Xp))) # label(aSatz6_17a) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	95 (all Xp all Xa all Xq (Xq = s(Xa,Xp) | -s_m(Xp,Xa,Xq))) # label(aSatz7_6) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	96 (all Xa all Xp all Xb ((-sameside(Xa,Xp,Xb) | Xp != Xb) & (s_t(Xp,Xb,Xa) | s_t(Xp,Xa,Xb) | -sameside(Xa,Xp,Xb)) & (-s_t(Xp,Xb,Xa) | Xp = Xa | Xp = Xb | sameside(Xa,Xp,Xb)) & (Xp = Xa | xb = Xp | sameside(Xa,Xp,Xb) | -s_t(Xp,Xa,Xb)) & (-sameside(Xa,Xp,Xb) | Xp != Xa))) # label(d_Defn6_1) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	97 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-sameside(Xa,Xb,Xc) | -sameside(Xa1,Xb1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xa,Xb1,Xa1))) # label(aSatz6_28) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	98 (all Xb all Xa Xb != ext(Xa,Xb,alpha,gamma)) # label(aSatz3_14b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.16	99 (all Xa all Xp (sameside(Xa,Xp,Xa) | Xp = Xa)) # label(aSatz6_5) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	100 (all Xa all Xm all 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)) & (-s_m(Xa,Xm,Xb) | s_t(Xa,Xm,Xb)))) # label(d_Defn7_1) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	101 (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.87/1.17	102 (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.87/1.17	103 (all Xa all Xp all Xb (-s_t(Xp,Xa,Xb) | le(Xp,Xa,Xp,Xb) | -sameside(Xa,Xp,Xb))) # label(aSatz6_13b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	104 (all Xa all Xb all Xc all Xd (-s_t(Xb,Xc,Xd) | s_t(Xa,Xb,Xd) | Xb = Xc | -s_t(Xa,Xb,Xc))) # label(aSatz3_7b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	105 (all Xa all Xp all Xb all Xc (-s_t(Xa,Xp,Xc) | -s_t(Xb,Xp,Xc) | Xp = Xc | Xb = Xp | Xa = Xp | sameside(Xa,Xp,Xb))) # label(aSatz6_3b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	106 (all Xr all Xa all Xb all Xc all Xp all Xq (Xr = Xa | Xb = Xc | -sameside(Xp,Xa,Xr) | -s_e(Xa,Xp,Xb,Xc) | -sameside(Xq,Xa,Xr) | -s_e(Xa,Xq,Xb,Xc) | Xq = Xp)) # label(aSatz6_11b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	107 (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].
0.87/1.17	108 (all Xp all Xq all Xcs all Xr (Xp = Xq | -s_col(Xp,Xq,Xcs) | -s_col(Xp,Xq,Xr) | s_col(Xp,Xcs,Xr) | Xp = Xcs)) # label(aSatz6_16b) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	109 (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].
0.87/1.17	110 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
0.87/1.17	111 (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.87/1.17	112 -(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_15b) # label(negated_conjecture) # label(non_clause).  [assumption].
0.87/1.17	
0.87/1.17	============================== end of process non-clausal formulas ===
0.87/1.17	
0.87/1.17	============================== PROCESS INITIAL CLAUSES ===============
0.87/1.17	
0.87/1.17	============================== PREDICATE ELIMINATION =================
0.87/1.17	113 -s_col(A,B,C) | -s_e(A,D,E,F) | -s_e(B,D,V6,F) | s_fs(A,B,C,D,E,V6,V7,F) | -s_e3(A,B,C,E,V6,V7) # label(d_Defn4_15) # label(axiom).  [clausify(17)].
0.87/1.17	114 -s_fs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_15) # label(axiom).  [clausify(17)].
0.87/1.17	115 -s_fs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(d_Defn4_15) # label(axiom).  [clausify(17)].
0.87/1.17	116 -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(17)].
0.87/1.17	117 -s_fs(A,B,C,D,E,F,V6,V7) | s_col(A,B,C) # label(d_Defn4_15) # label(axiom).  [clausify(17)].
0.87/1.17	118 -s_fs(A,B,C,D,E,F,V6,V7) | s_e(C,D,V6,V7) | B = A # label(aSatz4_16) # label(axiom).  [clausify(61)].
0.87/1.17	Derived: s_e(A,B,C,D) | E = F | -s_col(F,E,A) | -s_e(F,B,V6,D) | -s_e(E,B,V7,D) | -s_e3(F,E,A,V6,V7,C).  [resolve(118,a,113,d)].
0.87/1.17	119 -s_t(A,B,C) | -s_e(A,D,E,F) | s_afs(A,B,C,D,E,V6,V7,F) | -s_e(B,D,V6,F) | -s_e(B,C,V6,V7) | -s_e(A,B,E,V6) | -s_t(E,V6,V7) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	120 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	121 s_e(A,B,C,D) | -s_afs(E,A,F,B,V6,C,V7,D) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	122 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	123 s_e(A,B,C,D) | -s_afs(A,B,E,F,C,D,V6,V7) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	124 s_t(A,B,C) | -s_afs(D,E,F,V6,A,B,C,V7) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	125 s_t(A,B,C) | -s_afs(A,B,C,D,E,F,V6,V7) # label(d_Defn2_10) # label(axiom).  [clausify(24)].
0.87/1.17	126 -s_t(A,B,C) | -s_m(A,D,E) | -s_m(C,F,V6) | s_kf(A,D,E,B,V6,F,C) | -s_e(B,C,B,V6) | -s_e(B,A,B,E) | -s_t(E,B,V6) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	127 -s_kf(A,B,C,D,E,F,V6) | s_t(C,D,E) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	128 -s_kf(A,B,C,D,E,F,V6) | s_m(A,B,C) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	129 s_m(A,B,C) | -s_kf(D,E,F,V6,C,B,A) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	130 s_e(A,B,A,C) | -s_kf(D,E,F,A,C,V6,B) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	131 s_e(A,B,A,C) | -s_kf(B,D,C,A,E,F,V6) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	132 s_t(A,B,C) | -s_kf(A,D,E,B,F,V6,C) # label(d_Defn7_23) # label(axiom).  [clausify(25)].
0.87/1.18	133 -s_t(A,B,C) | -s_e(A,C,D,E) | s_ifs(A,B,C,F,D,V6,E,V7) | -s_e(C,F,E,V7) | -s_e(A,F,D,V7) | -s_e(B,C,V6,E) | -s_t(D,V6,E) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	134 -s_ifs(A,B,C,D,E,F,V6,V7) | s_t(A,B,C) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	135 s_e(A,B,C,D) | -s_ifs(A,E,B,F,C,V6,D,V7) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	136 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	137 s_e(A,B,C,D) | -s_ifs(E,F,A,B,V6,V7,C,D) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	138 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	139 s_t(A,B,C) | -s_ifs(D,E,F,V6,A,B,C,V7) # label(d_Defn4_1) # label(axiom).  [clausify(42)].
0.87/1.18	140 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(aSatz4_2) # label(axiom).  [clausify(48)].
0.87/1.18	Derived: s_e(A,B,C,D) | -s_t(E,A,F) | -s_e(E,F,V6,V7) | -s_e(F,B,V7,D) | -s_e(E,B,V6,D) | -s_e(A,F,C,V7) | -s_t(V6,C,V7).  [resolve(140,a,133,c)].
0.87/1.18	141 -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)].
0.87/1.18	142 s_e(A,B,C,D) | -s_e3(A,B,E,C,D,F) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
0.87/1.18	143 s_e(A,B,C,D) | -s_e3(E,A,B,F,C,D) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
0.87/1.18	144 -s_e3(A,B,C,D,E,F) | s_e(A,C,D,F) # label(d_Defn4_4) # label(axiom).  [clausify(64)].
0.87/1.18	145 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | s_col(D,E,F) # label(aSatz4_13) # label(axiom).  [clausify(66)].
0.87/1.18	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(145,b,141,c)].
0.87/1.18	146 -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(75)].
0.87/1.18	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_e(A,B,D,insert(A,B,D,E)).  [resolve(146,b,142,b)].
0.87/1.18	Derived: -s_t(A,B,C) | -s_e(A,C,D,E) | s_e(B,C,insert(A,B,D,E),E).  [resolve(146,b,143,b)].
0.87/1.18	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(146,b,145,b)].
0.87/1.18	147 -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(101)].
0.87/1.18	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_e(B,C,E,insert5(A,B,C,D,E)).  [resolve(147,c,143,b)].
0.87/1.18	Derived: -s_col(A,B,C) | -s_e(A,B,D,E) | s_e(A,C,D,insert5(A,B,C,D,E)).  [resolve(147,c,144,a)].
0.87/1.18	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(147,c,145,b)].
0.87/1.18	148 -s_t(A,B,C) | -s_e3(A,B,C,D,E,F) | s_t(D,E,F) # label(aSatz4_6) # label(axiom).  [clausify(111)].
0.87/1.18	Derived: -s_t(A,B,C) | s_t(D,E,F) | -s_e(A,B,D,E) | -s_e(A,C,D,F) | -s_e(B,C,E,F).  [resolve(148,b,141,c)].
0.87/1.18	Derived: -s_t(A,B,C) | s_t(D,insert(A,B,D,E),E) | -s_t(A,B,C) | -s_e(A,C,D,E).  [resolve(148,b,146,b)].
0.87/1.18	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(148,b,147,c)].
0.87/1.18	149 s_e(A,B,C,D) | E = F | -s_col(F,E,A) | -s_e(F,B,V6,D) | -s_e(E,B,V7,D) | -s_e3(F,E,A,V6,V7,C).  [resolve(118,a,113,d)].
0.87/1.18	Derived: s_e(A,B,C,D) | E = F | -s_col(F,E,A) | -s_e(F,B,V6,D) | -s_e(E,B,V7,D) | -s_e(F,E,V6,V7) | -s_e(F,A,V6,C) | -s_e(E,A,V7,C).  [resolve(149,f,141,c)].
0.87/1.18	Derived: s_e(A,B,C,D) | E = F | -s_col(F,E,A) | -s_e(F,B,V6,D) | -s_e(E,B,insert(F,E,V6,C),D) | -s_t(F,E,A) | -s_e(F,A,V6,C).  [resolve(149,f,146,b)].
0.87/1.18	Derived: s_e(A,B,insert5(C,D,A,E,F),V6) | D = C | -s_col(C,D,A) | -s_e(C,B,E,V6) | -s_e(D,B,F,V6) | -s_col(C,D,A) | -s_e(C,D,E,F).  [resolve(149,f,147,c)].
3.21/3.50	
3.21/3.50	============================== end predicate elimination =============
3.21/3.50	
3.21/3.50	Auto_denials:  (non-Horn, no changes).
3.21/3.50	
3.21/3.50	Term ordering decisions:
3.21/3.50	Function symbol KB weights:  alpha=1. gamma=1. xb=1. beta=1. c1=1. c2=1. c3=1. c4=1. s=1. pointOffLine=1. c63=1. insert=1. ext=1. ins=1. insert5=1. ip=1. crossbar=1.
3.21/3.50	
3.21/3.50	============================== end of process initial clauses ========
3.21/3.50	
3.21/3.50	============================== CLAUSES FOR SEARCH ====================
3.21/3.50	
3.21/3.50	============================== end of clauses for search =============
3.21/3.50	
3.21/3.50	============================== SEARCH ================================
3.21/3.50	
3.21/3.50	% Starting search at 0.06 seconds.
3.21/3.50	
3.21/3.50	Low Water (keep): wt=51.000, iters=3374
3.21/3.50	
3.21/3.50	Low Water (keep): wt=46.000, iters=3385
3.21/3.50	
3.21/3.50	Low Water (keep): wt=45.000, iters=3471
3.21/3.50	
3.21/3.50	Low Water (keep): wt=42.000, iters=3375
3.21/3.50	
3.21/3.50	Low Water (keep): wt=41.000, iters=3351
3.21/3.50	
3.21/3.50	Low Water (keep): wt=40.000, iters=3548
3.21/3.50	
3.21/3.50	Low Water (keep): wt=39.000, iters=3348
3.21/3.50	
3.21/3.50	Low Water (keep): wt=38.000, iters=3356
3.21/3.50	
3.21/3.50	Low Water (keep): wt=36.000, iters=3441
3.21/3.50	
3.21/3.50	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 25 (0.00 of 1.73 sec).
3.21/3.50	
3.21/3.50	Low Water (keep): wt=34.000, iters=3336
3.21/3.50	
3.21/3.50	Low Water (keep): wt=32.000, iters=3337
3.21/3.50	
3.21/3.50	Low Water (keep): wt=31.000, iters=3349
3.21/3.50	
3.21/3.50	Low Water (keep): wt=30.000, iters=3357
3.21/3.50	
3.21/3.50	Low Water (keep): wt=29.000, iters=3375
3.21/3.50	
3.21/3.50	Low Water (keep): wt=28.000, iters=3407
3.21/3.50	
3.21/3.50	Low Water (keep): wt=27.000, iters=3343
3.21/3.50	
3.21/3.50	Low Water (keep): wt=26.000, iters=3358
3.21/3.50	
3.21/3.50	Low Water (keep): wt=25.000, iters=3450
3.21/3.50	
3.21/3.50	Low Water (displace): id=11823, wt=20.000
3.21/3.50	
3.21/3.50	Low Water (displace): id=11870, wt=17.000
3.21/3.50	
3.21/3.50	Low Water (displace): id=11908, wt=16.000
3.21/3.50	
3.21/3.50	Low Water (keep): wt=24.000, iters=3348
3.21/3.50	
3.21/3.50	Low Water (displace): id=12014, wt=14.000
3.21/3.50	
3.21/3.50	Low Water (keep): wt=23.000, iters=3347
3.21/3.50	
3.21/3.50	Low Water (keep): wt=22.000, iters=3338
3.21/3.50	
3.21/3.50	Low Water (displace): id=13896, wt=12.000
3.21/3.50	
3.21/3.50	Low Water (keep): wt=21.000, iters=3338
3.21/3.50	
3.21/3.50	Low Water (keep): wt=20.000, iters=3338
3.21/3.50	
3.21/3.50	Low Water (displace): id=14828, wt=11.000
3.21/3.50	
3.21/3.50	Low Water (keep): wt=19.000, iters=5758
3.21/3.50	
3.21/3.50	Low Water (keep): wt=18.000, iters=5068
3.21/3.50	
3.21/3.50	Low Water (keep): wt=17.000, iters=4365
3.21/3.50	
3.21/3.50	============================== PROOF =================================
3.21/3.50	% SZS status Theorem
3.21/3.50	% SZS output start Refutation
3.21/3.50	
3.21/3.50	% Proof 1 at 2.32 (+ 0.05) seconds.
3.21/3.50	% Length of proof is 9.
3.21/3.50	% Level of proof is 3.
3.21/3.50	% Maximum clause weight is 16.000.
3.21/3.50	% Given clauses 1144.
3.21/3.50	
3.21/3.50	36 (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.21/3.50	110 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
3.21/3.50	112 -(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_15b) # label(negated_conjecture) # label(non_clause).  [assumption].
3.21/3.50	194 -s_t(A,B,C) | s_t(s(D,A),s(D,B),s(D,C)) # label(aSatz7_15a) # label(axiom).  [clausify(36)].
3.21/3.50	273 s(A,s(A,B)) = B # label(aSatz7_7) # label(axiom).  [clausify(110)].
3.21/3.50	274 -s_t(c1,c2,c3) # label(aSatz7_15b) # label(negated_conjecture).  [clausify(112)].
3.21/3.50	275 s_t(s(c4,c1),s(c4,c2),s(c4,c3)) # label(aSatz7_15b) # label(negated_conjecture).  [clausify(112)].
3.21/3.50	574 s_t(s(A,s(c4,c1)),s(A,s(c4,c2)),s(A,s(c4,c3))).  [resolve(275,a,194,a)].
3.21/3.50	18061 $F.  [para(273(a,1),574(a,1)),rewrite([273(6),273(7)]),unit_del(a,274)].
3.21/3.50	
3.21/3.50	% SZS output end Refutation
3.21/3.50	============================== end of proof ==========================
3.21/3.50	
3.21/3.50	============================== STATISTICS ============================
3.21/3.50	
3.21/3.50	Given=1144. Generated=65853. Kept=17902. proofs=1.
3.21/3.50	Usable=1100. Sos=9999. Demods=36. Limbo=3, Disabled=6982. Hints=0.
3.21/3.50	Megabytes=11.04.
3.21/3.50	User_CPU=2.32, System_CPU=0.05, Wall_clock=3.
3.21/3.50	
3.21/3.50	============================== end of statistics =====================
3.21/3.50	
3.21/3.50	============================== end of search =========================
3.21/3.50	
3.21/3.50	THEOREM PROVED
3.21/3.50	% SZS status Theorem
3.21/3.50	
3.21/3.50	Exiting with 1 proof.
3.21/3.50	
3.21/3.50	Process 26172 exit (max_proofs) Thu Aug 29 11:22:07 2019
3.21/3.50	Prover9 interrupted
3.21/3.50	EOF