0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n026.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.12/0.34	% CPULimit   : 960
0.12/0.34	% DateTime   : Thu Jul  2 06:45:54 EDT 2020
0.12/0.34	% CPUTime    : 
0.44/1.09	============================== Prover9 ===============================
0.44/1.09	Prover9 (32) version 2009-11A, November 2009.
0.44/1.09	Process 17077 was started by sandbox2 on n026.cluster.edu,
0.44/1.09	Thu Jul  2 06:45:55 2020
0.44/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_16924_n026.cluster.edu".
0.44/1.09	============================== end of head ===========================
0.44/1.09	
0.44/1.09	============================== INPUT =================================
0.44/1.09	
0.44/1.09	% Reading from file /tmp/Prover9_16924_n026.cluster.edu
0.44/1.09	
0.44/1.09	set(prolog_style_variables).
0.44/1.09	set(auto2).
0.44/1.09	    % set(auto2) -> set(auto).
0.44/1.09	    % set(auto) -> set(auto_inference).
0.44/1.09	    % set(auto) -> set(auto_setup).
0.44/1.09	    % set(auto_setup) -> set(predicate_elim).
0.44/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.09	    % set(auto) -> set(auto_limits).
0.44/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.09	    % set(auto) -> set(auto_denials).
0.44/1.09	    % set(auto) -> set(auto_process).
0.44/1.09	    % set(auto2) -> assign(new_constants, 1).
0.44/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.09	    % set(auto2) -> assign(max_hours, 1).
0.44/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.09	    % set(auto2) -> set(sort_initial_sos).
0.44/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.09	    % set(auto2) -> assign(max_megs, 400).
0.44/1.09	    % set(auto2) -> assign(stats, some).
0.44/1.09	    % set(auto2) -> clear(echo_input).
0.44/1.09	    % set(auto2) -> set(quiet).
0.44/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.09	    % set(auto2) -> clear(print_given).
0.44/1.09	assign(lrs_ticks,-1).
0.44/1.09	assign(sos_limit,10000).
0.44/1.09	assign(order,kbo).
0.44/1.09	set(lex_order_vars).
0.44/1.09	clear(print_given).
0.44/1.09	
0.44/1.09	% formulas(sos).  % not echoed (33 formulas)
0.44/1.09	
0.44/1.09	============================== end of input ==========================
0.44/1.09	
0.44/1.09	% From the command line: assign(max_seconds, 960).
0.44/1.09	
0.44/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.09	
0.44/1.09	% Formulas that are not ordinary clauses:
0.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	8 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.44/1.09	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.44/1.09	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.44/1.09	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.44/1.09	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.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.44/1.10	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.44/1.10	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.44/1.10	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.44/1.10	24 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.44/1.10	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.44/1.10	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.44/1.10	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.44/1.10	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.44/1.10	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.44/1.10	30 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.44/1.10	31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.44/1.10	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.44/1.10	
0.44/1.10	============================== end of process non-clausal formulas ===
0.44/1.10	
0.44/1.10	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.10	
0.44/1.10	============================== PREDICATE ELIMINATION =================
0.44/1.10	33 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(22)].
0.44/1.10	34 status(f42(A,B),f43(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.44/1.10	35 -status(f42(A,B),f43(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.44/1.10	Derived: -status(A,B,C) | status(A,B,D) | status(f42(C,D),f43(C,D),C).  [resolve(33,c,34,b)].
0.44/1.10	Derived: -status(A,B,C) | status(A,B,D) | -status(f42(C,D),f43(C,D),D).  [resolve(33,c,35,b)].
0.44/1.10	36 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom).  [clausify(23)].
0.44/1.10	37 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(23)].
0.44/1.10	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,37,a)].
1.66/2.04	38 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom).  [clausify(23)].
1.66/2.04	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,a,37,a)].
1.66/2.04	39 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
1.66/2.04	40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(25)].
1.66/2.04	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(39,b,40,c)].
1.66/2.04	41 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
1.66/2.04	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(41,b,40,c)].
1.66/2.04	42 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
1.66/2.04	Derived: -status(A,B,sca) | -status(A,B,thm).  [resolve(42,a,40,c)].
1.66/2.04	43 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
1.66/2.04	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)].
1.66/2.04	45 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)].
1.66/2.04	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(43,c,44,c)].
1.66/2.04	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(43,c,45,c)].
1.66/2.04	46 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
1.66/2.04	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(46,c,44,c)].
1.66/2.04	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(46,c,45,c)].
1.66/2.04	47 status(f50(A,B),f51(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
1.66/2.04	48 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom).  [clausify(28)].
1.66/2.04	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | status(C,D,B).  [resolve(47,b,48,c)].
1.66/2.04	49 -status(f50(A,B),f51(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
1.66/2.04	Derived: -status(f50(A,B),f51(A,B),B) | -status(C,D,A) | status(C,D,B).  [resolve(49,b,48,c)].
1.66/2.04	
1.66/2.04	============================== end predicate elimination =============
1.66/2.04	
1.66/2.04	Auto_denials:  (non-Horn, no changes).
1.66/2.04	
1.66/2.04	Term ordering decisions:
1.66/2.04	
1.66/2.04	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
1.66/2.04	Function symbol KB weights:  eqv=1. eth=1. noc=1. wec=1. wth=1. esa=1. csa=1. sap=1. sat=1. tac=1. tau=1. thm=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.
1.66/2.04	
1.66/2.04	============================== end of process initial clauses ========
1.66/2.04	
1.66/2.04	============================== CLAUSES FOR SEARCH ====================
1.66/2.04	
1.66/2.04	============================== end of clauses for search =============
1.66/2.04	
1.66/2.04	============================== SEARCH ================================
1.66/2.04	
1.66/2.04	% Starting search at 0.04 seconds.
1.66/2.04	
1.66/2.04	Low Water (keep): wt=30.000, iters=3414
1.66/2.04	
1.66/2.04	Low Water (keep): wt=24.000, iters=3401
1.66/2.04	
1.66/2.04	Low Water (keep): wt=20.000, iters=3336
1.66/2.04	
1.66/2.04	Low Water (keep): wt=18.000, iters=3334
1.66/2.04	
1.66/2.04	Low Water (keep): wt=17.000, iters=3342
1.66/2.04	
1.66/2.04	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 68 (0.00 of 0.89 sec).
1.66/2.04	
1.66/2.04	============================== PROOF =================================
1.66/2.04	% SZS status Theorem
1.66/2.04	% SZS output start Refutation
1.66/2.04	
1.66/2.04	% Proof 1 at 0.95 (+ 0.01) seconds.
1.66/2.04	% Length of proof is 16.
1.66/2.04	% Level of proof is 4.
1.66/2.04	% Maximum clause weight is 12.000.
1.66/2.04	% Given clauses 544.
1.66/2.04	
1.66/2.04	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].
1.66/2.05	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].
1.66/2.05	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
1.66/2.05	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].
1.66/2.05	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
1.66/2.05	40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(25)].
1.66/2.05	42 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
1.66/2.05	65 status(A,B,sca) | -model(C,B) | model(f10(A,B),A) # label(sca) # label(axiom).  [clausify(4)].
1.66/2.05	73 status(A,B,thm) | -model(f13(A,B),B) # label(thm) # label(axiom).  [clausify(6)].
1.66/2.05	123 -model(A,c1) # label(contradiction) # label(axiom).  [clausify(20)].
1.66/2.05	129 model(A,c9) # label(tautology) # label(axiom).  [clausify(27)].
1.66/2.05	146 -status(A,B,sca) | -status(A,B,thm).  [resolve(42,a,40,c)].
1.66/2.05	285 status(A,c9,thm).  [resolve(129,a,73,b)].
1.66/2.05	286 status(A,c9,sca) | model(f10(A,c9),A).  [resolve(129,a,65,b)].
1.66/2.05	7863 model(f10(A,c9),A).  [resolve(286,a,146,a),unit_del(b,285)].
1.66/2.05	7864 $F.  [resolve(7863,a,123,a)].
1.66/2.05	
1.66/2.05	% SZS output end Refutation
1.66/2.05	============================== end of proof ==========================
1.66/2.05	
1.66/2.05	============================== STATISTICS ============================
1.66/2.05	
1.66/2.05	Given=544. Generated=20545. Kept=7814. proofs=1.
1.66/2.05	Usable=544. Sos=7163. Demods=0. Limbo=2, Disabled=226. Hints=0.
1.66/2.05	Megabytes=10.53.
1.66/2.05	User_CPU=0.96, System_CPU=0.01, Wall_clock=1.
1.66/2.05	
1.66/2.05	============================== end of statistics =====================
1.66/2.05	
1.66/2.05	============================== end of search =========================
1.66/2.05	
1.66/2.05	THEOREM PROVED
1.66/2.05	% SZS status Theorem
1.66/2.05	
1.66/2.05	Exiting with 1 proof.
1.66/2.05	
1.66/2.05	Process 17077 exit (max_proofs) Thu Jul  2 06:45:56 2020
1.66/2.05	Prover9 interrupted
1.66/2.05	EOF