0.07/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n023.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.35	% CPULimit : 960
0.13/0.35	% WCLimit  : 120
0.13/0.35	% DateTime : Tue Aug  9 02:39:13 EDT 2022
0.13/0.35	% CPUTime  : 
0.47/1.07	============================== Prover9 ===============================
0.47/1.07	Prover9 (32) version 2009-11A, November 2009.
0.47/1.07	Process 9209 was started by sandbox on n023.cluster.edu,
0.47/1.07	Tue Aug  9 02:39:13 2022
0.47/1.07	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_9055_n023.cluster.edu".
0.47/1.07	============================== end of head ===========================
0.47/1.07	
0.47/1.07	============================== INPUT =================================
0.47/1.07	
0.47/1.07	% Reading from file /tmp/Prover9_9055_n023.cluster.edu
0.47/1.07	
0.47/1.07	set(prolog_style_variables).
0.47/1.07	set(auto2).
0.47/1.07	    % set(auto2) -> set(auto).
0.47/1.07	    % set(auto) -> set(auto_inference).
0.47/1.07	    % set(auto) -> set(auto_setup).
0.47/1.07	    % set(auto_setup) -> set(predicate_elim).
0.47/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.07	    % set(auto) -> set(auto_limits).
0.47/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.07	    % set(auto) -> set(auto_denials).
0.47/1.07	    % set(auto) -> set(auto_process).
0.47/1.07	    % set(auto2) -> assign(new_constants, 1).
0.47/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.07	    % set(auto2) -> assign(max_hours, 1).
0.47/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.07	    % set(auto2) -> set(sort_initial_sos).
0.47/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.07	    % set(auto2) -> assign(max_megs, 400).
0.47/1.07	    % set(auto2) -> assign(stats, some).
0.47/1.07	    % set(auto2) -> clear(echo_input).
0.47/1.07	    % set(auto2) -> set(quiet).
0.47/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.07	    % set(auto2) -> clear(print_given).
0.47/1.07	assign(lrs_ticks,-1).
0.47/1.07	assign(sos_limit,10000).
0.47/1.07	assign(order,kbo).
0.47/1.07	set(lex_order_vars).
0.47/1.07	clear(print_given).
0.47/1.07	
0.47/1.07	% formulas(sos).  % not echoed (33 formulas)
0.47/1.07	
0.47/1.07	============================== end of input ==========================
0.47/1.07	
0.47/1.07	% From the command line: assign(max_seconds, 960).
0.47/1.07	
0.47/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.07	
0.47/1.07	% Formulas that are not ordinary clauses:
0.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	6 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	26 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	30 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	31 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	32 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	
0.47/1.07	============================== end of process non-clausal formulas ===
0.47/1.07	
0.47/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.47/1.07	
0.47/1.07	============================== PREDICATE ELIMINATION =================
0.47/1.07	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.47/1.07	34 -xora(A,B) | status(C,D,A) | status(C,D,B) # label(xora) # label(axiom).  [clausify(24)].
0.47/1.07	35 -xora(A,B) | -status(C,D,A) | -status(C,D,B) # label(xora) # label(axiom).  [clausify(24)].
0.47/1.07	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.47/1.07	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.47/1.07	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.47/1.07	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.66/2.95	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.66/2.95	37 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(25)].
2.66/2.95	38 status(f44(A,B),f45(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(25)].
2.66/2.95	39 -status(f44(A,B),f45(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(25)].
2.66/2.95	Derived: -status(A,B,C) | status(A,B,D) | status(f44(C,D),f45(C,D),C).  [resolve(37,c,38,b)].
2.66/2.95	Derived: -status(A,B,C) | status(A,B,D) | -status(f44(C,D),f45(C,D),D).  [resolve(37,c,39,b)].
2.66/2.95	40 nevera(A,B) | status(f46(A,B),f47(A,B),A) # label(nevera) # label(axiom).  [clausify(27)].
2.66/2.95	41 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(27)].
2.66/2.95	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(40,a,41,a)].
2.66/2.95	42 nevera(A,B) | status(f46(A,B),f47(A,B),B) # label(nevera) # label(axiom).  [clausify(27)].
2.66/2.95	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(42,a,41,a)].
2.66/2.95	43 nota(A,B) | status(C,D,B) | -status(C,D,A) # label(nota) # label(axiom).  [clausify(28)].
2.66/2.95	44 -nota(A,B) | -status(f48(A,B),f49(A,B),B) # label(nota) # label(axiom).  [clausify(28)].
2.66/2.95	45 -nota(A,B) | status(f48(A,B),f49(A,B),A) # label(nota) # label(axiom).  [clausify(28)].
2.66/2.95	Derived: status(A,B,C) | -status(A,B,D) | -status(f48(D,C),f49(D,C),C).  [resolve(43,a,44,a)].
2.66/2.95	Derived: status(A,B,C) | -status(A,B,D) | status(f48(D,C),f49(D,C),D).  [resolve(43,a,45,a)].
2.66/2.95	46 -nota(noc,thm) # label(nota_noc_thm) # label(negated_conjecture).  [assumption].
2.66/2.95	Derived: status(A,B,thm) | -status(A,B,noc).  [resolve(46,a,43,a)].
2.66/2.95	47 status(f50(A,B),f51(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(29)].
2.66/2.95	48 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(29)].
2.66/2.95	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(47,b,48,c)].
2.66/2.95	49 status(f50(A,B),f51(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(29)].
2.66/2.95	Derived: status(f50(A,B),f51(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(49,b,48,c)].
2.66/2.95	
2.66/2.95	============================== end predicate elimination =============
2.66/2.95	
2.66/2.95	Auto_denials:  (non-Horn, no changes).
2.66/2.95	
2.66/2.95	Term ordering decisions:
2.66/2.95	
2.66/2.95	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
2.66/2.95	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.
2.66/2.95	
2.66/2.95	============================== end of process initial clauses ========
2.66/2.95	
2.66/2.95	============================== CLAUSES FOR SEARCH ====================
2.66/2.95	
2.66/2.95	============================== end of clauses for search =============
2.66/2.95	
2.66/2.95	============================== SEARCH ================================
2.66/2.95	
2.66/2.95	% Starting search at 0.02 seconds.
2.66/2.95	
2.66/2.95	Low Water (keep): wt=30.000, iters=3360
2.66/2.95	
2.66/2.95	Low Water (keep): wt=21.000, iters=3334
2.66/2.95	
2.66/2.95	Low Water (keep): wt=20.000, iters=3346
2.66/2.95	
2.66/2.95	Low Water (keep): wt=18.000, iters=3338
2.66/2.95	
2.66/2.95	Low Water (keep): wt=17.000, iters=3334
2.66/2.95	
2.66/2.95	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 39 (0.00 of 0.72 sec).
2.66/2.95	
2.66/2.95	Low Water (keep): wt=16.000, iters=3345
2.66/2.95	
2.66/2.95	Low Water (keep): wt=15.000, iters=3340
2.66/2.95	
2.66/2.95	Low Water (keep): wt=14.000, iters=3336
2.66/2.95	
2.66/2.95	Low Water (keep): wt=13.000, iters=3338
2.66/2.95	
2.66/2.95	Low Water (displace): id=11082, wt=10.000
2.66/2.95	
2.66/2.95	Low Water (displace): id=11690, wt=9.000
2.66/2.95	
2.66/2.95	Low Water (displace): id=12513, wt=7.000
2.66/2.95	
2.66/2.95	Low Water (keep): wt=12.000, iters=3337
2.66/2.95	
2.66/2.95	============================== PROOF =================================
2.66/2.95	% SZS status Theorem
2.66/2.95	% SZS output start Refutation
2.66/2.95	
2.66/2.95	% Proof 1 at 1.80 (+ 0.09) seconds.
2.66/2.95	% Length of proof is 22.
2.66/2.95	% Level of proof is 8.
2.66/2.95	% Maximum clause weight is 17.000.
2.66/2.95	% Given clauses 1502.
2.66/2.95	
2.66/2.95	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.66/2.95	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.66/2.95	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].
2.66/2.95	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
2.66/2.95	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].
2.66/2.95	31 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
2.66/2.95	43 nota(A,B) | status(C,D,B) | -status(C,D,A) # label(nota) # label(axiom).  [clausify(28)].
2.66/2.95	46 -nota(noc,thm) # label(nota_noc_thm) # label(negated_conjecture).  [assumption].
2.66/2.95	84 -status(A,B,thm) | -model(C,A) | model(C,B) # label(thm) # label(axiom).  [clausify(9)].
2.66/2.95	100 -model(A,B) | -model(A,not(C)) | -model(D,C) | -model(D,B) | status(B,C,noc) # label(noc) # label(axiom).  [clausify(13)].
2.66/2.95	123 -model(c1,c3) # label(non_thm_spt) # label(axiom).  [clausify(20)].
2.66/2.95	124 model(c4,c3) # label(non_thm_spt) # label(axiom).  [clausify(20)].
2.66/2.95	134 model(A,not(B)) | model(A,B) # label(completeness) # label(axiom).  [clausify(23)].
2.66/2.95	137 model(A,c15) # label(tautology) # label(axiom).  [clausify(31)].
2.66/2.95	150 status(A,B,thm) | -status(A,B,noc).  [resolve(46,a,43,a)].
2.66/2.95	183 -model(A,B) | -model(A,not(c3)) | -model(c4,B) | status(B,c3,noc).  [resolve(124,a,100,c)].
2.66/2.95	1484 -model(A,not(c3)) | status(c15,c3,noc).  [resolve(183,a,137,a),unit_del(b,137)].
2.66/2.95	15500 status(c15,c3,noc) | model(A,c3).  [resolve(1484,a,134,a)].
2.66/2.95	15503 model(A,c3) | status(c15,c3,thm).  [resolve(15500,a,150,b)].
2.66/2.95	15516 model(A,c3) | model(B,c3).  [resolve(15503,b,84,a),unit_del(b,137)].
2.66/2.95	15517 model(A,c3).  [factor(15516,a,b)].
2.66/2.95	15518 $F.  [resolve(15517,a,123,a)].
2.66/2.95	
2.66/2.95	% SZS output end Refutation
2.66/2.95	============================== end of proof ==========================
2.66/2.95	
2.66/2.95	============================== STATISTICS ============================
2.66/2.95	
2.66/2.95	Given=1502. Generated=140487. Kept=15468. proofs=1.
2.66/2.95	Usable=1502. Sos=9999. Demods=0. Limbo=1, Disabled=4087. Hints=0.
2.66/2.95	Megabytes=16.82.
2.66/2.95	User_CPU=1.80, System_CPU=0.09, Wall_clock=2.
2.66/2.95	
2.66/2.95	============================== end of statistics =====================
2.66/2.95	
2.66/2.95	============================== end of search =========================
2.66/2.95	
2.66/2.95	THEOREM PROVED
2.66/2.95	% SZS status Theorem
2.66/2.95	
2.66/2.95	Exiting with 1 proof.
2.66/2.95	
2.66/2.95	Process 9209 exit (max_proofs) Tue Aug  9 02:39:15 2022
2.66/2.95	Prover9 interrupted
2.66/2.95	EOF