0.12/1.34	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/1.35	% Command    : tptp2X_and_run_prover9 %d %s
0.12/1.61	% Computer   : n005.cluster.edu
0.12/1.61	% Model      : x86_64 x86_64
0.12/1.61	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/1.61	% Memory     : 8042.1875MB
0.12/1.61	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/1.61	% CPULimit   : 960
0.12/1.61	% DateTime   : Thu Jul  2 07:05:07 EDT 2020
0.12/1.61	% CPUTime    : 
0.81/4.82	============================== Prover9 ===============================
0.81/4.82	Prover9 (32) version 2009-11A, November 2009.
0.81/4.82	Process 20210 was started by sandbox on n005.cluster.edu,
0.81/4.82	Thu Jul  2 07:05:10 2020
0.81/4.82	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_19897_n005.cluster.edu".
0.81/4.82	============================== end of head ===========================
0.81/4.82	
0.81/4.82	============================== INPUT =================================
0.81/4.82	
0.81/4.82	% Reading from file /tmp/Prover9_19897_n005.cluster.edu
0.81/4.82	
0.81/4.82	set(prolog_style_variables).
0.81/4.82	set(auto2).
0.81/4.82	    % set(auto2) -> set(auto).
0.81/4.82	    % set(auto) -> set(auto_inference).
0.81/4.82	    % set(auto) -> set(auto_setup).
0.81/4.82	    % set(auto_setup) -> set(predicate_elim).
0.81/4.82	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/4.82	    % set(auto) -> set(auto_limits).
0.81/4.82	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/4.82	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/4.82	    % set(auto) -> set(auto_denials).
0.81/4.82	    % set(auto) -> set(auto_process).
0.81/4.82	    % set(auto2) -> assign(new_constants, 1).
0.81/4.82	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/4.82	    % set(auto2) -> assign(max_weight, "200.000").
0.81/4.82	    % set(auto2) -> assign(max_hours, 1).
0.81/4.82	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/4.82	    % set(auto2) -> assign(max_seconds, 0).
0.81/4.82	    % set(auto2) -> assign(max_minutes, 5).
0.81/4.82	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/4.82	    % set(auto2) -> set(sort_initial_sos).
0.81/4.82	    % set(auto2) -> assign(sos_limit, -1).
0.81/4.82	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/4.82	    % set(auto2) -> assign(max_megs, 400).
0.81/4.82	    % set(auto2) -> assign(stats, some).
0.81/4.82	    % set(auto2) -> clear(echo_input).
0.81/4.82	    % set(auto2) -> set(quiet).
0.81/4.82	    % set(auto2) -> clear(print_initial_clauses).
0.81/4.82	    % set(auto2) -> clear(print_given).
0.81/4.82	assign(lrs_ticks,-1).
0.81/4.82	assign(sos_limit,10000).
0.81/4.82	assign(order,kbo).
0.81/4.82	set(lex_order_vars).
0.81/4.82	clear(print_given).
0.81/4.82	
0.81/4.82	% formulas(sos).  % not echoed (33 formulas)
0.81/4.82	
0.81/4.82	============================== end of input ==========================
0.81/4.82	
0.81/4.82	% From the command line: assign(max_seconds, 960).
0.81/4.82	
0.81/4.82	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/4.82	
0.81/4.82	% Formulas that are not ordinary clauses:
0.81/4.82	1 (all Ax all C ((exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	2 (all Ax all C (status(Ax,C,wtc) <-> (exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	3 (all Ax all C ((all I2 model(I2,C)) & (exists I1 model(I1,Ax)) <-> status(Ax,C,tac))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	4 (all Ax all C (status(Ax,C,sca) <-> (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	5 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))) <-> status(Ax,C,eqv))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	6 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	7 (all Ax all C (status(Ax,C,wth) <-> (exists I1 model(I1,Ax)) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	8 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	9 (all Ax all C ((all I1 model(I1,Ax)) & (all I2 model(I2,not(C))) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	10 (all Ax all C ((exists I2 model(I2,C)) & (exists I3 -model(I3,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,wca))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	11 (all Ax all C (status(Ax,C,eth) <-> (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	12 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	13 (all Ax all C ((exists I1 (model(I1,not(C)) & model(I1,Ax))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	14 (all Ax all C ((-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))) <-> status(Ax,C,unp))) # label(unp) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	15 (all Ax all C (status(Ax,C,tca) <-> (all I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	16 (all Ax all C (((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))) <-> status(Ax,C,sap))) # label(sap) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	17 (all Ax all C (status(Ax,C,esa) <-> ((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	18 (all Ax all C ((all I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	19 (all Ax all C ((exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	21 (exists I1 exists Ax exists C (model(I1,Ax) & (exists I2 model(I2,C)) & -model(I1,C))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	22 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))) <-> isa(S1,S2))) # label(isa) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	23 (all S1 all S2 (nevera(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))))) # label(nevera) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	24 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	25 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & status(Ax,C,S2))) <-> mighta(S1,S2))) # label(mighta) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	26 (all S1 all S2 ((all Ax all C -(status(Ax,C,S2) <-> status(Ax,C,S1))) <-> xora(S1,S2))) # label(xora) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	29 (exists Ax exists C ((exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	30 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	32 (exists Ax exists C ((exists I2 (-model(I2,C) | -model(I2,Ax))) & (exists I1 (model(I1,C) & model(I1,Ax))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause).  [assumption].
0.81/4.82	
0.81/4.82	============================== end of process non-clausal formulas ===
0.81/4.82	
0.81/4.82	============================== PROCESS INITIAL CLAUSES ===============
0.81/4.82	
0.81/4.82	============================== PREDICATE ELIMINATION =================
0.81/4.82	33 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(22)].
0.81/4.82	34 status(f42(A,B),f43(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.81/4.82	35 -status(f42(A,B),f43(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.81/4.82	Derived: -status(A,B,C) | status(A,B,D) | status(f42(C,D),f43(C,D),C).  [resolve(33,c,34,b)].
0.81/4.82	Derived: -status(A,B,C) | status(A,B,D) | -status(f42(C,D),f43(C,D),D).  [resolve(33,c,35,b)].
0.81/4.82	36 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom).  [clausify(23)].
0.81/4.82	37 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(23)].
0.81/4.82	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,37,a)].
3.62/7.66	38 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom).  [clausify(23)].
3.62/7.66	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,a,37,a)].
3.62/7.66	39 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
3.62/7.66	40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(25)].
3.62/7.66	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(39,b,40,c)].
3.62/7.66	41 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
3.62/7.66	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(41,b,40,c)].
3.62/7.66	42 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
3.62/7.66	43 -status(f48(A,B),f49(A,B),B) | status(f48(A,B),f49(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(26)].
3.62/7.66	44 status(f48(A,B),f49(A,B),B) | -status(f48(A,B),f49(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(26)].
3.62/7.66	Derived: status(A,B,C) | status(A,B,D) | -status(f48(D,C),f49(D,C),C) | status(f48(D,C),f49(D,C),D).  [resolve(42,c,43,c)].
3.62/7.66	Derived: status(A,B,C) | status(A,B,D) | status(f48(D,C),f49(D,C),C) | -status(f48(D,C),f49(D,C),D).  [resolve(42,c,44,c)].
3.62/7.66	45 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
3.62/7.66	Derived: -status(A,B,C) | -status(A,B,D) | -status(f48(D,C),f49(D,C),C) | status(f48(D,C),f49(D,C),D).  [resolve(45,c,43,c)].
3.62/7.66	Derived: -status(A,B,C) | -status(A,B,D) | status(f48(D,C),f49(D,C),C) | -status(f48(D,C),f49(D,C),D).  [resolve(45,c,44,c)].
3.62/7.66	46 status(f50(A,B),f51(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
3.62/7.66	47 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom).  [clausify(28)].
3.62/7.66	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | status(C,D,B).  [resolve(46,b,47,c)].
3.62/7.66	48 -status(f50(A,B),f51(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
3.62/7.66	Derived: -status(f50(A,B),f51(A,B),B) | -status(C,D,A) | status(C,D,B).  [resolve(48,b,47,c)].
3.62/7.66	49 -nota(noc,thm) # label(nota_noc_thm) # label(negated_conjecture).  [assumption].
3.62/7.66	Derived: -status(A,B,noc) | status(A,B,thm).  [resolve(49,a,47,c)].
3.62/7.66	
3.62/7.66	============================== end predicate elimination =============
3.62/7.66	
3.62/7.66	Auto_denials:  (non-Horn, no changes).
3.62/7.66	
3.62/7.66	Term ordering decisions:
3.62/7.66	
3.62/7.66	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
3.62/7.66	Function symbol KB weights:  noc=1. eqv=1. eth=1. wec=1. wth=1. esa=1. thm=1. csa=1. sap=1. sat=1. tac=1. tau=1. unp=1. uns=1. wtc=1. sca=1. tca=1. wca=1. cax=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. f46=1. f47=1. f48=1. f49=1. f50=1. f51=1. not=0.
3.62/7.66	
3.62/7.66	============================== end of process initial clauses ========
3.62/7.66	
3.62/7.66	============================== CLAUSES FOR SEARCH ====================
3.62/7.66	
3.62/7.66	============================== end of clauses for search =============
3.62/7.66	
3.62/7.66	============================== SEARCH ================================
3.62/7.66	
3.62/7.66	% Starting search at 0.04 seconds.
3.62/7.66	
3.62/7.66	Low Water (keep): wt=30.000, iters=3413
3.62/7.66	
3.62/7.66	Low Water (keep): wt=24.000, iters=3400
3.62/7.66	
3.62/7.66	Low Water (keep): wt=20.000, iters=3335
3.62/7.66	
3.62/7.66	Low Water (keep): wt=18.000, iters=3347
3.62/7.66	
3.62/7.66	Low Water (keep): wt=17.000, iters=3340
3.62/7.66	
3.62/7.66	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 68 (0.00 of 1.15 sec).
3.62/7.66	
3.62/7.66	Low Water (keep): wt=16.000, iters=3337
3.62/7.66	
3.62/7.66	Low Water (keep): wt=15.000, iters=3343
3.62/7.66	
3.62/7.66	Low Water (keep): wt=14.000, iters=3336
3.62/7.66	
3.62/7.66	Low Water (keep): wt=13.000, iters=3423
3.62/7.66	
3.62/7.66	Low Water (displace): id=564, wt=38.000
3.62/7.66	
3.62/7.66	Low Water (displace): id=10950, wt=10.000
3.62/7.66	
3.62/7.66	Low Water (displace): id=10951, wt=9.000
3.62/7.66	
3.62/7.66	Low Water (displace): id=12466, wt=6.000
3.62/7.66	
3.62/7.66	Low Water (keep): wt=12.000, iters=3333
4.41/8.44	
4.41/8.44	Low Water (keep): wt=11.000, iters=4484
4.41/8.44	
4.41/8.44	Low Water (keep): wt=10.000, iters=3442
4.41/8.44	
4.41/8.44	============================== PROOF =================================
4.41/8.44	% SZS status Theorem
4.41/8.44	% SZS output start Refutation
4.41/8.44	
4.41/8.44	% Proof 1 at 3.45 (+ 0.18) seconds.
4.41/8.44	% Length of proof is 63.
4.41/8.44	% Level of proof is 15.
4.41/8.44	% Maximum clause weight is 18.000.
4.41/8.44	% Given clauses 1955.
4.41/8.44	
4.41/8.44	1 (all Ax all C ((exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	4 (all Ax all C (status(Ax,C,sca) <-> (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	6 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	12 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	16 (all Ax all C (((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))) <-> status(Ax,C,sap))) # label(sap) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	17 (all Ax all C (status(Ax,C,esa) <-> ((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	21 (exists I1 exists Ax exists C (model(I1,Ax) & (exists I2 model(I2,C)) & -model(I1,C))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	30 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
4.41/8.44	47 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom).  [clausify(28)].
4.41/8.44	49 -nota(noc,thm) # label(nota_noc_thm) # label(negated_conjecture).  [assumption].
4.41/8.44	51 model(A,B) | -model(A,C) | -model(D,B) | -model(f1(B,C),C) | status(B,C,wec) # label(wec) # label(axiom).  [clausify(1)].
4.41/8.44	52 -model(f2(A,B),A) | -status(A,B,wec) # label(wec) # label(axiom).  [clausify(1)].
4.41/8.44	64 -status(A,B,sca) | -model(C,A) # label(sca) # label(axiom).  [clausify(4)].
4.41/8.44	65 status(A,B,sca) | -model(C,B) | model(f10(A,B),A) # label(sca) # label(axiom).  [clausify(4)].
4.41/8.44	71 -status(A,B,thm) | -model(C,A) | model(C,B) # label(thm) # label(axiom).  [clausify(6)].
4.41/8.44	72 status(A,B,thm) | model(f13(A,B),A) # label(thm) # label(axiom).  [clausify(6)].
4.41/8.44	96 -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | status(B,C,noc) # label(noc) # label(axiom).  [clausify(12)].
4.41/8.44	111 -model(A,B) | status(C,B,sap) # label(sap) # label(axiom).  [clausify(16)].
4.41/8.44	112 -model(A,B) | model(f35(B,C),C) | -status(B,C,sap) # label(sap) # label(axiom).  [clausify(16)].
4.41/8.44	113 -status(A,B,esa) | -model(C,A) | model(f36(A,B),B) # label(esa) # label(axiom).  [clausify(17)].
4.41/8.44	116 status(A,B,esa) | -model(C,A) | -model(D,B) # label(esa) # label(axiom).  [clausify(17)].
4.41/8.44	123 -model(A,c1) # label(contradiction) # label(axiom).  [clausify(20)].
4.41/8.44	124 model(c2,c3) # label(non_thm_spt) # label(axiom).  [clausify(21)].
4.41/8.44	125 model(c5,c4) # label(non_thm_spt) # label(axiom).  [clausify(21)].
4.41/8.44	126 -model(c2,c4) # label(non_thm_spt) # label(axiom).  [clausify(21)].
4.41/8.44	129 model(A,c9) # label(tautology) # label(axiom).  [clausify(27)].
4.41/8.44	135 model(A,B) | model(A,not(B)) # label(completeness) # label(axiom).  [clausify(30)].
4.41/8.44	136 -model(A,B) | -model(A,not(B)) # label(completeness) # label(axiom).  [clausify(30)].
4.41/8.44	152 -status(A,B,noc) | status(A,B,thm).  [resolve(49,a,47,c)].
4.41/8.44	173 model(f13(A,B),A) | -model(C,A) | model(C,B).  [resolve(72,a,71,a)].
4.41/8.44	187 -model(c2,A) | -model(B,A) | -model(B,not(c3)) | status(A,c3,noc).  [resolve(124,a,96,b)].
4.41/8.44	195 status(A,c3,sca) | model(f10(A,c3),A).  [resolve(124,a,65,b)].
4.41/8.44	199 model(c2,A) | -model(B,A) | -model(f1(A,c3),c3) | status(A,c3,wec).  [resolve(124,a,51,b)].
4.41/8.44	212 status(A,c4,esa) | -model(B,A).  [resolve(125,a,116,c)].
4.41/8.44	214 status(A,c4,sap).  [resolve(125,a,111,a)].
4.41/8.44	282 -model(A,B) | -model(C,not(B)) | status(c9,B,noc).  [resolve(129,a,96,c),unit_del(a,129)].
4.41/8.44	646 model(f13(not(A),B),not(A)) | model(C,B) | model(C,A).  [resolve(173,b,135,b)].
4.41/8.44	652 model(f13(not(A),A),not(A)) | model(B,A).  [factor(646,b,c)].
4.41/8.44	722 -model(A,B) | model(f35(B,c4),c4).  [resolve(214,a,112,c)].
4.41/8.44	1566 -model(A,not(c3)) | status(c9,c3,noc).  [resolve(187,a,129,a),unit_del(a,129)].
4.41/8.44	2223 status(c9,c4,esa).  [resolve(212,b,129,a)].
4.41/8.44	2242 model(f10(A,c3),A) | -model(B,A).  [resolve(195,a,64,a)].
4.41/8.44	2352 model(f36(c9,c4),c4).  [resolve(2223,a,113,a),unit_del(a,129)].
4.41/8.44	2549 -model(f1(c4,c3),c3) | status(c4,c3,wec).  [resolve(199,b,2352,a),unit_del(a,126)].
4.41/8.44	14843 status(c9,c3,noc) | model(A,c3).  [resolve(1566,a,135,b)].
4.41/8.44	14846 model(A,c3) | status(c9,c3,thm).  [resolve(14843,a,152,a)].
4.41/8.44	14859 model(A,c3) | model(B,c3).  [resolve(14846,b,71,a),unit_del(b,129)].
4.41/8.44	14860 model(A,c3).  [factor(14859,a,b)].
4.41/8.44	15005 status(c4,c3,wec).  [back_unit_del(2549),unit_del(a,14860)].
4.41/8.44	15106 -model(f2(c4,c3),c4).  [resolve(15005,a,52,b)].
4.41/8.44	15661 model(f13(not(c4),c4),not(c4)).  [resolve(652,b,15106,a)].
4.41/8.44	15718 model(f13(not(c1),c1),not(c1)).  [resolve(652,b,123,a)].
4.41/8.44	15755 model(f10(not(c4),c3),not(c4)).  [resolve(15661,a,2242,b)].
4.41/8.44	15781 -model(A,c4) | status(c9,c4,noc).  [resolve(15661,a,282,b)].
4.41/8.44	16904 model(f35(not(c1),c4),c4).  [resolve(15718,a,722,a)].
4.41/8.44	17217 -model(f10(not(c4),c3),c4).  [resolve(15755,a,136,b)].
4.41/8.44	17221 status(c9,c4,noc).  [resolve(15781,a,16904,a)].
4.41/8.44	17232 status(c9,c4,thm).  [resolve(17221,a,152,a)].
4.41/8.44	17236 model(A,c4).  [resolve(17232,a,71,a),unit_del(a,129)].
4.41/8.44	17237 $F.  [resolve(17236,a,17217,a)].
4.41/8.44	
4.41/8.44	% SZS output end Refutation
4.41/8.44	============================== end of proof ==========================
4.41/8.44	
4.41/8.44	============================== STATISTICS ============================
4.41/8.44	
4.41/8.44	Given=1955. Generated=193840. Kept=17187. proofs=1.
4.41/8.44	Usable=1941. Sos=9998. Demods=0. Limbo=0, Disabled=5369. Hints=0.
4.41/8.44	Megabytes=16.86.
4.41/8.44	User_CPU=3.45, System_CPU=0.18, Wall_clock=4.
4.41/8.44	
4.41/8.44	============================== end of statistics =====================
4.41/8.44	
4.41/8.44	============================== end of search =========================
4.41/8.44	
4.41/8.44	THEOREM PROVED
4.41/8.44	% SZS status Theorem
4.41/8.44	
4.41/8.44	Exiting with 1 proof.
4.41/8.44	
4.41/8.44	Process 20210 exit (max_proofs) Thu Jul  2 07:05:14 2020
4.41/8.44	Prover9 interrupted
4.41/8.44	EOF