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.02/0.23	% Computer   : n153.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:24:10 CDT 2018
0.02/0.24	% CPUTime    : 
0.06/0.48	============================== Prover9 ===============================
0.06/0.48	Prover9 (32) version 2009-11A, November 2009.
0.06/0.48	Process 54134 was started by sandbox2 on n153.star.cs.uiowa.edu,
0.06/0.48	Sat Jul 14 04:24:10 2018
0.06/0.48	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_54102_n153.star.cs.uiowa.edu".
0.06/0.48	============================== end of head ===========================
0.06/0.48	
0.06/0.48	============================== INPUT =================================
0.06/0.48	
0.06/0.48	% Reading from file /tmp/Prover9_54102_n153.star.cs.uiowa.edu
0.06/0.48	
0.06/0.48	set(prolog_style_variables).
0.06/0.48	set(auto2).
0.06/0.48	    % set(auto2) -> set(auto).
0.06/0.48	    % set(auto) -> set(auto_inference).
0.06/0.48	    % set(auto) -> set(auto_setup).
0.06/0.48	    % set(auto_setup) -> set(predicate_elim).
0.06/0.48	    % set(auto_setup) -> assign(eq_defs, unfold).
0.06/0.48	    % set(auto) -> set(auto_limits).
0.06/0.48	    % set(auto_limits) -> assign(max_weight, "100.000").
0.06/0.48	    % set(auto_limits) -> assign(sos_limit, 20000).
0.06/0.48	    % set(auto) -> set(auto_denials).
0.06/0.48	    % set(auto) -> set(auto_process).
0.06/0.48	    % set(auto2) -> assign(new_constants, 1).
0.06/0.48	    % set(auto2) -> assign(fold_denial_max, 3).
0.06/0.48	    % set(auto2) -> assign(max_weight, "200.000").
0.06/0.48	    % set(auto2) -> assign(max_hours, 1).
0.06/0.48	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.06/0.48	    % set(auto2) -> assign(max_seconds, 0).
0.06/0.48	    % set(auto2) -> assign(max_minutes, 5).
0.06/0.48	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.06/0.48	    % set(auto2) -> set(sort_initial_sos).
0.06/0.48	    % set(auto2) -> assign(sos_limit, -1).
0.06/0.48	    % set(auto2) -> assign(lrs_ticks, 3000).
0.06/0.48	    % set(auto2) -> assign(max_megs, 400).
0.06/0.48	    % set(auto2) -> assign(stats, some).
0.06/0.48	    % set(auto2) -> clear(echo_input).
0.06/0.48	    % set(auto2) -> set(quiet).
0.06/0.48	    % set(auto2) -> clear(print_initial_clauses).
0.06/0.48	    % set(auto2) -> clear(print_given).
0.06/0.48	assign(lrs_ticks,-1).
0.06/0.48	assign(sos_limit,10000).
0.06/0.48	assign(order,kbo).
0.06/0.48	set(lex_order_vars).
0.06/0.48	clear(print_given).
0.06/0.48	
0.06/0.48	% formulas(sos).  % not echoed (14 formulas)
0.06/0.48	
0.06/0.48	============================== end of input ==========================
0.06/0.48	
0.06/0.48	% From the command line: assign(max_seconds, 300).
0.06/0.48	
0.06/0.48	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.06/0.48	
0.06/0.48	% Formulas that are not ordinary clauses:
0.06/0.48	1 (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.06/0.48	2 (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.06/0.48	3 (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.06/0.48	4 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	5 (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.06/0.48	6 (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.06/0.48	7 (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.06/0.48	8 (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.06/0.48	9 (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.06/0.48	10 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	11 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	12 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.06/0.48	13 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.06/0.49	14 -(all S1 all S2 all S3 (nota(S1,S3) & isa(S1,S2) -> nota(S2,S3))) # label(nota_isa_nota) # label(negated_conjecture) # label(non_clause).  [assumption].
0.06/0.49	
0.06/0.49	============================== end of process non-clausal formulas ===
0.06/0.49	
0.06/0.49	============================== PROCESS INITIAL CLAUSES ===============
0.06/0.49	
0.06/0.49	============================== PREDICATE ELIMINATION =================
0.06/0.49	15 -nota(c20,c21) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	16 nota(c19,c21) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	17 -nota(A,B) | -status(f7(A,B),f8(A,B),B) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	Derived: -status(f7(c19,c21),f8(c19,c21),c21).  [resolve(17,a,16,a)].
0.06/0.49	18 -nota(A,B) | status(f7(A,B),f8(A,B),A) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	Derived: status(f7(c19,c21),f8(c19,c21),c19).  [resolve(18,a,16,a)].
0.06/0.49	19 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	Derived: -status(A,B,c20) | status(A,B,c21).  [resolve(19,a,15,a)].
0.06/0.49	Derived: -status(A,B,C) | status(A,B,D) | -status(f7(C,D),f8(C,D),D).  [resolve(19,a,17,a)].
0.06/0.49	Derived: -status(A,B,C) | status(A,B,D) | status(f7(C,D),f8(C,D),C).  [resolve(19,a,18,a)].
0.06/0.49	20 -isa(A,B) | -status(C,D,A) | status(C,D,B) # label(isa) # label(axiom).  [clausify(5)].
0.06/0.49	21 isa(c19,c20) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	22 isa(A,B) | status(f5(A,B),f6(A,B),A) # label(isa) # label(axiom).  [clausify(5)].
0.06/0.49	Derived: -status(A,B,c19) | status(A,B,c20).  [resolve(20,a,21,a)].
0.06/0.49	Derived: -status(A,B,C) | status(A,B,D) | status(f5(C,D),f6(C,D),C).  [resolve(20,a,22,a)].
0.06/0.49	23 isa(A,B) | -status(f5(A,B),f6(A,B),B) # label(isa) # label(axiom).  [clausify(5)].
0.06/0.49	Derived: -status(f5(A,B),f6(A,B),B) | -status(C,D,A) | status(C,D,B).  [resolve(23,a,20,a)].
0.06/0.49	24 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(3)].
0.06/0.49	25 nevera(A,B) | status(f3(A,B),f4(A,B),A) # label(nevera) # label(axiom).  [clausify(3)].
0.06/0.49	26 nevera(A,B) | status(f3(A,B),f4(A,B),B) # label(nevera) # label(axiom).  [clausify(3)].
0.06/0.49	Derived: -status(A,B,C) | -status(A,B,D) | status(f3(C,D),f4(C,D),C).  [resolve(24,a,25,a)].
0.06/0.49	Derived: -status(A,B,C) | -status(A,B,D) | status(f3(C,D),f4(C,D),D).  [resolve(24,a,26,a)].
0.06/0.49	27 -status(f1(A,B),f2(A,B),B) | status(f1(A,B),f2(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(1)].
0.06/0.49	28 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(1)].
0.06/0.49	29 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom).  [clausify(1)].
0.06/0.49	Derived: -status(f1(A,B),f2(A,B),B) | status(f1(A,B),f2(A,B),A) | -status(C,D,B) | -status(C,D,A).  [resolve(27,c,28,c)].
0.06/0.49	Derived: -status(f1(A,B),f2(A,B),B) | status(f1(A,B),f2(A,B),A) | status(C,D,B) | status(C,D,A).  [resolve(27,c,29,c)].
0.06/0.49	30 status(f1(A,B),f2(A,B),B) | -status(f1(A,B),f2(A,B),A) | xora(A,B) # label(xora) # label(axiom).  [clausify(1)].
0.06/0.49	Derived: status(f1(A,B),f2(A,B),B) | -status(f1(A,B),f2(A,B),A) | -status(C,D,B) | -status(C,D,A).  [resolve(30,c,28,c)].
0.06/0.49	Derived: status(f1(A,B),f2(A,B),B) | -status(f1(A,B),f2(A,B),A) | status(C,D,B) | status(C,D,A).  [resolve(30,c,29,c)].
0.06/0.49	31 status(f9(A,B),f10(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(9)].
0.06/0.49	32 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(9)].
0.06/0.49	Derived: status(f9(A,B),f10(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(31,b,32,c)].
0.06/0.49	33 status(f9(A,B),f10(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(9)].
0.06/0.49	Derived: status(f9(A,B),f10(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(33,b,32,c)].
0.06/0.49	
0.06/0.49	============================== end predicate elimination =============
0.06/0.49	
0.06/0.49	Auto_denials:  (non-Horn, no changes).
0.06/0.49	
0.06/0.49	Term ordering decisions:
0.06/0.49	
0.06/0.49	% Assigning unary symbol not kb_weight 0 and highest precedence (34).
0.06/0.49	Function symbol KB weights:  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. c19=1. c20=1. c21=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. not=0.
0.06/0.49	
0.06/0.49	============================== end of process initial clauses ========
0.06/0.49	
0.06/0.49	============================== CLAUSES FOR SEARCH ====================
0.06/0.49	
0.06/0.49	============================== end of clauses for search =============
0.06/0.49	
0.06/0.49	============================== SEARCH ================================
0.06/0.49	
0.06/0.49	% Starting search at 0.01 seconds.
0.06/0.49	
0.06/0.49	============================== PROOF =================================
0.06/0.49	% SZS status Theorem
0.06/0.49	% SZS output start Refutation
0.06/0.49	
0.06/0.49	% Proof 1 at 0.01 (+ 0.00) seconds.
0.06/0.49	% Length of proof is 16.
0.06/0.49	% Level of proof is 4.
0.06/0.49	% Maximum clause weight is 8.000.
0.06/0.49	% Given clauses 23.
0.06/0.49	
0.06/0.49	5 (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.06/0.49	6 (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.06/0.49	14 -(all S1 all S2 all S3 (nota(S1,S3) & isa(S1,S2) -> nota(S2,S3))) # label(nota_isa_nota) # label(negated_conjecture) # label(non_clause).  [assumption].
0.06/0.49	15 -nota(c20,c21) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	16 nota(c19,c21) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	17 -nota(A,B) | -status(f7(A,B),f8(A,B),B) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	18 -nota(A,B) | status(f7(A,B),f8(A,B),A) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	19 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom).  [clausify(6)].
0.06/0.49	20 -isa(A,B) | -status(C,D,A) | status(C,D,B) # label(isa) # label(axiom).  [clausify(5)].
0.06/0.49	21 isa(c19,c20) # label(nota_isa_nota) # label(negated_conjecture).  [clausify(14)].
0.06/0.49	51 -status(f7(c19,c21),f8(c19,c21),c21).  [resolve(17,a,16,a)].
0.06/0.49	52 status(f7(c19,c21),f8(c19,c21),c19).  [resolve(18,a,16,a)].
0.06/0.49	53 -status(A,B,c20) | status(A,B,c21).  [resolve(19,a,15,a)].
0.06/0.49	56 -status(A,B,c19) | status(A,B,c20).  [resolve(20,a,21,a)].
0.06/0.49	79 -status(f7(c19,c21),f8(c19,c21),c20).  [ur(53,b,51,a)].
0.06/0.49	82 $F.  [resolve(56,a,52,a),unit_del(a,79)].
0.06/0.49	
0.06/0.49	% SZS output end Refutation
0.06/0.49	============================== end of proof ==========================
0.06/0.49	
0.06/0.49	============================== STATISTICS ============================
0.06/0.49	
0.06/0.49	Given=23. Generated=71. Kept=48. proofs=1.
0.06/0.49	Usable=23. Sos=25. Demods=0. Limbo=0, Disabled=54. Hints=0.
0.06/0.49	Megabytes=0.11.
0.06/0.49	User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
0.06/0.49	
0.06/0.49	============================== end of statistics =====================
0.06/0.49	
0.06/0.49	============================== end of search =========================
0.06/0.49	
0.06/0.49	THEOREM PROVED
0.06/0.49	% SZS status Theorem
0.06/0.49	
0.06/0.49	Exiting with 1 proof.
0.06/0.49	
0.06/0.49	Process 54134 exit (max_proofs) Sat Jul 14 04:24:10 2018
0.06/0.49	Prover9 interrupted
0.06/0.51	EOF