0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.25	% Computer   : n006.star.cs.uiowa.edu
0.03/0.25	% Model      : x86_64 x86_64
0.03/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.25	% Memory     : 32218.625MB
0.03/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.25	% CPULimit   : 300
0.03/0.25	% DateTime   : Sat Jul 14 04:17:13 CDT 2018
0.03/0.26	% CPUTime    : 
0.27/0.63	============================== Prover9 ===============================
0.27/0.63	Prover9 (32) version 2009-11A, November 2009.
0.27/0.63	Process 43990 was started by sandbox2 on n006.star.cs.uiowa.edu,
0.27/0.63	Sat Jul 14 04:17:14 2018
0.27/0.63	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_43958_n006.star.cs.uiowa.edu".
0.27/0.63	============================== end of head ===========================
0.27/0.63	
0.27/0.63	============================== INPUT =================================
0.27/0.63	
0.27/0.63	% Reading from file /tmp/Prover9_43958_n006.star.cs.uiowa.edu
0.27/0.63	
0.27/0.63	set(prolog_style_variables).
0.27/0.63	set(auto2).
0.27/0.63	    % set(auto2) -> set(auto).
0.27/0.63	    % set(auto) -> set(auto_inference).
0.27/0.63	    % set(auto) -> set(auto_setup).
0.27/0.63	    % set(auto_setup) -> set(predicate_elim).
0.27/0.63	    % set(auto_setup) -> assign(eq_defs, unfold).
0.27/0.63	    % set(auto) -> set(auto_limits).
0.27/0.63	    % set(auto_limits) -> assign(max_weight, "100.000").
0.27/0.63	    % set(auto_limits) -> assign(sos_limit, 20000).
0.27/0.63	    % set(auto) -> set(auto_denials).
0.27/0.63	    % set(auto) -> set(auto_process).
0.27/0.63	    % set(auto2) -> assign(new_constants, 1).
0.27/0.63	    % set(auto2) -> assign(fold_denial_max, 3).
0.27/0.63	    % set(auto2) -> assign(max_weight, "200.000").
0.27/0.63	    % set(auto2) -> assign(max_hours, 1).
0.27/0.63	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.27/0.63	    % set(auto2) -> assign(max_seconds, 0).
0.27/0.63	    % set(auto2) -> assign(max_minutes, 5).
0.27/0.63	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.27/0.63	    % set(auto2) -> set(sort_initial_sos).
0.27/0.63	    % set(auto2) -> assign(sos_limit, -1).
0.27/0.63	    % set(auto2) -> assign(lrs_ticks, 3000).
0.27/0.63	    % set(auto2) -> assign(max_megs, 400).
0.27/0.63	    % set(auto2) -> assign(stats, some).
0.27/0.63	    % set(auto2) -> clear(echo_input).
0.27/0.63	    % set(auto2) -> set(quiet).
0.27/0.63	    % set(auto2) -> clear(print_initial_clauses).
0.27/0.63	    % set(auto2) -> clear(print_given).
0.27/0.63	assign(lrs_ticks,-1).
0.27/0.63	assign(sos_limit,10000).
0.27/0.63	assign(order,kbo).
0.27/0.63	set(lex_order_vars).
0.27/0.63	clear(print_given).
0.27/0.63	
0.27/0.63	% formulas(sos).  % not echoed (33 formulas)
0.27/0.63	
0.27/0.63	============================== end of input ==========================
0.27/0.63	
0.27/0.63	% From the command line: assign(max_seconds, 300).
0.27/0.63	
0.27/0.63	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.27/0.63	
0.27/0.63	% Formulas that are not ordinary clauses:
0.27/0.63	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.27/0.63	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.27/0.63	3 (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.27/0.63	4 (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.27/0.63	5 (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.27/0.63	6 (all Ax all C (-(exists I1 model(I1,Ax)) & (exists I2 model(I2,C)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	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.27/0.63	8 (all Ax all C (status(Ax,C,eth) <-> (all I3 (model(I3,C) <-> model(I3,Ax))) & (exists I2 -model(I2,Ax)) & (exists I1 model(I1,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	9 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	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.27/0.63	11 (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.27/0.63	12 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	13 (all Ax all C (status(Ax,C,tca) <-> -(exists I1 model(I1,Ax)) & (all I2 model(I2,C)))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	14 (all Ax all C ((all I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	15 (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.27/0.63	16 (all Ax all C (status(Ax,C,uns) <-> (all I2 model(I2,not(C))) & (all I1 model(I1,Ax)))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	17 (all Ax all C (status(Ax,C,wec) <-> (exists I1 model(I1,Ax)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	18 (all Ax all C ((exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	19 (all Ax all C (status(Ax,C,eqv) <-> (all I2 (model(I2,Ax) <-> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	20 (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.27/0.63	21 (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.27/0.63	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.27/0.63	23 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	24 (all S1 all S2 (isa(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))))) # label(isa) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	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.27/0.63	26 (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.27/0.63	27 (exists Ax exists C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I4 -model(I4,C)) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	28 (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.27/0.63	29 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	30 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	32 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.27/0.63	
0.27/0.63	============================== end of process non-clausal formulas ===
0.27/0.63	
0.27/0.63	============================== PROCESS INITIAL CLAUSES ===============
0.27/0.63	
0.27/0.63	============================== PREDICATE ELIMINATION =================
0.27/0.63	33 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(20)].
0.27/0.63	34 -status(f42(A,B),f43(A,B),B) | status(f42(A,B),f43(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(20)].
0.27/0.63	35 status(f42(A,B),f43(A,B),B) | -status(f42(A,B),f43(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(20)].
0.27/0.63	Derived: status(A,B,C) | status(A,B,D) | -status(f42(D,C),f43(D,C),C) | status(f42(D,C),f43(D,C),D).  [resolve(33,c,34,c)].
0.27/0.63	Derived: status(A,B,C) | status(A,B,D) | status(f42(D,C),f43(D,C),C) | -status(f42(D,C),f43(D,C),D).  [resolve(33,c,35,c)].
0.27/0.63	36 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(20)].
1.74/2.12	Derived: -status(A,B,C) | -status(A,B,D) | -status(f42(D,C),f43(D,C),C) | status(f42(D,C),f43(D,C),D).  [resolve(36,c,34,c)].
1.74/2.12	Derived: -status(A,B,C) | -status(A,B,D) | status(f42(D,C),f43(D,C),C) | -status(f42(D,C),f43(D,C),D).  [resolve(36,c,35,c)].
1.74/2.12	37 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom).  [clausify(22)].
1.74/2.12	38 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(22)].
1.74/2.12	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(37,a,38,a)].
1.74/2.12	39 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom).  [clausify(22)].
1.74/2.12	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(39,a,38,a)].
1.74/2.12	40 isa(A,B) | status(f46(A,B),f47(A,B),A) # label(isa) # label(axiom).  [clausify(24)].
1.74/2.12	41 -isa(A,B) | -status(C,D,A) | status(C,D,B) # label(isa) # label(axiom).  [clausify(24)].
1.74/2.12	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | status(C,D,B).  [resolve(40,a,41,a)].
1.74/2.12	42 isa(A,B) | -status(f46(A,B),f47(A,B),B) # label(isa) # label(axiom).  [clausify(24)].
1.74/2.12	Derived: -status(f46(A,B),f47(A,B),B) | -status(C,D,A) | status(C,D,B).  [resolve(42,a,41,a)].
1.74/2.12	43 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom).  [clausify(25)].
1.74/2.12	44 -nota(A,B) | status(f48(A,B),f49(A,B),A) # label(nota) # label(axiom).  [clausify(25)].
1.74/2.12	45 -nota(A,B) | -status(f48(A,B),f49(A,B),B) # label(nota) # label(axiom).  [clausify(25)].
1.74/2.12	Derived: -status(A,B,C) | status(A,B,D) | status(f48(C,D),f49(C,D),C).  [resolve(43,a,44,a)].
1.74/2.12	Derived: -status(A,B,C) | status(A,B,D) | -status(f48(C,D),f49(C,D),D).  [resolve(43,a,45,a)].
1.74/2.12	46 status(f50(A,B),f51(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(28)].
1.74/2.12	47 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(28)].
1.74/2.12	Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(46,b,47,c)].
1.74/2.12	48 status(f50(A,B),f51(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(28)].
1.74/2.12	Derived: status(f50(A,B),f51(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(48,b,47,c)].
1.74/2.12	49 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
1.74/2.12	Derived: -status(A,B,sca) | -status(A,B,thm).  [resolve(49,a,47,c)].
1.74/2.12	
1.74/2.12	============================== end predicate elimination =============
1.74/2.12	
1.74/2.12	Auto_denials:  (non-Horn, no changes).
1.74/2.12	
1.74/2.12	Term ordering decisions:
1.74/2.12	
1.74/2.12	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
1.74/2.12	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.
1.74/2.12	
1.74/2.12	============================== end of process initial clauses ========
1.74/2.12	
1.74/2.12	============================== CLAUSES FOR SEARCH ====================
1.74/2.12	
1.74/2.12	============================== end of clauses for search =============
1.74/2.12	
1.74/2.12	============================== SEARCH ================================
1.74/2.12	
1.74/2.12	% Starting search at 0.02 seconds.
1.74/2.12	
1.74/2.12	Low Water (keep): wt=24.000, iters=3365
1.74/2.12	
1.74/2.12	Low Water (keep): wt=21.000, iters=3357
1.74/2.12	
1.74/2.12	Low Water (keep): wt=20.000, iters=3348
1.74/2.12	
1.74/2.12	Low Water (keep): wt=18.000, iters=3342
1.74/2.12	
1.74/2.12	Low Water (keep): wt=17.000, iters=3338
1.74/2.12	
1.74/2.12	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 57 (0.00 of 0.83 sec).
1.74/2.12	
1.74/2.12	Low Water (keep): wt=16.000, iters=3359
1.74/2.12	
1.74/2.12	Low Water (keep): wt=15.000, iters=3338
1.74/2.12	
1.74/2.12	Low Water (keep): wt=14.000, iters=3341
1.74/2.12	
1.74/2.12	Low Water (keep): wt=13.000, iters=3379
1.74/2.12	
1.74/2.12	Low Water (displace): id=11096, wt=10.000
1.74/2.12	
1.74/2.12	Low Water (displace): id=11097, wt=9.000
1.74/2.12	
1.74/2.12	============================== PROOF =================================
1.74/2.12	% SZS status Theorem
1.74/2.12	% SZS output start Refutation
1.74/2.12	
1.74/2.12	% Proof 1 at 1.47 (+ 0.04) seconds.
1.74/2.12	% Length of proof is 16.
1.74/2.12	% Level of proof is 4.
1.74/2.12	% Maximum clause weight is 12.000.
1.74/2.12	% Given clauses 974.
1.74/2.12	
1.74/2.12	5 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
1.74/2.12	6 (all Ax all C (-(exists I1 model(I1,Ax)) & (exists I2 model(I2,C)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
1.74/2.12	28 (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].
1.74/2.12	29 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
1.74/2.12	30 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
1.74/2.12	47 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(28)].
1.74/2.12	49 -mighta(sca,thm) # label(mighta_sca_thm) # label(negated_conjecture).  [assumption].
1.74/2.12	65 -model(f12(A,B),B) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(5)].
1.74/2.12	67 model(f13(A,B),A) | -model(C,B) | status(A,B,sca) # label(sca) # label(axiom).  [clausify(6)].
1.74/2.12	136 -model(A,c17) # label(contradiction) # label(axiom).  [clausify(29)].
1.74/2.12	137 model(A,c18) # label(tautology) # label(axiom).  [clausify(30)].
1.74/2.12	152 -status(A,B,sca) | -status(A,B,thm).  [resolve(49,a,47,c)].
1.74/2.12	410 model(f13(A,c18),A) | status(A,c18,sca).  [resolve(137,a,67,b)].
1.74/2.12	411 status(A,c18,thm).  [resolve(137,a,65,a)].
1.74/2.12	11302 model(f13(A,c18),A).  [resolve(410,b,152,a),unit_del(b,411)].
1.74/2.12	11303 $F.  [resolve(11302,a,136,a)].
1.74/2.12	
1.74/2.12	% SZS output end Refutation
1.74/2.12	============================== end of proof ==========================
1.74/2.12	
1.74/2.12	============================== STATISTICS ============================
1.74/2.12	
1.74/2.12	Given=974. Generated=62463. Kept=11253. proofs=1.
1.74/2.12	Usable=974. Sos=9999. Demods=0. Limbo=0, Disabled=401. Hints=0.
1.74/2.12	Megabytes=14.79.
1.74/2.12	User_CPU=1.47, System_CPU=0.04, Wall_clock=1.
1.74/2.12	
1.74/2.12	============================== end of statistics =====================
1.74/2.12	
1.74/2.12	============================== end of search =========================
1.74/2.12	
1.74/2.12	THEOREM PROVED
1.74/2.12	% SZS status Theorem
1.74/2.12	
1.74/2.12	Exiting with 1 proof.
1.74/2.12	
1.74/2.12	Process 43990 exit (max_proofs) Sat Jul 14 04:17:15 2018
1.74/2.13	Prover9 interrupted
1.74/2.13	EOF