0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n027.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% DateTime   : Tue Jul 13 13:57:40 EDT 2021
0.12/0.33	% CPUTime    : 
0.80/1.12	============================== Prover9 ===============================
0.80/1.12	Prover9 (32) version 2009-11A, November 2009.
0.80/1.12	Process 32234 was started by sandbox2 on n027.cluster.edu,
0.80/1.12	Tue Jul 13 13:57:41 2021
0.80/1.12	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_32079_n027.cluster.edu".
0.80/1.12	============================== end of head ===========================
0.80/1.12	
0.80/1.12	============================== INPUT =================================
0.80/1.12	
0.80/1.12	% Reading from file /tmp/Prover9_32079_n027.cluster.edu
0.80/1.12	
0.80/1.12	set(prolog_style_variables).
0.80/1.12	set(auto2).
0.80/1.12	    % set(auto2) -> set(auto).
0.80/1.12	    % set(auto) -> set(auto_inference).
0.80/1.12	    % set(auto) -> set(auto_setup).
0.80/1.12	    % set(auto_setup) -> set(predicate_elim).
0.80/1.12	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.12	    % set(auto) -> set(auto_limits).
0.80/1.12	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.12	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.12	    % set(auto) -> set(auto_denials).
0.80/1.12	    % set(auto) -> set(auto_process).
0.80/1.12	    % set(auto2) -> assign(new_constants, 1).
0.80/1.12	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.12	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.12	    % set(auto2) -> assign(max_hours, 1).
0.80/1.12	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.12	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.12	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.12	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.12	    % set(auto2) -> set(sort_initial_sos).
0.80/1.12	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.12	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.12	    % set(auto2) -> assign(max_megs, 400).
0.80/1.12	    % set(auto2) -> assign(stats, some).
0.80/1.12	    % set(auto2) -> clear(echo_input).
0.80/1.12	    % set(auto2) -> set(quiet).
0.80/1.12	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.12	    % set(auto2) -> clear(print_given).
0.80/1.12	assign(lrs_ticks,-1).
0.80/1.12	assign(sos_limit,10000).
0.80/1.12	assign(order,kbo).
0.80/1.12	set(lex_order_vars).
0.80/1.12	clear(print_given).
0.80/1.12	
0.80/1.12	% formulas(sos).  % not echoed (33 formulas)
0.80/1.12	
0.80/1.12	============================== end of input ==========================
0.80/1.12	
0.80/1.12	% From the command line: assign(max_seconds, 1200).
0.80/1.12	
0.80/1.12	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.12	
0.80/1.12	% Formulas that are not ordinary clauses:
0.80/1.12	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.80/1.12	2 (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.80/1.12	3 (all Ax all C ((all I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,tca))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	4 (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.80/1.12	5 (all Ax all C (status(Ax,C,eth) <-> (exists I1 model(I1,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I2 -model(I2,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	6 (all Ax all C (status(Ax,C,tau) <-> (all I1 (model(I1,C) & model(I1,Ax))))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	7 (all Ax all C (status(Ax,C,wca) <-> (exists I2 model(I2,C)) & (exists I3 -model(I3,C)) & -(exists I1 model(I1,Ax)))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	8 (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.80/1.12	9 (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.80/1.12	10 (all Ax all C ((exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	11 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	12 (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.80/1.12	13 (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.80/1.12	14 (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.80/1.12	15 (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.80/1.12	16 (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.80/1.12	17 (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.80/1.12	18 (all Ax all C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	19 (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.80/1.12	20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	21 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	22 (all S1 all S2 ((exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	24 (exists Ax exists C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (-model(I2,Ax) | -model(I2,C))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	25 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	26 (exists Ax exists C ((exists I4 -model(I4,C)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	27 (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.80/1.12	28 (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.80/1.12	29 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))) <-> nevera(S1,S2))) # label(nevera) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	30 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	31 (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.80/1.12	32 (exists I1 exists Ax exists C ((exists I2 model(I2,C)) & -model(I1,C) & model(I1,Ax))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	
0.80/1.12	============================== end of process non-clausal formulas ===
0.80/1.12	
0.80/1.12	============================== PROCESS INITIAL CLAUSES ===============
0.80/1.12	
0.80/1.12	============================== PREDICATE ELIMINATION =================
0.80/1.12	33 -status(f42(A,B),f43(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(22)].
0.80/1.12	34 status(A,B,C) | -status(A,B,D) | nota(D,C) # label(nota) # label(axiom).  [clausify(22)].
0.80/1.12	Derived: -status(f42(A,B),f43(A,B),B) | status(C,D,B) | -status(C,D,A).  [resolve(33,b,34,c)].
0.80/1.12	35 status(f42(A,B),f43(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(22)].
0.80/1.12	Derived: status(f42(A,B),f43(A,B),A) | status(C,D,B) | -status(C,D,A).  [resolve(35,b,34,c)].
0.80/1.12	36 status(f44(A,B),f45(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(27)].
0.80/1.12	37 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(27)].
0.80/1.12	Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(36,b,37,c)].
3.43/3.77	38 status(f44(A,B),f45(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(27)].
3.43/3.77	Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(38,b,37,c)].
3.43/3.77	39 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(28)].
3.43/3.77	40 status(f46(A,B),f47(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
3.43/3.77	41 -status(f46(A,B),f47(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
3.43/3.77	Derived: -status(A,B,C) | status(A,B,D) | status(f46(C,D),f47(C,D),C).  [resolve(39,c,40,b)].
3.43/3.77	Derived: -status(A,B,C) | status(A,B,D) | -status(f46(C,D),f47(C,D),D).  [resolve(39,c,41,b)].
3.43/3.77	42 -isa(eth,thm) # label(isa_eth_thm) # label(negated_conjecture).  [assumption].
3.43/3.77	Derived: status(f46(eth,thm),f47(eth,thm),eth).  [resolve(42,a,40,b)].
3.43/3.77	Derived: -status(f46(eth,thm),f47(eth,thm),thm).  [resolve(42,a,41,b)].
3.43/3.77	43 -status(A,B,C) | -status(A,B,D) | -nevera(C,D) # label(nevera) # label(axiom).  [clausify(29)].
3.43/3.77	44 status(f48(A,B),f49(A,B),A) | nevera(A,B) # label(nevera) # label(axiom).  [clausify(29)].
3.43/3.77	45 status(f48(A,B),f49(A,B),B) | nevera(A,B) # label(nevera) # label(axiom).  [clausify(29)].
3.43/3.77	Derived: -status(A,B,C) | -status(A,B,D) | status(f48(C,D),f49(C,D),C).  [resolve(43,c,44,b)].
3.43/3.77	Derived: -status(A,B,C) | -status(A,B,D) | status(f48(C,D),f49(C,D),D).  [resolve(43,c,45,b)].
3.43/3.77	46 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(31)].
3.43/3.77	47 -status(f50(A,B),f51(A,B),B) | status(f50(A,B),f51(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(31)].
3.43/3.77	48 status(f50(A,B),f51(A,B),B) | -status(f50(A,B),f51(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(31)].
3.43/3.77	Derived: status(A,B,C) | status(A,B,D) | -status(f50(D,C),f51(D,C),C) | status(f50(D,C),f51(D,C),D).  [resolve(46,c,47,c)].
3.43/3.77	Derived: status(A,B,C) | status(A,B,D) | status(f50(D,C),f51(D,C),C) | -status(f50(D,C),f51(D,C),D).  [resolve(46,c,48,c)].
3.43/3.77	49 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(31)].
3.43/3.77	Derived: -status(A,B,C) | -status(A,B,D) | -status(f50(D,C),f51(D,C),C) | status(f50(D,C),f51(D,C),D).  [resolve(49,c,47,c)].
3.43/3.77	Derived: -status(A,B,C) | -status(A,B,D) | status(f50(D,C),f51(D,C),C) | -status(f50(D,C),f51(D,C),D).  [resolve(49,c,48,c)].
3.43/3.77	
3.43/3.77	============================== end predicate elimination =============
3.43/3.77	
3.43/3.77	Auto_denials:  (non-Horn, no changes).
3.43/3.77	
3.43/3.77	Term ordering decisions:
3.43/3.77	
3.43/3.77	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
3.43/3.77	Function symbol KB weights:  eth=1. eqv=1. noc=1. thm=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.
3.43/3.77	
3.43/3.77	============================== end of process initial clauses ========
3.43/3.77	
3.43/3.77	============================== CLAUSES FOR SEARCH ====================
3.43/3.77	
3.43/3.77	============================== end of clauses for search =============
3.43/3.77	
3.43/3.77	============================== SEARCH ================================
3.43/3.77	
3.43/3.77	% Starting search at 0.03 seconds.
3.43/3.77	
3.43/3.77	Low Water (keep): wt=28.000, iters=3376
3.43/3.77	
3.43/3.77	Low Water (keep): wt=24.000, iters=3354
3.43/3.77	
3.43/3.77	Low Water (keep): wt=23.000, iters=3341
3.43/3.77	
3.43/3.77	Low Water (keep): wt=21.000, iters=3357
3.43/3.77	
3.43/3.77	Low Water (keep): wt=16.000, iters=4143
3.43/3.77	
3.43/3.77	Low Water (keep): wt=15.000, iters=3764
3.43/3.77	
3.43/3.77	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 49 (0.00 of 1.49 sec).
3.43/3.77	
3.43/3.77	Low Water (keep): wt=14.000, iters=3373
3.43/3.77	
3.43/3.77	Low Water (displace): id=10958, wt=13.000
3.43/3.77	
3.43/3.77	Low Water (displace): id=11054, wt=11.000
3.43/3.77	
3.43/3.77	Low Water (displace): id=11055, wt=10.000
3.43/3.77	
3.43/3.77	Low Water (displace): id=11231, wt=9.000
3.43/3.77	
3.43/3.77	Low Water (keep): wt=13.000, iters=3375
43.06/43.56	
43.06/43.56	Low Water (displace): id=14183, wt=8.000
43.06/43.56	
43.06/43.56	Low Water (keep): wt=12.000, iters=3375
43.06/43.56	
43.06/43.56	Low Water (keep): wt=11.000, iters=5662
43.06/43.56	
43.06/43.56	Low Water (keep): wt=10.000, iters=4628
43.06/43.56	
43.06/43.56	Low Water (keep): wt=9.000, iters=3361
43.06/43.56	
43.06/43.56	============================== PROOF =================================
43.06/43.56	% SZS status Theorem
43.06/43.56	% SZS output start Refutation
43.06/43.56	
43.06/43.56	% Proof 1 at 38.57 (+ 3.66) seconds.
43.06/43.56	% Length of proof is 15.
43.06/43.56	% Level of proof is 5.
43.06/43.56	% Maximum clause weight is 11.000.
43.06/43.56	% Given clauses 27711.
43.06/43.56	
43.06/43.56	5 (all Ax all C (status(Ax,C,eth) <-> (exists I1 model(I1,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I2 -model(I2,Ax)))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
43.06/43.56	19 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
43.06/43.56	28 (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].
43.06/43.56	40 status(f46(A,B),f47(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
43.06/43.56	41 -status(f46(A,B),f47(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(28)].
43.06/43.56	42 -isa(eth,thm) # label(isa_eth_thm) # label(negated_conjecture).  [assumption].
43.06/43.56	68 -status(A,B,eth) | -model(C,A) | model(C,B) # label(eth) # label(axiom).  [clausify(5)].
43.06/43.56	120 model(f41(A,B),A) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(19)].
43.06/43.56	121 -model(f41(A,B),B) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(19)].
43.06/43.56	146 status(f46(eth,thm),f47(eth,thm),eth).  [resolve(42,a,40,b)].
43.06/43.56	147 -status(f46(eth,thm),f47(eth,thm),thm).  [resolve(42,a,41,b)].
43.06/43.56	532 -model(A,f46(eth,thm)) | model(A,f47(eth,thm)).  [resolve(146,a,68,a)].
43.06/43.56	534 model(f41(f46(eth,thm),f47(eth,thm)),f46(eth,thm)).  [resolve(147,a,120,b)].
43.06/43.56	15680 model(f41(f46(eth,thm),f47(eth,thm)),f47(eth,thm)).  [resolve(534,a,532,a)].
43.06/43.56	44622 $F.  [resolve(15680,a,121,a),unit_del(a,147)].
43.06/43.56	
43.06/43.56	% SZS output end Refutation
43.06/43.56	============================== end of proof ==========================
43.06/43.56	
43.06/43.56	============================== STATISTICS ============================
43.06/43.56	
43.06/43.56	Given=27711. Generated=4121106. Kept=44572. proofs=1.
43.06/43.56	Usable=27710. Sos=7624. Demods=0. Limbo=100, Disabled=9261. Hints=0.
43.06/43.56	Megabytes=29.51.
43.06/43.56	User_CPU=38.57, System_CPU=3.66, Wall_clock=42.
43.06/43.56	
43.06/43.56	============================== end of statistics =====================
43.06/43.56	
43.06/43.56	============================== end of search =========================
43.06/43.56	
43.06/43.56	THEOREM PROVED
43.06/43.56	% SZS status Theorem
43.06/43.56	
43.06/43.56	Exiting with 1 proof.
43.06/43.56	
43.06/43.56	Process 32234 exit (max_proofs) Tue Jul 13 13:58:23 2021
43.06/43.56	Prover9 interrupted
43.06/43.56	EOF