0.07/0.12	% 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   : n021.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.34	% CPULimit   : 1200
0.13/0.34	% DateTime   : Tue Jul 13 16:52:11 EDT 2021
0.13/0.34	% CPUTime    : 
0.44/1.02	============================== Prover9 ===============================
0.44/1.02	Prover9 (32) version 2009-11A, November 2009.
0.44/1.02	Process 15632 was started by sandbox2 on n021.cluster.edu,
0.44/1.02	Tue Jul 13 16:52:11 2021
0.44/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_15326_n021.cluster.edu".
0.44/1.02	============================== end of head ===========================
0.44/1.02	
0.44/1.02	============================== INPUT =================================
0.44/1.02	
0.44/1.02	% Reading from file /tmp/Prover9_15326_n021.cluster.edu
0.44/1.02	
0.44/1.02	set(prolog_style_variables).
0.44/1.02	set(auto2).
0.44/1.02	    % set(auto2) -> set(auto).
0.44/1.02	    % set(auto) -> set(auto_inference).
0.44/1.02	    % set(auto) -> set(auto_setup).
0.44/1.02	    % set(auto_setup) -> set(predicate_elim).
0.44/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.02	    % set(auto) -> set(auto_limits).
0.44/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.02	    % set(auto) -> set(auto_denials).
0.44/1.02	    % set(auto) -> set(auto_process).
0.44/1.02	    % set(auto2) -> assign(new_constants, 1).
0.44/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.02	    % set(auto2) -> assign(max_hours, 1).
0.44/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.02	    % set(auto2) -> set(sort_initial_sos).
0.44/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.02	    % set(auto2) -> assign(max_megs, 400).
0.44/1.02	    % set(auto2) -> assign(stats, some).
0.44/1.02	    % set(auto2) -> clear(echo_input).
0.44/1.02	    % set(auto2) -> set(quiet).
0.44/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.02	    % set(auto2) -> clear(print_given).
0.44/1.02	assign(lrs_ticks,-1).
0.44/1.02	assign(sos_limit,10000).
0.44/1.02	assign(order,kbo).
0.44/1.02	set(lex_order_vars).
0.44/1.02	clear(print_given).
0.44/1.02	
0.44/1.02	% formulas(sos).  % not echoed (12 formulas)
0.44/1.02	
0.44/1.02	============================== end of input ==========================
0.44/1.02	
0.44/1.02	% From the command line: assign(max_seconds, 1200).
0.44/1.02	
0.44/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.02	
0.44/1.02	% Formulas that are not ordinary clauses:
0.44/1.02	1 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | Y13 != Y12)) | -r2(X10,Y12))) | X10 = X3)) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	2 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	3 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | X18 != Y23 & -r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	4 (all X13 all X14 exists Y22 all X15 (Y22 = X15 & r3(X13,X14,X15) | X15 != Y22 & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	5 (all X5 exists Y8 ((exists Y18 (r1(Y18) & Y8 = Y18)) & (exists Y17 (r4(X5,Y17,Y8) & r1(Y17))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	6 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (Y4 = Y5 & (exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	7 (exists Y24 all X19 (r1(X19) & Y24 = X19 | X19 != Y24 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	8 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & Y3 = Y2)))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	9 (all X6 ((exists Y1 exists Y11 (X6 = Y11 & r2(Y1,Y11))) | (exists Y19 (r1(Y19) & Y19 = X6)))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | Y10 != Y20)))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	11 (all X11 exists Y21 all X12 (Y21 != X12 & -r2(X11,X12) | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	12 -(all Y1 ((all Y5 (Y5 != Y1 | -r1(Y5))) | (all Y2 ((all Y3 (-r3(Y3,Y2,Y1) | -r1(Y3))) | (all Y4 (-r2(Y4,Y2) | -r1(Y4))))))) # label(zeroplusoneidzero) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.03	
0.44/1.03	============================== end of process non-clausal formulas ===
0.44/1.03	
0.44/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.03	
0.44/1.03	============================== PREDICATE ELIMINATION =================
0.44/1.03	13 -r2(A,B) | -r1(C) | C != B # label(axiom_7a) # label(axiom).  [clausify(10)].
0.44/1.03	14 r1(c3) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	15 r1(c5) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	16 r1(c6) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	17 r1(f2(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
0.44/1.03	18 r1(f6(A)) # label(axiom_5a) # label(axiom).  [clausify(5)].
0.44/1.03	19 r1(f7(A)) # label(axiom_5a) # label(axiom).  [clausify(5)].
0.44/1.03	20 f17(A) = A | r1(f18(A)) # label(axiom_6a) # label(axiom).  [clausify(9)].
0.44/1.03	21 r2(f16(A),f17(A)) | r1(f18(A)) # label(axiom_6a) # label(axiom).  [clausify(9)].
0.44/1.03	Derived: -r2(A,B) | c3 != B.  [resolve(13,b,14,a)].
0.44/1.03	Derived: -r2(A,B) | c5 != B.  [resolve(13,b,15,a)].
0.44/1.03	Derived: -r2(A,B) | c6 != B.  [resolve(13,b,16,a)].
0.44/1.03	Derived: -r2(A,B) | f2(C) != B.  [resolve(13,b,17,a)].
0.44/1.03	Derived: -r2(A,B) | f6(C) != B.  [resolve(13,b,18,a)].
0.44/1.03	Derived: -r2(A,B) | f7(C) != B.  [resolve(13,b,19,a)].
0.44/1.03	Derived: -r2(A,B) | f18(C) != B | f17(C) = C.  [resolve(13,b,20,b)].
0.44/1.03	Derived: -r2(A,B) | f18(C) != B | r2(f16(C),f17(C)).  [resolve(13,b,21,b)].
0.44/1.03	22 r1(A) | A != c1 # label(axiom_1) # label(axiom).  [clausify(7)].
0.44/1.03	Derived: A != c1 | -r2(B,C) | A != C.  [resolve(22,a,13,b)].
0.44/1.03	23 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(7)].
0.44/1.03	Derived: c3 = c1.  [resolve(23,b,14,a)].
0.44/1.03	Derived: c5 = c1.  [resolve(23,b,15,a)].
0.44/1.03	Derived: c6 = c1.  [resolve(23,b,16,a)].
0.44/1.03	Derived: f2(A) = c1.  [resolve(23,b,17,a)].
0.44/1.03	Derived: f6(A) = c1.  [resolve(23,b,18,a)].
0.44/1.03	Derived: f7(A) = c1.  [resolve(23,b,19,a)].
0.44/1.03	Derived: f18(A) = c1 | f17(A) = A.  [resolve(23,b,20,b)].
0.44/1.03	Derived: f18(A) = c1 | r2(f16(A),f17(A)).  [resolve(23,b,21,b)].
0.44/1.03	24 A = f4(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(4)].
0.44/1.03	25 r3(c5,c4,c2) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	26 r3(A,f2(A),f1(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
0.44/1.03	27 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	28 r3(A,f11(A,B),f10(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	29 r3(f13(A,B),A,f12(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.44/1.03	Derived: c2 = f4(c5,c4).  [resolve(24,b,25,a)].
0.44/1.03	Derived: f1(A) = f4(A,f2(A)).  [resolve(24,b,26,a)].
0.44/1.03	Derived: f9(A,B) = f4(A,B).  [resolve(24,b,27,a)].
0.44/1.03	Derived: f10(A,B) = f4(A,f11(A,B)).  [resolve(24,b,28,a)].
0.44/1.03	Derived: f12(A,B) = f4(f13(A,B),A).  [resolve(24,b,29,a)].
0.44/1.03	30 r3(A,B,C) | C != f4(A,B) # label(axiom_3) # label(axiom).  [clausify(4)].
0.44/1.03	31 A = f3(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(3)].
0.44/1.03	32 r4(A,f7(A),f5(A)) # label(axiom_5a) # label(axiom).  [clausify(5)].
0.44/1.03	33 r4(A,B,f13(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.44/1.03	34 r4(A,f15(A,B),f14(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.44/1.03	Derived: f5(A) = f3(A,f7(A)).  [resolve(31,b,32,a)].
0.44/1.03	Derived: f13(A,B) = f3(A,B).  [resolve(31,b,33,a)].
0.44/1.03	Derived: f14(A,B) = f3(A,f15(A,B)).  [resolve(31,b,34,a)].
0.44/1.03	35 r4(A,B,C) | C != f3(A,B) # label(axiom_4) # label(axiom).  [clausify(3)].
0.44/1.03	
0.44/1.03	============================== end predicate elimination =============
0.44/1.03	
0.44/1.03	Auto_denials:  (non-Horn, no changes).
0.44/1.03	
0.44/1.03	Term ordering decisions:
0.44/1.03	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f3=1. f4=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f1=1. f2=1. f5=1. f6=1. f7=1. f16=1. f17=1. f18=1. f19=1.
0.44/1.03	
0.44/1.03	============================== end of process initial clauses ========
0.44/1.03	
0.44/1.03	============================== CLAUSES FOR SEARCH ====================
0.44/1.03	
0.44/1.03	============================== end of clauses for search =============
0.44/1.03	
0.44/1.03	============================== SEARCH ================================
0.44/1.03	
0.44/1.03	% Starting search at 0.01 seconds.
0.44/1.03	
0.44/1.03	============================== PROOF =================================
0.44/1.03	% SZS status Theorem
0.44/1.03	% SZS output start Refutation
0.44/1.03	
0.44/1.03	% Proof 1 at 0.02 (+ 0.00) seconds.
0.44/1.03	% Length of proof is 52.
0.44/1.03	% Level of proof is 7.
0.44/1.03	% Maximum clause weight is 9.000.
0.44/1.03	% Given clauses 64.
0.44/1.03	
0.44/1.03	2 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	4 (all X13 all X14 exists Y22 all X15 (Y22 = X15 & r3(X13,X14,X15) | X15 != Y22 & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	6 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (Y4 = Y5 & (exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	7 (exists Y24 all X19 (r1(X19) & Y24 = X19 | X19 != Y24 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | Y10 != Y20)))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	11 (all X11 exists Y21 all X12 (Y21 != X12 & -r2(X11,X12) | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	12 -(all Y1 ((all Y5 (Y5 != Y1 | -r1(Y5))) | (all Y2 ((all Y3 (-r3(Y3,Y2,Y1) | -r1(Y3))) | (all Y4 (-r2(Y4,Y2) | -r1(Y4))))))) # label(zeroplusoneidzero) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.03	13 -r2(A,B) | -r1(C) | C != B # label(axiom_7a) # label(axiom).  [clausify(10)].
0.44/1.03	14 r1(c3) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	15 r1(c5) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	16 r1(c6) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	17 r1(f2(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
0.44/1.03	23 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(7)].
0.44/1.03	24 A = f4(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(4)].
0.44/1.03	25 r3(c5,c4,c2) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	26 r3(A,f2(A),f1(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
0.44/1.03	27 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	28 r3(A,f11(A,B),f10(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	36 c2 = c3 # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	37 c3 = c2.  [copy(36),flip(a)].
0.44/1.03	38 r2(c6,c4) # label(zeroplusoneidzero) # label(negated_conjecture).  [clausify(12)].
0.44/1.03	39 f1(A) = A # label(axiom_4a) # label(axiom).  [clausify(2)].
0.44/1.03	41 r2(A,f11(B,A)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	43 r2(f9(A,B),f8(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	44 f10(A,B) = f8(A,B) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.44/1.03	50 -r2(A,B) | B = f19(A) # label(axiom_2) # label(axiom).  [clausify(11)].
0.44/1.03	51 -r2(A,B) | f19(A) = B.  [copy(50),flip(b)].
0.44/1.03	53 -r2(A,B) | c3 != B.  [resolve(13,b,14,a)].
0.44/1.03	54 -r2(A,B) | c2 != B.  [copy(53),rewrite([37(2)])].
0.44/1.03	65 c3 = c1.  [resolve(23,b,14,a)].
0.44/1.03	66 c2 = c1.  [copy(65),rewrite([37(1)])].
0.44/1.03	67 c5 = c1.  [resolve(23,b,15,a)].
0.44/1.03	68 c6 = c1.  [resolve(23,b,16,a)].
0.44/1.03	69 f2(A) = c1.  [resolve(23,b,17,a)].
0.44/1.03	75 c2 = f4(c5,c4).  [resolve(24,b,25,a)].
0.44/1.03	76 f4(c1,c4) = c1.  [copy(75),rewrite([66(1),67(2)]),flip(a)].
0.44/1.03	77 f1(A) = f4(A,f2(A)).  [resolve(24,b,26,a)].
0.44/1.03	78 f4(A,c1) = A.  [copy(77),rewrite([39(1),69(1)]),flip(a)].
0.44/1.03	79 f9(A,B) = f4(A,B).  [resolve(24,b,27,a)].
0.44/1.03	80 f10(A,B) = f4(A,f11(A,B)).  [resolve(24,b,28,a)].
0.44/1.03	81 f4(A,f11(A,B)) = f8(A,B).  [copy(80),rewrite([44(1)]),flip(a)].
0.44/1.03	89 -r2(A,B) | c1 != B.  [back_rewrite(54),rewrite([66(2)])].
0.44/1.03	91 r2(c1,c4).  [back_rewrite(38),rewrite([68(1)])].
0.44/1.03	93 r2(f4(A,B),f8(A,B)).  [back_rewrite(43),rewrite([79(1)])].
0.44/1.03	100 f11(A,B) = f19(B).  [resolve(51,a,41,a),flip(a)].
0.44/1.03	104 f4(A,f19(B)) = f8(A,B).  [back_rewrite(81),rewrite([100(1)])].
0.44/1.03	118 c4 != c1.  [resolve(91,a,89,a),flip(a)].
0.44/1.03	123 f19(c1) = c4.  [resolve(91,a,51,a)].
0.44/1.03	131 r2(A,f8(A,c1)).  [para(78(a,1),93(a,1))].
0.44/1.03	156 f8(A,c1) = f19(A).  [resolve(131,a,51,a),flip(a)].
0.44/1.03	189 f4(A,c4) = f19(A).  [para(123(a,1),104(a,1,2)),rewrite([156(4)])].
0.44/1.03	191 $F.  [back_rewrite(76),rewrite([189(3),123(2)]),unit_del(a,118)].
0.44/1.03	
0.44/1.03	% SZS output end Refutation
0.44/1.03	============================== end of proof ==========================
0.44/1.03	
0.44/1.03	============================== STATISTICS ============================
0.44/1.03	
0.44/1.03	Given=64. Generated=832. Kept=142. proofs=1.
0.44/1.03	Usable=58. Sos=50. Demods=27. Limbo=2, Disabled=94. Hints=0.
0.44/1.03	Megabytes=0.19.
0.44/1.03	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.44/1.03	
0.44/1.03	============================== end of statistics =====================
0.44/1.03	
0.44/1.03	============================== end of search =========================
0.44/1.03	
0.44/1.03	THEOREM PROVED
0.44/1.03	% SZS status Theorem
0.44/1.03	
0.44/1.03	Exiting with 1 proof.
0.44/1.03	
0.44/1.03	Process 15632 exit (max_proofs) Tue Jul 13 16:52:11 2021
0.44/1.03	Prover9 interrupted
0.44/1.04	EOF