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