0.06/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer   : n031.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 960
0.10/0.31	% DateTime   : Thu Jul  2 06:54:02 EDT 2020
0.10/0.31	% CPUTime    : 
0.82/1.14	============================== Prover9 ===============================
0.82/1.14	Prover9 (32) version 2009-11A, November 2009.
0.82/1.14	Process 20557 was started by sandbox2 on n031.cluster.edu,
0.82/1.14	Thu Jul  2 06:54:03 2020
0.82/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_20404_n031.cluster.edu".
0.82/1.14	============================== end of head ===========================
0.82/1.14	
0.82/1.14	============================== INPUT =================================
0.82/1.14	
0.82/1.14	% Reading from file /tmp/Prover9_20404_n031.cluster.edu
0.82/1.14	
0.82/1.14	set(prolog_style_variables).
0.82/1.14	set(auto2).
0.82/1.14	    % set(auto2) -> set(auto).
0.82/1.14	    % set(auto) -> set(auto_inference).
0.82/1.14	    % set(auto) -> set(auto_setup).
0.82/1.14	    % set(auto_setup) -> set(predicate_elim).
0.82/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.14	    % set(auto) -> set(auto_limits).
0.82/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.14	    % set(auto) -> set(auto_denials).
0.82/1.14	    % set(auto) -> set(auto_process).
0.82/1.14	    % set(auto2) -> assign(new_constants, 1).
0.82/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.14	    % set(auto2) -> assign(max_hours, 1).
0.82/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.14	    % set(auto2) -> set(sort_initial_sos).
0.82/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.14	    % set(auto2) -> assign(max_megs, 400).
0.82/1.14	    % set(auto2) -> assign(stats, some).
0.82/1.14	    % set(auto2) -> clear(echo_input).
0.82/1.14	    % set(auto2) -> set(quiet).
0.82/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.14	    % set(auto2) -> clear(print_given).
0.82/1.14	assign(lrs_ticks,-1).
0.82/1.14	assign(sos_limit,10000).
0.82/1.14	assign(order,kbo).
0.82/1.14	set(lex_order_vars).
0.82/1.14	clear(print_given).
0.82/1.14	
0.82/1.14	% formulas(sos).  % not echoed (33 formulas)
0.82/1.14	
0.82/1.14	============================== end of input ==========================
0.82/1.14	
0.82/1.14	% From the command line: assign(max_seconds, 960).
0.82/1.14	
0.82/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.14	
0.82/1.14	% Formulas that are not ordinary clauses:
0.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	8 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.14	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.82/1.14	24 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.14	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.14	30 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	
0.82/1.14	============================== end of process non-clausal formulas ===
0.82/1.14	
0.82/1.14	============================== PROCESS INITIAL CLAUSES ===============
0.82/1.14	
0.82/1.14	============================== PREDICATE ELIMINATION =================
0.82/1.14	33 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(22)].
0.82/1.14	34 status(f42(A,B),f43(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.82/1.14	35 -status(f42(A,B),f43(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(22)].
0.82/1.14	Derived: -status(A,B,C) | status(A,B,D) | status(f42(C,D),f43(C,D),C).  [resolve(33,c,34,b)].
0.82/1.14	Derived: -status(A,B,C) | status(A,B,D) | -status(f42(C,D),f43(C,D),D).  [resolve(33,c,35,b)].
0.82/1.14	36 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom).  [clausify(23)].
0.82/1.14	37 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(23)].
0.82/1.14	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,37,a)].
0.85/1.27	38 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom).  [clausify(23)].
0.85/1.27	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,a,37,a)].
0.85/1.27	39 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
0.85/1.27	40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(25)].
0.85/1.27	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(39,b,40,c)].
0.85/1.27	41 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(25)].
0.85/1.27	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(41,b,40,c)].
0.85/1.27	42 -mighta(tac,thm) # label(mighta_tac_thm) # label(negated_conjecture).  [assumption].
0.85/1.27	Derived: -status(A,B,tac) | -status(A,B,thm).  [resolve(42,a,40,c)].
0.85/1.27	43 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
0.85/1.27	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)].
0.85/1.27	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)].
0.85/1.27	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)].
0.85/1.27	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)].
0.85/1.27	46 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(26)].
0.85/1.27	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)].
0.85/1.27	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)].
0.85/1.27	47 status(f50(A,B),f51(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
0.85/1.27	48 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom).  [clausify(28)].
0.85/1.27	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | status(C,D,B).  [resolve(47,b,48,c)].
0.85/1.27	49 -status(f50(A,B),f51(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(28)].
0.85/1.27	Derived: -status(f50(A,B),f51(A,B),B) | -status(C,D,A) | status(C,D,B).  [resolve(49,b,48,c)].
0.85/1.27	
0.85/1.27	============================== end predicate elimination =============
0.85/1.27	
0.85/1.27	Auto_denials:  (non-Horn, no changes).
0.85/1.27	
0.85/1.27	Term ordering decisions:
0.85/1.27	
0.85/1.27	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
0.85/1.27	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.85/1.27	
0.85/1.27	============================== end of process initial clauses ========
0.85/1.27	
0.85/1.27	============================== CLAUSES FOR SEARCH ====================
0.85/1.27	
0.85/1.27	============================== end of clauses for search =============
0.85/1.27	
0.85/1.27	============================== SEARCH ================================
0.85/1.27	
0.85/1.27	% Starting search at 0.03 seconds.
0.85/1.27	
0.85/1.27	============================== PROOF =================================
0.85/1.27	% SZS status Theorem
0.85/1.27	% SZS output start Refutation
0.85/1.27	
0.85/1.27	% Proof 1 at 0.14 (+ 0.00) seconds.
0.85/1.27	% Length of proof is 15.
0.85/1.27	% Level of proof is 4.
0.85/1.27	% Maximum clause weight is 12.000.
0.85/1.27	% Given clauses 131.
0.85/1.27	
0.85/1.27	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.85/1.27	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.85/1.27	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.85/1.27	27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.85/1.27	40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(25)].
0.85/1.27	42 -mighta(tac,thm) # label(mighta_tac_thm) # label(negated_conjecture).  [assumption].
0.85/1.27	60 -model(f7(A,B),B) | -model(C,A) | status(A,B,tac) # label(tac) # label(axiom).  [clausify(3)].
0.85/1.27	73 status(A,B,thm) | -model(f13(A,B),B) # label(thm) # label(axiom).  [clausify(6)].
0.85/1.27	129 model(A,c9) # label(tautology) # label(axiom).  [clausify(27)].
0.85/1.27	146 -status(A,B,tac) | -status(A,B,thm).  [resolve(42,a,40,c)].
0.85/1.27	155 -model(f7(A,A),A) | status(A,A,tac).  [factor(60,a,b)].
0.85/1.27	285 status(A,c9,thm).  [resolve(129,a,73,b)].
0.85/1.27	587 status(c9,c9,tac).  [resolve(155,a,129,a)].
0.85/1.27	832 -status(A,c9,tac).  [resolve(285,a,146,b)].
0.85/1.27	833 $F.  [resolve(832,a,587,a)].
0.85/1.27	
0.85/1.27	% SZS output end Refutation
0.85/1.27	============================== end of proof ==========================
0.85/1.27	
0.85/1.27	============================== STATISTICS ============================
0.85/1.27	
0.85/1.27	Given=131. Generated=1141. Kept=783. proofs=1.
0.85/1.27	Usable=131. Sos=623. Demods=0. Limbo=8, Disabled=142. Hints=0.
0.85/1.27	Megabytes=1.69.
0.85/1.27	User_CPU=0.14, System_CPU=0.00, Wall_clock=0.
0.85/1.27	
0.85/1.27	============================== end of statistics =====================
0.85/1.27	
0.85/1.27	============================== end of search =========================
0.85/1.27	
0.85/1.27	THEOREM PROVED
0.85/1.27	% SZS status Theorem
0.85/1.27	
0.85/1.27	Exiting with 1 proof.
0.85/1.27	
0.85/1.27	Process 20557 exit (max_proofs) Thu Jul  2 06:54:03 2020
0.85/1.27	Prover9 interrupted
0.85/1.27	EOF