0.00/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.11/0.33	% Computer : n004.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit : 960
0.11/0.33	% WCLimit  : 120
0.11/0.33	% DateTime : Tue Aug  9 02:36:20 EDT 2022
0.11/0.33	% CPUTime  : 
0.43/1.00	============================== Prover9 ===============================
0.43/1.00	Prover9 (32) version 2009-11A, November 2009.
0.43/1.00	Process 18885 was started by sandbox2 on n004.cluster.edu,
0.43/1.00	Tue Aug  9 02:36:21 2022
0.43/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_18730_n004.cluster.edu".
0.43/1.00	============================== end of head ===========================
0.43/1.00	
0.43/1.00	============================== INPUT =================================
0.43/1.00	
0.43/1.00	% Reading from file /tmp/Prover9_18730_n004.cluster.edu
0.43/1.00	
0.43/1.00	set(prolog_style_variables).
0.43/1.00	set(auto2).
0.43/1.00	    % set(auto2) -> set(auto).
0.43/1.00	    % set(auto) -> set(auto_inference).
0.43/1.00	    % set(auto) -> set(auto_setup).
0.43/1.00	    % set(auto_setup) -> set(predicate_elim).
0.43/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.00	    % set(auto) -> set(auto_limits).
0.43/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.00	    % set(auto) -> set(auto_denials).
0.43/1.00	    % set(auto) -> set(auto_process).
0.43/1.00	    % set(auto2) -> assign(new_constants, 1).
0.43/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.00	    % set(auto2) -> assign(max_hours, 1).
0.43/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.00	    % set(auto2) -> set(sort_initial_sos).
0.43/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.00	    % set(auto2) -> assign(max_megs, 400).
0.43/1.00	    % set(auto2) -> assign(stats, some).
0.43/1.00	    % set(auto2) -> clear(echo_input).
0.43/1.00	    % set(auto2) -> set(quiet).
0.43/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.00	    % set(auto2) -> clear(print_given).
0.43/1.00	assign(lrs_ticks,-1).
0.43/1.00	assign(sos_limit,10000).
0.43/1.00	assign(order,kbo).
0.43/1.00	set(lex_order_vars).
0.43/1.00	clear(print_given).
0.43/1.00	
0.43/1.00	% formulas(sos).  % not echoed (33 formulas)
0.43/1.00	
0.43/1.00	============================== end of input ==========================
0.43/1.00	
0.43/1.00	% From the command line: assign(max_seconds, 960).
0.43/1.00	
0.43/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.01	
0.43/1.01	% Formulas that are not ordinary clauses:
0.43/1.01	1 (all Ax all C (((exists I2 model(I2,C)) <-> (exists I1 model(I1,Ax))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	2 (all Ax all C (-(exists I1 model(I1,Ax)) & (all I2 model(I2,C)) <-> status(Ax,C,tca))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	3 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	4 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	5 (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.43/1.01	6 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	7 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (exists I4 -model(I4,C)) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	8 (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.43/1.01	9 (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.43/1.01	10 (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.43/1.01	11 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 (model(I3,C) <-> model(I3,Ax))) <-> status(Ax,C,eth))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.43/1.01	12 (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.74/1.01	13 (all Ax all C ((exists I2 (model(I2,Ax) & model(I2,not(C)))) & (exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	14 (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.01	15 (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.74/1.01	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.74/1.01	17 (all Ax all C (status(Ax,C,sat) <-> (exists I1 (model(I1,C) & model(I1,Ax))))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	18 (all Ax all C (status(Ax,C,tac) <-> (exists I1 model(I1,Ax)) & (all I2 model(I2,C)))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	19 (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.74/1.01	20 (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.01	21 (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.74/1.01	22 (exists Ax exists C ((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(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	24 (all S1 all S2 (xora(S1,S2) <-> (all Ax all C -(status(Ax,C,S1) <-> status(Ax,C,S2))))) # label(xora) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	25 (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.01	26 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	27 (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.01	28 (all S1 all S2 (nota(S1,S2) <-> (exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	29 (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.74/1.01	30 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	31 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	32 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.74/1.01	
0.74/1.01	============================== end of process non-clausal formulas ===
0.74/1.01	
0.74/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.74/1.01	
0.74/1.01	============================== PREDICATE ELIMINATION =================
0.74/1.01	33 xora(A,B) | -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) # label(xora) # label(axiom).  [clausify(24)].
0.74/1.01	34 -xora(A,B) | status(C,D,A) | status(C,D,B) # label(xora) # label(axiom).  [clausify(24)].
0.74/1.01	35 -xora(A,B) | -status(C,D,A) | -status(C,D,B) # label(xora) # label(axiom).  [clausify(24)].
0.74/1.01	Derived: -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) | status(C,D,A) | status(C,D,B).  [resolve(33,a,34,a)].
0.74/1.01	Derived: -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(33,a,35,a)].
0.74/1.01	36 xora(A,B) | status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) # label(xora) # label(axiom).  [clausify(24)].
0.74/1.01	Derived: status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) | status(C,D,A) | status(C,D,B).  [resolve(36,a,34,a)].
2.05/2.38	Derived: status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,35,a)].
2.05/2.38	37 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(25)].
2.05/2.38	38 status(f44(A,B),f45(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(25)].
2.05/2.38	39 -status(f44(A,B),f45(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(25)].
2.05/2.38	Derived: -status(A,B,C) | status(A,B,D) | status(f44(C,D),f45(C,D),C).  [resolve(37,c,38,b)].
2.05/2.38	Derived: -status(A,B,C) | status(A,B,D) | -status(f44(C,D),f45(C,D),D).  [resolve(37,c,39,b)].
2.05/2.38	40 nevera(A,B) | status(f46(A,B),f47(A,B),A) # label(nevera) # label(axiom).  [clausify(27)].
2.05/2.38	41 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(27)].
2.05/2.38	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(40,a,41,a)].
2.05/2.38	42 nevera(A,B) | status(f46(A,B),f47(A,B),B) # label(nevera) # label(axiom).  [clausify(27)].
2.05/2.38	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(42,a,41,a)].
2.05/2.38	43 -nevera(noc,thm) # label(nevera_noc_thm) # label(negated_conjecture).  [assumption].
2.05/2.38	Derived: status(f46(noc,thm),f47(noc,thm),noc).  [resolve(43,a,40,a)].
2.05/2.38	Derived: status(f46(noc,thm),f47(noc,thm),thm).  [resolve(43,a,42,a)].
2.05/2.38	44 nota(A,B) | status(C,D,B) | -status(C,D,A) # label(nota) # label(axiom).  [clausify(28)].
2.05/2.38	45 -nota(A,B) | -status(f48(A,B),f49(A,B),B) # label(nota) # label(axiom).  [clausify(28)].
2.05/2.38	46 -nota(A,B) | status(f48(A,B),f49(A,B),A) # label(nota) # label(axiom).  [clausify(28)].
2.05/2.38	Derived: status(A,B,C) | -status(A,B,D) | -status(f48(D,C),f49(D,C),C).  [resolve(44,a,45,a)].
2.05/2.38	Derived: status(A,B,C) | -status(A,B,D) | status(f48(D,C),f49(D,C),D).  [resolve(44,a,46,a)].
2.05/2.38	47 status(f50(A,B),f51(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(29)].
2.05/2.38	48 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(29)].
2.05/2.38	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(47,b,48,c)].
2.05/2.38	49 status(f50(A,B),f51(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(29)].
2.05/2.38	Derived: status(f50(A,B),f51(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(49,b,48,c)].
2.05/2.38	
2.05/2.38	============================== end predicate elimination =============
2.05/2.38	
2.05/2.38	Auto_denials:  (non-Horn, no changes).
2.05/2.38	
2.05/2.38	Term ordering decisions:
2.05/2.38	
2.05/2.38	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
2.05/2.38	Function symbol KB weights:  noc=1. thm=1. eqv=1. eth=1. wec=1. wth=1. esa=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.
2.05/2.38	
2.05/2.38	============================== end of process initial clauses ========
2.05/2.38	
2.05/2.38	============================== CLAUSES FOR SEARCH ====================
2.05/2.38	
2.05/2.38	============================== end of clauses for search =============
2.05/2.38	
2.05/2.38	============================== SEARCH ================================
2.05/2.38	
2.05/2.38	% Starting search at 0.02 seconds.
2.05/2.38	
2.05/2.38	Low Water (keep): wt=30.000, iters=3388
2.05/2.38	
2.05/2.38	Low Water (keep): wt=24.000, iters=3346
2.05/2.38	
2.05/2.38	Low Water (keep): wt=20.000, iters=3346
2.05/2.38	
2.05/2.38	Low Water (keep): wt=18.000, iters=3341
2.05/2.38	
2.05/2.38	Low Water (keep): wt=17.000, iters=3340
2.05/2.38	
2.05/2.38	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 40 (0.00 of 0.70 sec).
2.05/2.38	
2.05/2.38	Low Water (keep): wt=16.000, iters=3343
2.05/2.38	
2.05/2.38	Low Water (keep): wt=15.000, iters=3405
2.05/2.38	
2.05/2.38	Low Water (keep): wt=14.000, iters=3338
2.05/2.38	
2.05/2.38	Low Water (keep): wt=13.000, iters=3336
2.05/2.38	
2.05/2.38	Low Water (displace): id=11077, wt=10.000
2.05/2.38	
2.05/2.38	Low Water (displace): id=11743, wt=9.000
2.05/2.38	
2.05/2.38	Low Water (displace): id=13433, wt=8.000
2.43/2.71	
2.43/2.71	============================== PROOF =================================
2.43/2.71	% SZS status Theorem
2.43/2.71	% SZS output start Refutation
2.43/2.71	
2.43/2.71	% Proof 1 at 1.64 (+ 0.08) seconds.
2.43/2.71	% Length of proof is 18.
2.43/2.71	% Level of proof is 5.
2.43/2.71	% Maximum clause weight is 12.000.
2.43/2.71	% Given clauses 1476.
2.43/2.71	
2.43/2.71	9 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
2.43/2.71	13 (all Ax all C ((exists I2 (model(I2,Ax) & model(I2,not(C)))) & (exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
2.43/2.71	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
2.43/2.71	27 (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].
2.43/2.71	40 nevera(A,B) | status(f46(A,B),f47(A,B),A) # label(nevera) # label(axiom).  [clausify(27)].
2.43/2.71	42 nevera(A,B) | status(f46(A,B),f47(A,B),B) # label(nevera) # label(axiom).  [clausify(27)].
2.43/2.71	43 -nevera(noc,thm) # label(nevera_noc_thm) # label(negated_conjecture).  [assumption].
2.43/2.71	84 -status(A,B,thm) | -model(C,A) | model(C,B) # label(thm) # label(axiom).  [clausify(9)].
2.43/2.71	101 model(f30(A,B),A) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(13)].
2.43/2.71	102 model(f30(A,B),not(B)) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(13)].
2.43/2.71	135 -model(A,not(B)) | -model(A,B) # label(completeness) # label(axiom).  [clausify(23)].
2.43/2.71	148 status(f46(noc,thm),f47(noc,thm),noc).  [resolve(43,a,40,a)].
2.43/2.71	149 status(f46(noc,thm),f47(noc,thm),thm).  [resolve(43,a,42,a)].
2.43/2.71	561 model(f30(f46(noc,thm),f47(noc,thm)),not(f47(noc,thm))).  [resolve(148,a,102,b)].
2.43/2.71	562 model(f30(f46(noc,thm),f47(noc,thm)),f46(noc,thm)).  [resolve(148,a,101,b)].
2.43/2.71	573 -model(A,f46(noc,thm)) | model(A,f47(noc,thm)).  [resolve(149,a,84,a)].
2.43/2.71	15302 -model(f30(f46(noc,thm),f47(noc,thm)),f47(noc,thm)).  [resolve(561,a,135,a)].
2.43/2.71	15367 $F.  [resolve(573,a,562,a),unit_del(a,15302)].
2.43/2.71	
2.43/2.71	% SZS output end Refutation
2.43/2.71	============================== end of proof ==========================
2.43/2.71	
2.43/2.71	============================== STATISTICS ============================
2.43/2.71	
2.43/2.71	Given=1476. Generated=126116. Kept=15317. proofs=1.
2.43/2.71	Usable=1476. Sos=9998. Demods=0. Limbo=0, Disabled=3966. Hints=0.
2.43/2.71	Megabytes=16.77.
2.43/2.71	User_CPU=1.64, System_CPU=0.08, Wall_clock=1.
2.43/2.71	
2.43/2.71	============================== end of statistics =====================
2.43/2.71	
2.43/2.71	============================== end of search =========================
2.43/2.71	
2.43/2.71	THEOREM PROVED
2.43/2.71	% SZS status Theorem
2.43/2.71	
2.43/2.71	Exiting with 1 proof.
2.43/2.71	
2.43/2.71	Process 18885 exit (max_proofs) Tue Aug  9 02:36:22 2022
2.43/2.71	Prover9 interrupted
2.43/2.72	EOF