0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.23	% Computer   : n119.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:24:09 CDT 2018
0.02/0.23	% CPUTime    : 
0.40/0.64	============================== Prover9 ===============================
0.40/0.64	Prover9 (32) version 2009-11A, November 2009.
0.40/0.64	Process 14802 was started by sandbox on n119.star.cs.uiowa.edu,
0.40/0.64	Sat Jul 14 04:24:10 2018
0.40/0.64	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14770_n119.star.cs.uiowa.edu".
0.40/0.64	============================== end of head ===========================
0.40/0.64	
0.40/0.64	============================== INPUT =================================
0.40/0.64	
0.40/0.64	% Reading from file /tmp/Prover9_14770_n119.star.cs.uiowa.edu
0.40/0.64	
0.40/0.64	set(prolog_style_variables).
0.40/0.64	set(auto2).
0.40/0.64	    % set(auto2) -> set(auto).
0.40/0.64	    % set(auto) -> set(auto_inference).
0.40/0.64	    % set(auto) -> set(auto_setup).
0.40/0.64	    % set(auto_setup) -> set(predicate_elim).
0.40/0.64	    % set(auto_setup) -> assign(eq_defs, unfold).
0.40/0.64	    % set(auto) -> set(auto_limits).
0.40/0.64	    % set(auto_limits) -> assign(max_weight, "100.000").
0.40/0.64	    % set(auto_limits) -> assign(sos_limit, 20000).
0.40/0.64	    % set(auto) -> set(auto_denials).
0.40/0.64	    % set(auto) -> set(auto_process).
0.40/0.64	    % set(auto2) -> assign(new_constants, 1).
0.40/0.64	    % set(auto2) -> assign(fold_denial_max, 3).
0.40/0.64	    % set(auto2) -> assign(max_weight, "200.000").
0.40/0.64	    % set(auto2) -> assign(max_hours, 1).
0.40/0.64	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.40/0.64	    % set(auto2) -> assign(max_seconds, 0).
0.40/0.64	    % set(auto2) -> assign(max_minutes, 5).
0.40/0.64	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.40/0.64	    % set(auto2) -> set(sort_initial_sos).
0.40/0.64	    % set(auto2) -> assign(sos_limit, -1).
0.40/0.64	    % set(auto2) -> assign(lrs_ticks, 3000).
0.40/0.64	    % set(auto2) -> assign(max_megs, 400).
0.40/0.64	    % set(auto2) -> assign(stats, some).
0.40/0.64	    % set(auto2) -> clear(echo_input).
0.40/0.64	    % set(auto2) -> set(quiet).
0.40/0.64	    % set(auto2) -> clear(print_initial_clauses).
0.40/0.64	    % set(auto2) -> clear(print_given).
0.40/0.64	assign(lrs_ticks,-1).
0.40/0.64	assign(sos_limit,10000).
0.40/0.64	assign(order,kbo).
0.40/0.64	set(lex_order_vars).
0.40/0.64	clear(print_given).
0.40/0.64	
0.40/0.64	% formulas(sos).  % not echoed (112 formulas)
0.40/0.64	
0.40/0.64	============================== end of input ==========================
0.40/0.64	
0.40/0.64	% From the command line: assign(max_seconds, 300).
0.40/0.64	
0.40/0.64	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.40/0.64	
0.40/0.64	% Formulas that are not ordinary clauses:
0.40/0.64	1 (all X all Y all Z (-s_e(X,Y,Z,Z) | Y = X)) # label(aA3) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	2 (all X all Y all X1 all Y1 all Z all Z1 all V all V1 (-s_e(Y,Z,Y1,Z1) | -s_e(Y,V,Y1,V1) | -s_t(X,Y,Z) | -s_t(X1,Y1,Z1) | X = Y | s_e(Z,V,Z1,V1) | -s_e(X,V,X1,V1) | -s_e(X,Y,X1,Y1))) # label(aA5) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	3 (all X all Y s_e(X,Y,Y,X)) # label(aA1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	4 (all X all Y (X = Y | -s_t(X,Y,X))) # label(aA6) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	5 (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.40/0.64	6 (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.40/0.64	7 (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(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].
0.40/0.64	8 (all Xa all Xm (s_m(Xa,Xm,Xa) | Xm != Xa)) # label(aSatz7_3b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	9 (all Xa all Xb s_e(Xa,Xb,Xa,Xb)) # label(aSatz2_1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	10 (all Xa all Xb s_t(Xa,Xb,ext(Xa,Xb,alpha,gamma))) # label(aSatz3_14a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	11 (all Xa all Xc all Xb all Xc1 (-s_e(Xa,Xc,Xa,Xc1) | -s_e(Xb,Xc,Xb,Xc1) | Xc1 = Xc | -s_t(Xa,Xc,Xb))) # label(aSatz4_19) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	12 (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.40/0.64	13 (all Xp all Xq all Xcs all Xr (-s_col(Xp,Xq,Xcs) | s_col(Xp,Xcs,Xr) | -s_col(Xp,Xq,Xr) | Xcs = Xp | Xq = Xp)) # label(aSatz6_16b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	14 (all Xa all Xb all Xp all Xq all Xc all Xd all Xe (Xq = Xp | -s_col(Xp,Xq,Xc) | -s_col(Xa,Xb,Xd) | -s_col(Xp,Xq,Xd) | Xc = Xd | -s_col(Xa,Xb,Xe) | s_col(Xp,Xq,Xe) | -s_col(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz6_21) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	15 (all Xa all Xp (Xp = Xa | sameside(Xa,Xp,Xa))) # label(aSatz6_5) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	16 (all Xq all Xa all Xd all Xb all Xc (ext(Xq,Xa,Xb,Xc) = Xd | -s_e(Xa,Xd,Xb,Xc) | -s_t(Xq,Xa,Xd) | Xa = Xq)) # label(aSatz2_12) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	17 (all Xa all Xp all Xb ((Xb = Xp | sameside(Xa,Xp,Xb) | Xa = Xp | -s_t(Xp,Xb,Xa)) & (Xp = xb | sameside(Xa,Xp,Xb) | Xa = Xp | -s_t(Xp,Xa,Xb)) & (-sameside(Xa,Xp,Xb) | s_t(Xp,Xa,Xb) | s_t(Xp,Xb,Xa)) & (-sameside(Xa,Xp,Xb) | Xb != Xp) & (Xa != Xp | -sameside(Xa,Xp,Xb)))) # label(d_Defn6_1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	18 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all 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_e(Xb,Xd,Xb1,Xd1) | s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1) | -s_e(Xa,Xd,Xa1,Xd1) | -s_col(Xa,Xb,Xc)) & (s_e(Xb,Xd,Xb1,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_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.40/0.64	19 (all Xa all Xb le(Xa,Xb,Xa,Xb)) # label(aSatz5_7) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	20 (all Xa all Xb all Xd all Xc (s_t(Xa,Xc,Xb) | s_t(Xa,Xb,Xc) | -s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz5_3) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	21 (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.40/0.64	22 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-sameside(Xa1,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xb,Xc,Xb1,Xc1) | -s_e(Xb,Xa,Xb1,Xa1) | -sameside(Xa,Xb,Xc))) # label(aSatz6_28) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	23 (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].
0.40/0.64	24 (all Xa all Xp all Xb ((s_col(Xa,Xp,Xb) | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xb)))) # label(aSatz6_4a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	25 (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].
0.40/0.64	26 (all Xa all Xb all Xc all Xd (-s_t(Xb,Xc,Xd) | Xb = Xc | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz3_7a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	27 (all Xa all Xb s_t(Xa,Xb,Xb)) # label(aSatz3_1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	28 (all Xa all Xb all Xc all Xd (Xb = Xa | s_t(Xb,Xd,Xc) | s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xd) | -s_t(Xa,Xb,Xc))) # label(aSatz5_2) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	29 (all Xa all Xb all Xp all Xq all Xr (Xp = Xq | -s_col(Xp,Xq,Xb) | s_col(Xa,Xb,Xr) | -s_col(Xp,Xq,Xr) | -s_col(Xp,Xq,Xa) | Xa = Xb)) # label(aSatz6_18) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	30 (all Xr all Xa all Xb all Xc ((sameside(insert(Xb,Xc,Xa,Xr),Xa,Xr) | Xb = Xc | Xa = Xr) & (Xb = Xc | s_e(Xa,insert(Xb,Xc,Xa,Xr),Xb,Xc) | Xr = Xa))) # label(aSatz6_11a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	31 (all Xa all Xb all Xc all Xd all Xe all Xf (-le(Xa,Xb,Xc,Xd) | -le(Xc,Xd,Xe,Xf) | le(Xa,Xb,Xe,Xf))) # label(aSatz5_8) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	32 (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.40/0.64	33 (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.40/0.64	34 (all Xa all Xb s_col(Xa,Xa,Xb)) # label(aSatz4_12) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	35 (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].
0.40/0.64	36 (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.40/0.64	37 (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].
0.40/0.64	38 (all Xa all Xb all Xc all Xd all Xa1 all Xb1 all Xc1 all Xd1 (s_e(Xc,Xd,Xc1,Xd1) | Xa = Xb | -s_fs(Xa,Xb,Xc,Xd,Xa1,Xb1,Xc1,Xd1))) # label(aSatz4_16) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	39 (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.40/0.64	40 (all Xr all Xa all Xb all Xc all Xp all Xq (-sameside(Xp,Xa,Xr) | -s_e(Xa,Xp,Xb,Xc) | -s_e(Xa,Xq,Xb,Xc) | Xq = Xp | -sameside(Xq,Xa,Xr) | Xc = Xb | Xa = Xr)) # label(aSatz6_11b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	41 (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.40/0.64	42 (all Xa all Xm (Xm = Xa | -s_m(Xa,Xm,Xa))) # label(aSatz7_3a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	43 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | -s_t(Xa,Xb,Xc) | le(Xa,Xb,Xa,Xc))) # label(aSatz5_12a1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	44 (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.40/0.64	45 (all Xp all Xq all Xr all Xa (Xp = Xq | Xr = Xp | -s_t(Xq,Xp,Xr) | s_col(Xa,Xp,Xq) | Xa != Xp)) # label(aSatz6_15d) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	46 (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.40/0.64	47 (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.40/0.64	48 (all Xa all Xb all Xc all Xa1 all Xb1 (s_e3(Xa,Xb,Xc,Xa1,Xb1,insert5(Xa,Xb,Xc,Xa1,Xb1)) | -s_e(Xa,Xb,Xa1,Xb1) | -s_col(Xa,Xb,Xc))) # label(aSatz4_14) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	49 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | -s_t(Xb,Xc,Xd) | Xb = Xc | s_t(Xa,Xb,Xd))) # label(aSatz3_7b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	50 (all Xa all Xb all Xc all Xd (-s_e(Xa,Xb,Xc,Xd) | s_e(Xb,Xa,Xc,Xd))) # label(aSatz2_4) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	51 (all Xa all Xp all Xb all Xc (-s_t(Xb,Xp,Xc) | sameside(Xa,Xp,Xb) | -s_t(Xa,Xp,Xc) | Xp = Xc | Xb = Xp | Xp = Xa)) # label(aSatz6_2a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	52 (all Xa all Xb all Xc all Xa1 all Xc1 ((-s_e(Xa,Xc,Xa1,Xc1) | s_t(Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_t(Xa,Xb,Xc)) & (s_e3(Xa,Xb,Xc,Xa1,insert(Xa,Xb,Xa1,Xc1),Xc1) | -s_e(Xa,Xc,Xa1,Xc1) | -s_t(Xa,Xb,Xc)))) # label(aSatz4_5) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	53 (all Xa all Xb all Xc ((-s_t(Xc,Xa,Xb) | s_col(Xa,Xb,Xc)) & (-s_t(Xb,Xc,Xa) | s_col(Xa,Xb,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_t(Xa,Xb,Xc)))) # label(d_Defn4_10) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	54 (all Xa all Xb all Xc all Xp all Xq (Xa = Xb | -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.40/0.64	55 (all Xa all Xb s_e(Xa,Xa,Xb,Xb)) # label(aSatz2_8) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	56 (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.40/0.64	57 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	58 (all Xa1 all Xb1 s_t(Xa1,Xa1,Xb1)) # label(aSatz3_3) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	59 (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.40/0.64	60 (all Xb all Xc all Xa (-s_e(Xb,Xc,Xa,Xa) | Xb = Xc)) # label(aSatz2_13) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	61 (all Xa all Xp all Xb ((Xp != Xa | -sameside(Xa,Xp,Xb)) & (-sameside(Xa,Xp,Xb) | Xp != Xb) & (-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) | s_t(Xa,Xp,c63(Xa,Xp,Xb))))) # label(aSatz6_3a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	62 (all Xa all Xb all Xc all Xd (s_t(Xc,Xd,Xb) | s_t(Xd,Xc,Xb) | -s_t(Xd,Xa,Xb) | -s_t(Xc,Xa,Xb) | Xa = Xb)) # label(aSatz6_16a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	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].
0.40/0.64	64 (all Xa all Xb all Xc all Xa1 all Xb1 all Xp ((-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(Xa,Xb,Xc) | -s_t(Xa1,Xb1,Xc) | -s_t(Xa,Xp,Xa1) | s_t(Xb,crossbar(Xa,Xb,Xc,Xa1,Xb1,Xp),Xb1)))) # label(aSatz3_17) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	65 (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].
0.40/0.64	66 (all Xa all Xm all Xb ((s_e(Xm,Xa,Xm,Xb) | -s_m(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.40/0.64	67 (all Xa all Xb (Xb = Xa | -s_col(Xa,Xb,pointOffLine(Xa,Xb)))) # label(aSatz6_25) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	68 (all Xa all Xb all Xd all Xc (s_t(Xa,Xb,Xc) | -s_t(Xb,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	69 (all Xa all Xb all Xc all Xd (-s_t(Xa,Xb,Xc) | s_t(Xa,Xb,Xd) | -s_t(Xa,Xc,Xd))) # label(aSatz3_6b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	70 (all Xp all Xq all Xr all Xa (Xp = Xr | -s_t(Xq,Xp,Xr) | -sameside(Xa,Xp,Xq) | s_col(Xa,Xp,Xq) | Xq = Xp)) # label(aSatz6_15b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	71 (all Xa all Xb all Xc (Xb = Xc | -s_e(Xa,Xc,Xa,Xb) | -s_t(Xa,Xb,Xc))) # label(aNarbouxLemma1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	72 (all Xa all Xb all Xc all Xd (Xb = Xa | -s_t(Xa,Xb,Xd) | s_t(Xa,Xc,Xd) | s_t(Xa,Xd,Xc) | -s_t(Xa,Xb,Xc))) # label(aSatz5_1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	73 (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.40/0.64	74 (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.40/0.64	75 (all Xa all Xb all Xc all XA all XB all XC (-s_e(Xb,Xc,XA,XB) | s_e(Xa,Xc,XA,XC) | -s_e(Xa,Xb,XB,XC) | -s_t(XA,XB,XC) | -s_t(Xa,Xb,Xc))) # label(aSatz2_15) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	76 (all Xa all Xp all Xb all Xc (Xa = Xp | Xp = Xb | -s_t(Xa,Xp,Xc) | s_t(Xb,Xp,Xc) | -sameside(Xa,Xp,Xb) | Xp = Xc)) # label(aSatz6_2b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	77 (all Xa all Xb s_col(Xa,Xb,Xa)) # label(aSatz4_12b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	78 (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.40/0.64	79 (all Xa all Xb all Xc all Xa1 all Xb1 all Xc1 (-s_t(Xa,Xb,Xc) | -s_e(Xb,Xc,Xb1,Xc1) | s_e(Xa,Xc,Xa1,Xc1) | -s_e(Xa,Xb,Xa1,Xb1) | -s_t(Xa1,Xb1,Xc1))) # label(aSatz2_11) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	80 (all Xp all Xa all Xr all Xq (-s_m(Xp,Xa,Xq) | Xq = Xr | -s_m(Xp,Xa,Xr))) # label(aSatz7_4b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	81 (all Xa all Xb all Xd all Xc (-s_t(Xb,Xc,Xd) | s_t(Xa,Xc,Xd) | -s_t(Xa,Xb,Xd))) # label(aSatz3_5b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	82 (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.40/0.64	83 (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.40/0.64	84 (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.40/0.64	85 (all Xp all Xa all Xq (-s_m(Xp,Xa,Xq) | s(Xa,Xp) = Xq)) # label(aSatz7_6) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	86 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_t(Za,Zb,Zc) | -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_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,Xc,Za,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(Xb,Xc,Zb,Zc)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xc,Xd,Zc,Zd)) & (-s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_e(Xa,Xc,Za,Zc)) & (s_t(Xa,Xb,Xc) | -s_ifs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)))) # label(d_Defn4_1) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	87 (all Xb all Xa Xb != ext(Xa,Xb,alpha,gamma)) # label(aSatz3_14b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	88 (all Xp all Xq all Xr all Xa (-s_col(Xa,Xp,Xq) | sameside(Xa,Xp,Xr) | sameside(Xa,Xp,Xq) | Xa = Xp | -s_t(Xq,Xp,Xr) | Xp = Xr | Xp = Xq)) # label(aSatz6_15a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	89 (all Xp all Xa s_m(Xp,Xa,s(Xa,Xp))) # label(aSatz7_4a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	90 (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].
0.40/0.64	91 (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.40/0.64	92 (all Xa all Xp all Xb all Xc (Xp = Xb | -s_t(Xb,Xp,Xc) | -s_t(Xa,Xp,Xc) | Xc = Xp | Xa = Xp | sameside(Xa,Xp,Xb))) # label(aSatz6_3b) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	93 (all Xa all Xb all Xc all Xc1 (Xc = Xc1 | -s_e(Xb,Xc,Xb,Xc1) | -s_e(Xa,Xc,Xa,Xc1) | -s_col(Xa,Xb,Xc) | Xb = Xa)) # label(aSatz4_18) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	94 (all Xp all Xq (Xq = Xp | s_col(Xp,Xq,Xp))) # label(aSatz6_17a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	95 (all Xa all Xp all Xb (-sameside(Xa,Xp,Xb) | sameside(Xb,Xp,Xa))) # label(aSatz6_6) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	96 (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.40/0.64	97 (all Xp all Xq all Xr all Xa (Xr = Xp | -s_t(Xq,Xp,Xr) | s_col(Xa,Xp,Xq) | -sameside(Xa,Xp,Xr) | Xp = Xq)) # label(aSatz6_15c) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	98 (all Xa all Xc all Xd le(Xa,Xa,Xc,Xd)) # label(aSatz5_11) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	99 (all Xa all Xb all Xc all Xd ((s_t(Xa,Xb,ins(Xc,Xd,Xa,Xb)) | -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)))) # label(aSatz5_5a) # label(axiom) # label(non_clause).  [assumption].
0.40/0.64	100 (all Xa all Xb all Xc all Xd all Y ((s_t(Xc,insert(Xa,Xb,Xc,Xd),Xd) | -le(Xa,Xb,Xc,Xd)) & (-le(Xa,Xb,Xc,Xd) | s_e(Xa,Xb,Xc,insert(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.40/0.64	101 (all Xa all Xb all Xc all Xd all Za all Zb all Zc all Zd ((s_t(Za,Zb,Zc) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd)) & (s_e(Xa,Xb,Za,Zb) | -s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,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,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_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | -s_e(Xb,Xd,Zb,Zd) | -s_e(Xa,Xd,Za,Zd) | -s_e(Xa,Xb,Za,Zb) | -s_t(Za,Zb,Zc) | -s_t(Xa,Xb,Xc)) & (-s_afs(Xa,Xb,Xc,Xd,Za,Zb,Zc,Zd) | s_t(Xa,Xb,Xc)))) # label(d_Defn2_10) # label(axiom) # label(non_clause).  [assumption].
0.40/0.65	102 (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.40/0.65	103 (all Xa all Xb all Xc (-s_col(Xa,Xb,Xc) | s_col(Xb,Xa,Xc))) # label(aSatz4_11d) # label(axiom) # label(non_clause).  [assumption].
0.40/0.65	104 (all Xa1 all Xm1 all Xb1 all Xc all Xb2 all Xm2 all Xa2 ((-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_m(Xa1,Xm1,Xb1)) & (-s_t(Xb1,Xc,Xb2) | -s_e(Xc,Xa1,Xc,Xb1) | -s_e(Xc,Xa2,Xc,Xb2) | -s_m(Xa1,Xm1,Xb1) | s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | -s_m(Xa2,Xm2,Xb2) | -s_t(Xa1,Xc,Xa2)) & (-s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,Xa2) | s_m(Xa2,Xm2,Xb2)) & (s_e(Xc,Xa2,Xc,Xb2) | -s_kf(Xa1,Xm1,Xb1,Xc,Xb2,Xm2,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_t(Xa1,Xc,Xa2)))) # label(d_Defn7_23) # label(axiom) # label(non_clause).  [assumption].
0.40/0.65	105 (all Xa1 all Xa2 all Xa3 all Xb1 all Xb2 all Xb3 ((-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa1,Xa2,Xb1,Xb2)) & (-s_e(Xa1,Xa2,Xb1,Xb2) | s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | -s_e(Xa2,Xa3,Xb2,Xb3) | -s_e(Xa1,Xa3,Xb1,Xb3)) & (-s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3) | s_e(Xa2,Xa3,Xb2,Xb3)) & (s_e(Xa1,Xa3,Xb1,Xb3) | -s_e3(Xa1,Xa2,Xa3,Xb1,Xb2,Xb3)))) # label(d_Defn4_4) # label(axiom) # label(non_clause).  [assumption].
0.40/0.65	106 -(all Xa all Xp all Xr all Xq (s(Xa,Xp) != Xr | Xr != s(Xa,Xq) | Xp = Xq)) # label(aSatz7_8) # label(negated_conjecture) # label(non_clause).  [assumption].
0.40/0.65	
0.40/0.65	============================== end of process non-clausal formulas ===
0.40/0.65	
0.40/0.65	============================== PROCESS INITIAL CLAUSES ===============
0.40/0.65	
0.40/0.65	============================== PREDICATE ELIMINATION =================
0.40/0.65	107 -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) | -s_col(A,B,C) # label(d_Defn4_15) # label(axiom).  [clausify(18)].
0.40/0.65	108 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(18)].
0.40/0.65	Derived: -s_e(A,B,C,D) | s_fs(E,A,F,B,V6,C,V7,D) | -s_e(E,B,V6,D) | -s_col(E,A,F) | -s_fs(E,A,F,V8,V6,C,V7,V9).  [resolve(107,a,108,a)].
0.40/0.65	109 s_e3(A,B,C,D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) | -s_col(A,B,C) # label(aSatz4_14) # label(axiom).  [clausify(48)].
0.40/0.65	Derived: -s_e(A,B,C,D) | -s_col(A,B,E) | -s_e(B,F,D,V6) | s_fs(A,B,E,F,C,D,insert5(A,B,E,C,D),V6) | -s_e(A,F,C,V6) | -s_col(A,B,E).  [resolve(109,a,107,a)].
0.40/0.65	110 s_e3(A,B,C,D,insert(A,B,D,E),E) | -s_e(A,C,D,E) | -s_t(A,B,C) # label(aSatz4_5) # label(axiom).  [clausify(52)].
0.40/0.65	Derived: -s_e(A,B,C,D) | -s_t(A,E,B) | -s_e(E,F,insert(A,E,C,D),V6) | s_fs(A,E,B,F,C,insert(A,E,C,D),D,V6) | -s_e(A,F,C,V6) | -s_col(A,E,B).  [resolve(110,a,107,a)].
0.40/0.65	111 -s_col(A,B,C) | -s_e3(A,B,C,D,E,F) | s_col(D,E,F) # label(aSatz4_13) # label(axiom).  [clausify(78)].
0.40/0.65	Derived: -s_col(A,B,C) | s_col(D,E,F) | -s_fs(A,B,C,V6,D,E,F,V7).  [resolve(111,b,108,a)].
0.40/0.65	Derived: -s_col(A,B,C) | s_col(D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) | -s_col(A,B,C).  [resolve(111,b,109,a)].
0.40/0.65	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(111,b,110,a)].
0.40/0.65	112 -s_t(A,B,C) | -s_e3(A,B,C,D,E,F) | s_t(D,E,F) # label(aSatz4_6) # label(axiom).  [clausify(82)].
0.40/0.65	Derived: -s_t(A,B,C) | s_t(D,E,F) | -s_fs(A,B,C,V6,D,E,F,V7).  [resolve(112,b,108,a)].
0.40/0.65	Derived: -s_t(A,B,C) | s_t(D,E,insert5(A,B,C,D,E)) | -s_e(A,B,D,E) | -s_col(A,B,C).  [resolve(112,b,109,a)].
0.40/0.65	Derived: -s_t(A,B,C) | s_t(D,insert(A,B,D,E),E) | -s_e(A,C,D,E) | -s_t(A,B,C).  [resolve(112,b,110,a)].
0.40/0.65	113 -s_e3(A,B,C,D,E,F) | s_e(A,B,D,E) # label(d_Defn4_4) # label(axiom).  [clausify(105)].
0.40/0.65	Derived: s_e(A,B,C,D) | -s_fs(A,B,E,F,C,D,V6,V7).  [resolve(113,a,108,a)].
0.40/0.65	Derived: s_e(A,B,C,insert(A,B,C,D)) | -s_e(A,E,C,D) | -s_t(A,B,E).  [resolve(113,a,110,a)].
0.40/0.65	114 -s_e(A,B,C,D) | s_e3(A,B,E,C,D,F) | -s_e(B,E,D,F) | -s_e(A,E,C,F) # label(d_Defn4_4) # label(axiom).  [clausify(105)].
0.40/0.65	Derived: -s_e(A,B,C,D) | -s_e(B,E,D,F) | -s_e(A,E,C,F) | -s_e(B,V6,D,V7) | s_fs(A,B,E,V6,C,D,F,V7) | -s_e(A,V6,C,V7) | -s_col(A,B,E).  [resolve(114,b,107,a)].
0.40/0.65	Derived: -s_e(A,B,C,D) | -s_e(B,E,D,F) | -s_e(A,E,C,F) | -s_col(A,B,E) | s_col(C,D,F).  [resolve(114,b,111,b)].
0.41/0.68	Derived: -s_e(A,B,C,D) | -s_e(B,E,D,F) | -s_e(A,E,C,F) | -s_t(A,B,E) | s_t(C,D,F).  [resolve(114,b,112,b)].
0.41/0.68	115 -s_e3(A,B,C,D,E,F) | s_e(B,C,E,F) # label(d_Defn4_4) # label(axiom).  [clausify(105)].
0.41/0.68	Derived: s_e(A,B,C,D) | -s_fs(E,A,B,F,V6,C,D,V7).  [resolve(115,a,108,a)].
0.41/0.68	Derived: s_e(A,B,C,insert5(D,A,B,E,C)) | -s_e(D,A,E,C) | -s_col(D,A,B).  [resolve(115,a,109,a)].
0.41/0.68	Derived: s_e(A,B,insert(C,A,D,E),E) | -s_e(C,B,D,E) | -s_t(C,A,B).  [resolve(115,a,110,a)].
0.41/0.68	116 s_e(A,B,C,D) | -s_e3(A,E,B,C,F,D) # label(d_Defn4_4) # label(axiom).  [clausify(105)].
0.41/0.68	Derived: s_e(A,B,C,D) | -s_fs(A,E,B,F,C,V6,D,V7).  [resolve(116,b,108,a)].
0.41/0.68	Derived: s_e(A,B,C,insert5(A,D,B,C,E)) | -s_e(A,D,C,E) | -s_col(A,D,B).  [resolve(116,b,109,a)].
0.41/0.68	117 -s_t(A,B,C) | -s_t(D,E,F) | -s_e(A,C,D,F) | -s_e(C,V6,F,V7) | s_ifs(A,B,C,V6,D,E,F,V7) | -s_e(A,V6,D,V7) | -s_e(B,C,E,F) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	118 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(aSatz4_2) # label(axiom).  [clausify(33)].
0.41/0.68	119 s_t(A,B,C) | -s_ifs(D,E,F,V6,A,B,C,V7) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	120 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	121 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	Derived: -s_t(A,B,C) | -s_t(D,E,F) | -s_e(A,C,D,F) | -s_e(C,V6,F,V7) | -s_e(A,V6,D,V7) | -s_e(B,C,E,F) | s_e(B,V6,E,V7).  [resolve(117,e,118,a)].
0.41/0.68	122 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(C,D,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	123 -s_ifs(A,B,C,D,E,F,V6,V7) | s_e(A,C,E,V6) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	124 s_t(A,B,C) | -s_ifs(A,B,C,D,E,F,V6,V7) # label(d_Defn4_1) # label(axiom).  [clausify(86)].
0.41/0.68	125 -s_e(A,B,C,D) | s_afs(E,A,B,F,V6,C,D,V7) | -s_e(A,F,C,V7) | -s_e(E,F,V6,V7) | -s_e(E,A,V6,C) | -s_t(V6,C,D) | -s_t(E,A,B) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	126 s_t(A,B,C) | -s_afs(D,E,F,V6,A,B,C,V7) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	127 s_e(A,B,C,D) | -s_afs(A,B,E,F,C,D,V6,V7) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	128 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,C,F,V6) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	129 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(A,D,E,V7) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	130 -s_afs(A,B,C,D,E,F,V6,V7) | s_e(B,D,F,V7) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	131 -s_afs(A,B,C,D,E,F,V6,V7) | s_t(A,B,C) # label(d_Defn2_10) # label(axiom).  [clausify(101)].
0.41/0.68	132 -s_t(A,B,C) | -s_e(B,D,B,A) | -s_e(B,E,B,C) | -s_m(D,F,A) | s_kf(D,F,A,B,C,V6,E) | -s_m(E,V6,C) | -s_t(D,B,E) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	133 -s_kf(A,B,C,D,E,F,V6) | s_e(D,A,D,C) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	134 -s_kf(A,B,C,D,E,F,V6) | s_m(A,B,C) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	135 -s_kf(A,B,C,D,E,F,V6) | s_m(V6,F,E) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	136 s_e(A,B,A,C) | -s_kf(D,E,F,A,C,V6,B) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	137 -s_kf(A,B,C,D,E,F,V6) | s_t(C,D,E) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	138 -s_kf(A,B,C,D,E,F,V6) | s_t(A,D,V6) # label(d_Defn7_23) # label(axiom).  [clausify(104)].
0.41/0.68	
0.41/0.68	============================== end predicate elimination =============
0.41/0.68	
0.41/0.68	Auto_denials:  (non-Horn, no changes).
0.41/0.68	
0.41/0.68	Term ordering decisions:
0.41/0.68	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.
0.41/0.68	
0.41/0.68	============================== end of process initial clauses ========
0.41/0.68	
0.41/0.68	============================== CLAUSES FOR SEARCH ====================
0.41/0.68	
0.41/0.68	============================== end of clauses for search =============
0.41/0.68	
0.41/0.68	============================== SEARCH ================================
0.41/0.68	
0.41/0.68	% Starting search at 0.03 seconds.
0.41/0.68	
0.41/0.68	============================== PROOF =================================
0.41/0.68	% SZS status Theorem
0.41/0.68	% SZS output start Refutation
0.41/0.68	
0.41/0.68	% Proof 1 at 0.05 (+ 0.00) seconds.
0.41/0.68	% Length of proof is 8.
0.41/0.68	% Level of proof is 3.
0.41/0.68	% Maximum clause weight is 7.000.
0.41/0.68	% Given clauses 116.
0.41/0.68	
0.41/0.68	57 (all Xa all Xp s(Xa,s(Xa,Xp)) = Xp) # label(aSatz7_7) # label(axiom) # label(non_clause).  [assumption].
0.41/0.68	106 -(all Xa all Xp all Xr all Xq (s(Xa,Xp) != Xr | Xr != s(Xa,Xq) | Xp = Xq)) # label(aSatz7_8) # label(negated_conjecture) # label(non_clause).  [assumption].
0.41/0.68	211 s(A,s(A,B)) = B # label(aSatz7_7) # label(axiom).  [clausify(57)].
0.41/0.68	264 s(c1,c2) = c3 # label(aSatz7_8) # label(negated_conjecture).  [clausify(106)].
0.41/0.68	265 s(c1,c4) = c3 # label(aSatz7_8) # label(negated_conjecture).  [clausify(106)].
0.41/0.68	266 c4 != c2 # label(aSatz7_8) # label(negated_conjecture).  [clausify(106)].
0.41/0.68	528 s(c1,c3) = c2.  [para(264(a,1),211(a,1,2))].
0.41/0.68	530 $F.  [para(265(a,1),211(a,1,2)),rewrite([528(3)]),flip(a),unit_del(a,266)].
0.41/0.68	
0.41/0.68	% SZS output end Refutation
0.41/0.68	============================== end of proof ==========================
0.41/0.68	
0.41/0.68	============================== STATISTICS ============================
0.41/0.68	
0.41/0.68	Given=116. Generated=894. Kept=380. proofs=1.
0.41/0.68	Usable=116. Sos=244. Demods=8. Limbo=0, Disabled=202. Hints=0.
0.41/0.68	Megabytes=0.66.
0.41/0.68	User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
0.41/0.68	
0.41/0.68	============================== end of statistics =====================
0.41/0.68	
0.41/0.68	============================== end of search =========================
0.41/0.68	
0.41/0.68	THEOREM PROVED
0.41/0.68	% SZS status Theorem
0.41/0.68	
0.41/0.68	Exiting with 1 proof.
0.41/0.68	
0.41/0.68	Process 14802 exit (max_proofs) Sat Jul 14 04:24:10 2018
0.41/0.68	Prover9 interrupted
0.49/0.77	EOF