0.04/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer   : n014.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1200
0.09/0.30	% DateTime   : Tue Jul 13 11:54:49 EDT 2021
0.09/0.30	% CPUTime    : 
0.72/1.00	============================== Prover9 ===============================
0.72/1.00	Prover9 (32) version 2009-11A, November 2009.
0.72/1.00	Process 28468 was started by sandbox on n014.cluster.edu,
0.72/1.00	Tue Jul 13 11:54:50 2021
0.72/1.00	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_28314_n014.cluster.edu".
0.72/1.00	============================== end of head ===========================
0.72/1.00	
0.72/1.00	============================== INPUT =================================
0.72/1.00	
0.72/1.00	% Reading from file /tmp/Prover9_28314_n014.cluster.edu
0.72/1.00	
0.72/1.00	set(prolog_style_variables).
0.72/1.00	set(auto2).
0.72/1.00	    % set(auto2) -> set(auto).
0.72/1.00	    % set(auto) -> set(auto_inference).
0.72/1.00	    % set(auto) -> set(auto_setup).
0.72/1.00	    % set(auto_setup) -> set(predicate_elim).
0.72/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/1.00	    % set(auto) -> set(auto_limits).
0.72/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/1.00	    % set(auto) -> set(auto_denials).
0.72/1.00	    % set(auto) -> set(auto_process).
0.72/1.00	    % set(auto2) -> assign(new_constants, 1).
0.72/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.72/1.00	    % set(auto2) -> assign(max_hours, 1).
0.72/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.72/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.72/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/1.00	    % set(auto2) -> set(sort_initial_sos).
0.72/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.72/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/1.00	    % set(auto2) -> assign(max_megs, 400).
0.72/1.00	    % set(auto2) -> assign(stats, some).
0.72/1.00	    % set(auto2) -> clear(echo_input).
0.72/1.00	    % set(auto2) -> set(quiet).
0.72/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.72/1.00	    % set(auto2) -> clear(print_given).
0.72/1.00	assign(lrs_ticks,-1).
0.72/1.00	assign(sos_limit,10000).
0.72/1.00	assign(order,kbo).
0.72/1.00	set(lex_order_vars).
0.72/1.00	clear(print_given).
0.72/1.00	
0.72/1.00	% formulas(sos).  % not echoed (33 formulas)
0.72/1.00	
0.72/1.00	============================== end of input ==========================
0.72/1.00	
0.72/1.00	% From the command line: assign(max_seconds, 1200).
0.72/1.00	
0.72/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/1.00	
0.72/1.00	% Formulas that are not ordinary clauses:
0.72/1.00	1 (all Ax all C (status(Ax,C,unp) <-> (-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))))) # label(unp) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	2 (all Ax all C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	3 (all Ax all C ((all I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,tca))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	4 (all Ax all C (status(Ax,C,eqv) <-> (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	5 (all Ax all C (status(Ax,C,eth) <-> (exists I1 model(I1,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I2 -model(I2,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	6 (all Ax all C (status(Ax,C,tau) <-> (all I1 (model(I1,C) & model(I1,Ax))))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	7 (all Ax all C (status(Ax,C,wca) <-> (exists I2 model(I2,C)) & (exists I3 -model(I3,C)) & -(exists I1 model(I1,Ax)))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	8 (all Ax all C (status(Ax,C,noc) <-> (exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	9 (all Ax all C (status(Ax,C,tac) <-> (all I2 model(I2,C)) & (exists I1 model(I1,Ax)))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	10 (all Ax all C ((exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	11 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	12 (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.72/1.00	13 (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.72/1.00	14 (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.72/1.00	15 (all Ax all C (((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	16 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,not(C)))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	17 (all Ax all C (status(Ax,C,sat) <-> (exists I1 (model(I1,Ax) & model(I1,C))))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	18 (all Ax all C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	19 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	21 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	22 (all S1 all S2 ((exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	24 (exists Ax exists C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (-model(I2,Ax) | -model(I2,C))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	25 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	26 (exists Ax exists C ((exists I4 -model(I4,C)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	27 (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.72/1.00	28 (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.72/1.00	29 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))) <-> nevera(S1,S2))) # label(nevera) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	30 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	31 (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.72/1.00	32 (exists I1 exists Ax exists C ((exists I2 model(I2,C)) & -model(I1,C) & model(I1,Ax))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	
0.72/1.00	============================== end of process non-clausal formulas ===
0.72/1.00	
0.72/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.72/1.00	
0.72/1.00	============================== PREDICATE ELIMINATION =================
0.72/1.00	33 -status(f42(A,B),f43(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(22)].
0.72/1.00	34 status(A,B,C) | -status(A,B,D) | nota(D,C) # label(nota) # label(axiom).  [clausify(22)].
0.72/1.00	Derived: -status(f42(A,B),f43(A,B),B) | status(C,D,B) | -status(C,D,A).  [resolve(33,b,34,c)].
0.72/1.00	35 status(f42(A,B),f43(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(22)].
0.72/1.00	Derived: status(f42(A,B),f43(A,B),A) | status(C,D,B) | -status(C,D,A).  [resolve(35,b,34,c)].
0.72/1.00	36 status(f44(A,B),f45(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(27)].
0.72/1.00	37 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(27)].
0.72/1.00	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,b,37,c)].
0.72/1.25	38 status(f44(A,B),f45(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(27)].
0.72/1.25	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,b,37,c)].
0.72/1.25	39 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
0.72/1.25	Derived: -status(A,B,sca) | -status(A,B,thm).  [resolve(39,a,37,c)].
0.72/1.25	40 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(28)].
0.72/1.25	41 status(f46(A,B),f47(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
0.72/1.25	42 -status(f46(A,B),f47(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
0.72/1.25	Derived: -status(A,B,C) | status(A,B,D) | status(f46(C,D),f47(C,D),C).  [resolve(40,c,41,b)].
0.72/1.25	Derived: -status(A,B,C) | status(A,B,D) | -status(f46(C,D),f47(C,D),D).  [resolve(40,c,42,b)].
0.72/1.25	43 -status(A,B,C) | -status(A,B,D) | -nevera(C,D) # label(nevera) # label(axiom).  [clausify(29)].
0.72/1.25	44 status(f48(A,B),f49(A,B),A) | nevera(A,B) # label(nevera) # label(axiom).  [clausify(29)].
0.72/1.25	45 status(f48(A,B),f49(A,B),B) | nevera(A,B) # label(nevera) # label(axiom).  [clausify(29)].
0.72/1.25	Derived: -status(A,B,C) | -status(A,B,D) | status(f48(C,D),f49(C,D),C).  [resolve(43,c,44,b)].
0.72/1.25	Derived: -status(A,B,C) | -status(A,B,D) | status(f48(C,D),f49(C,D),D).  [resolve(43,c,45,b)].
0.72/1.25	46 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(31)].
0.72/1.25	47 -status(f50(A,B),f51(A,B),B) | status(f50(A,B),f51(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(31)].
0.72/1.25	48 status(f50(A,B),f51(A,B),B) | -status(f50(A,B),f51(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(31)].
0.72/1.25	Derived: status(A,B,C) | status(A,B,D) | -status(f50(D,C),f51(D,C),C) | status(f50(D,C),f51(D,C),D).  [resolve(46,c,47,c)].
0.72/1.25	Derived: status(A,B,C) | status(A,B,D) | status(f50(D,C),f51(D,C),C) | -status(f50(D,C),f51(D,C),D).  [resolve(46,c,48,c)].
0.72/1.25	49 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(31)].
0.72/1.25	Derived: -status(A,B,C) | -status(A,B,D) | -status(f50(D,C),f51(D,C),C) | status(f50(D,C),f51(D,C),D).  [resolve(49,c,47,c)].
0.72/1.25	Derived: -status(A,B,C) | -status(A,B,D) | status(f50(D,C),f51(D,C),C) | -status(f50(D,C),f51(D,C),D).  [resolve(49,c,48,c)].
0.72/1.25	
0.72/1.25	============================== end predicate elimination =============
0.72/1.25	
0.72/1.25	Auto_denials:  (non-Horn, no changes).
0.72/1.25	
0.72/1.25	Term ordering decisions:
0.72/1.25	
0.72/1.25	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
0.72/1.25	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.
0.72/1.25	
0.72/1.25	============================== end of process initial clauses ========
0.72/1.25	
0.72/1.25	============================== CLAUSES FOR SEARCH ====================
0.72/1.25	
0.72/1.25	============================== end of clauses for search =============
0.72/1.25	
0.72/1.25	============================== SEARCH ================================
0.72/1.25	
0.72/1.25	% Starting search at 0.03 seconds.
0.72/1.25	
0.72/1.25	============================== PROOF =================================
0.72/1.25	% SZS status Theorem
0.72/1.25	% SZS output start Refutation
0.72/1.25	
0.72/1.25	% Proof 1 at 0.25 (+ 0.00) seconds.
0.72/1.25	% Length of proof is 16.
0.72/1.25	% Level of proof is 4.
0.72/1.25	% Maximum clause weight is 12.000.
0.72/1.25	% Given clauses 174.
0.72/1.25	
0.72/1.25	13 (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.72/1.25	19 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
0.72/1.25	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.72/1.25	21 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.72/1.25	27 (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.72/1.25	37 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(27)].
0.72/1.25	39 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
0.72/1.25	99 status(A,B,sca) | -model(C,B) | model(f28(A,B),A) # label(sca) # label(axiom).  [clausify(13)].
0.72/1.25	121 -model(f41(A,B),B) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(19)].
0.72/1.25	123 -model(A,c1) # label(contradiction) # label(axiom).  [clausify(20)].
0.72/1.25	124 model(A,c2) # label(tautology) # label(axiom).  [clausify(21)].
0.72/1.25	144 -status(A,B,sca) | -status(A,B,thm).  [resolve(39,a,37,c)].
0.72/1.25	178 status(A,c2,thm).  [resolve(124,a,121,a)].
0.72/1.25	185 status(A,c2,sca) | model(f28(A,c2),A).  [resolve(124,a,99,b)].
0.72/1.25	1500 model(f28(A,c2),A).  [resolve(185,a,144,a),unit_del(b,178)].
0.72/1.25	1501 $F.  [resolve(1500,a,123,a)].
0.72/1.25	
0.72/1.25	% SZS output end Refutation
0.72/1.25	============================== end of proof ==========================
0.72/1.25	
0.72/1.25	============================== STATISTICS ============================
0.72/1.25	
0.72/1.25	Given=174. Generated=1909. Kept=1451. proofs=1.
0.72/1.25	Usable=174. Sos=1243. Demods=0. Limbo=12, Disabled=143. Hints=0.
0.72/1.25	Megabytes=2.47.
0.72/1.25	User_CPU=0.25, System_CPU=0.00, Wall_clock=0.
0.72/1.25	
0.72/1.25	============================== end of statistics =====================
0.72/1.25	
0.72/1.25	============================== end of search =========================
0.72/1.25	
0.72/1.25	THEOREM PROVED
0.72/1.25	% SZS status Theorem
0.72/1.25	
0.72/1.25	Exiting with 1 proof.
0.72/1.25	
0.72/1.25	Process 28468 exit (max_proofs) Tue Jul 13 11:54:50 2021
0.72/1.25	Prover9 interrupted
0.72/1.25	EOF