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.12/0.34	% Computer   : n027.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 11:34:39 EDT 2019
0.12/0.34	% CPUTime    : 
0.74/1.03	============================== Prover9 ===============================
0.74/1.03	Prover9 (32) version 2009-11A, November 2009.
0.74/1.03	Process 1831 was started by sandbox2 on n027.cluster.edu,
0.74/1.03	Thu Aug 29 11:34:40 2019
0.74/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_1661_n027.cluster.edu".
0.74/1.03	============================== end of head ===========================
0.74/1.03	
0.74/1.03	============================== INPUT =================================
0.74/1.03	
0.74/1.03	% Reading from file /tmp/Prover9_1661_n027.cluster.edu
0.74/1.03	
0.74/1.03	set(prolog_style_variables).
0.74/1.03	set(auto2).
0.74/1.03	    % set(auto2) -> set(auto).
0.74/1.03	    % set(auto) -> set(auto_inference).
0.74/1.03	    % set(auto) -> set(auto_setup).
0.74/1.03	    % set(auto_setup) -> set(predicate_elim).
0.74/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.03	    % set(auto) -> set(auto_limits).
0.74/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.03	    % set(auto) -> set(auto_denials).
0.74/1.03	    % set(auto) -> set(auto_process).
0.74/1.03	    % set(auto2) -> assign(new_constants, 1).
0.74/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.03	    % set(auto2) -> assign(max_hours, 1).
0.74/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.03	    % set(auto2) -> set(sort_initial_sos).
0.74/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.03	    % set(auto2) -> assign(max_megs, 400).
0.74/1.03	    % set(auto2) -> assign(stats, some).
0.74/1.03	    % set(auto2) -> clear(echo_input).
0.74/1.03	    % set(auto2) -> set(quiet).
0.74/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.03	    % set(auto2) -> clear(print_given).
0.74/1.03	assign(lrs_ticks,-1).
0.74/1.03	assign(sos_limit,10000).
0.74/1.03	assign(order,kbo).
0.74/1.03	set(lex_order_vars).
0.74/1.03	clear(print_given).
0.74/1.03	
0.74/1.03	% formulas(sos).  % not echoed (12 formulas)
0.74/1.03	
0.74/1.03	============================== end of input ==========================
0.74/1.03	
0.74/1.03	% From the command line: assign(max_seconds, 180).
0.74/1.03	
0.74/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.03	
0.74/1.03	% Formulas that are not ordinary clauses:
0.74/1.03	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y4 = Y5)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	2 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	3 (all X6 ((exists Y1 exists Y11 (X6 = Y11 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	5 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | X12 = Y21 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	6 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | -r3(X13,X14,X15) & X15 != Y22)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	7 (all X3 all X10 (X3 = X10 | (all Y12 ((all Y13 (Y13 != Y12 | -r2(X3,Y13))) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	9 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	10 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	12 -(exists Y1 ((exists Y2 ((exists Y3 ((exists Y4 (r2(Y4,Y3) & (exists Y6 (r2(Y6,Y4) & (exists Y8 (r1(Y8) & r2(Y8,Y6))))))) & r2(Y3,Y2))) & Y2 = Y1)) & (exists Y5 (r3(Y5,Y5,Y1) & (exists Y7 (r2(Y7,Y5) & (exists Y9 (r2(Y9,Y7) & r1(Y9))))))))) # label(twoplustwoeqfour) # label(negated_conjecture) # label(non_clause).  [assumption].
1.29/1.62	
1.29/1.62	============================== end of process non-clausal formulas ===
1.29/1.62	
1.29/1.62	============================== PROCESS INITIAL CLAUSES ===============
1.29/1.62	
1.29/1.62	============================== PREDICATE ELIMINATION =================
1.29/1.62	13 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
1.29/1.62	14 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.29/1.62	15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.29/1.62	16 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.29/1.62	Derived: f10(A,B) = f5(A,B).  [resolve(13,b,14,a)].
1.29/1.62	Derived: f15(A) = f5(A,f16(A)).  [resolve(13,b,15,a)].
1.29/1.62	Derived: f11(A,B) = f5(A,f12(A,B)).  [resolve(13,b,16,a)].
1.29/1.62	17 r4(A,B,C) | C != f5(A,B) # label(axiom_4) # label(axiom).  [clausify(2)].
1.29/1.62	
1.29/1.62	============================== end predicate elimination =============
1.29/1.62	
1.29/1.62	Auto_denials:  (non-Horn, no changes).
1.29/1.62	
1.29/1.62	Term ordering decisions:
1.29/1.62	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f9=1. f10=1. f11=1. f12=1. f14=1. f6=1. f7=1. f8=1. f13=1. f15=1. f16=1. f17=1. f18=1. f19=1.
1.29/1.62	
1.29/1.62	============================== end of process initial clauses ========
1.29/1.62	
1.29/1.62	============================== CLAUSES FOR SEARCH ====================
1.29/1.62	
1.29/1.62	============================== end of clauses for search =============
1.29/1.62	
1.29/1.62	============================== SEARCH ================================
1.29/1.62	
1.29/1.62	% Starting search at 0.07 seconds.
1.29/1.62	
1.29/1.62	============================== PROOF =================================
1.29/1.62	% SZS status Theorem
1.29/1.62	% SZS output start Refutation
1.29/1.62	
1.29/1.62	% Proof 1 at 0.59 (+ 0.01) seconds.
1.29/1.62	% Length of proof is 42.
1.29/1.62	% Level of proof is 7.
1.29/1.62	% Maximum clause weight is 29.000.
1.29/1.62	% Given clauses 192.
1.29/1.62	
1.29/1.62	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y4 = Y5)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	5 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | X12 = Y21 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	6 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | -r3(X13,X14,X15) & X15 != Y22)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.29/1.62	12 -(exists Y1 ((exists Y2 ((exists Y3 ((exists Y4 (r2(Y4,Y3) & (exists Y6 (r2(Y6,Y4) & (exists Y8 (r1(Y8) & r2(Y8,Y6))))))) & r2(Y3,Y2))) & Y2 = Y1)) & (exists Y5 (r3(Y5,Y5,Y1) & (exists Y7 (r2(Y7,Y5) & (exists Y9 (r2(Y9,Y7) & r1(Y9))))))))) # label(twoplustwoeqfour) # label(negated_conjecture) # label(non_clause).  [assumption].
1.29/1.62	20 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.29/1.62	21 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
1.29/1.62	22 r2(A,f4(B,A)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.29/1.62	23 r2(A,f12(B,A)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.29/1.62	25 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.29/1.62	26 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.29/1.62	27 r3(A,f19(A),A).  [copy(26),rewrite([21(2)])].
1.29/1.62	28 r2(f2(A,B),f1(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.29/1.62	29 f3(A,B) = f1(A,B) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.29/1.62	32 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.29/1.62	33 r3(A,f4(A,B),f1(A,B)).  [copy(32),rewrite([29(2)])].
1.29/1.62	39 -r2(A,B) | -r2(C,A) | -r1(D) | -r2(D,C) | -r2(B,E) | E != F | -r3(V6,V6,F) | -r2(V7,V6) | -r2(V8,V7) | -r1(V8) # label(twoplustwoeqfour) # label(negated_conjecture).  [clausify(12)].
1.29/1.62	40 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(8)].
1.29/1.62	41 c1 = A | -r1(A).  [copy(40),flip(a)].
1.29/1.62	44 -r2(A,B) | B = f13(A) # label(axiom_2) # label(axiom).  [clausify(5)].
1.29/1.62	45 -r2(A,B) | f13(A) = B.  [copy(44),flip(b)].
1.29/1.62	50 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
1.29/1.62	51 f14(A,B) = C | -r3(A,B,C).  [copy(50),flip(a)].
1.29/1.62	65 -r2(A,B) | -r2(C,A) | -r1(D) | -r2(D,C) | -r2(B,E) | E != F | -r3(A,A,F) | -r2(V6,C) | -r1(V6).  [factor(39,b,h)].
1.29/1.62	118 -r2(A,B) | -r2(C,A) | -r1(D) | -r2(D,C) | -r2(B,E) | E != F | -r3(A,A,F).  [factor(65,c,i),merge(h)].
1.29/1.62	949 f19(A) = c1.  [resolve(41,b,20,a),flip(a)].
1.29/1.62	1115 r3(A,c1,A).  [back_rewrite(27),rewrite([949(1)])].
1.29/1.62	1116 r1(c1).  [back_rewrite(20),rewrite([949(1)])].
1.29/1.62	1123 f12(A,B) = f13(B).  [resolve(45,a,23,a),flip(a)].
1.29/1.62	1124 f4(A,B) = f13(B).  [resolve(45,a,22,a),flip(a)].
1.29/1.62	1132 r2(A,f13(A)).  [back_rewrite(23),rewrite([1123(1)])].
1.29/1.62	1133 r3(A,f13(B),f1(A,B)).  [back_rewrite(33),rewrite([1124(1)])].
1.29/1.62	1137 f14(A,B) = f2(A,B).  [resolve(51,b,25,a)].
1.29/1.62	1139 f2(A,B) = C | -r3(A,B,C).  [back_rewrite(51),rewrite([1137(1)])].
1.29/1.62	2222 -r2(f13(f13(c1)),f2(f13(f13(c1)),f13(c1))).  [ur(118,b,1132,a,c,1116,a,d,1132,a,e,28,a,f,xx,g,1133,a)].
1.29/1.62	2279 f2(A,f13(B)) = f1(A,B).  [resolve(1139,b,1133,a)].
1.29/1.62	2280 f2(A,c1) = A.  [resolve(1139,b,1115,a)].
1.29/1.62	2283 -r2(f13(f13(c1)),f1(f13(f13(c1)),c1)).  [back_rewrite(2222),rewrite([2279(9)])].
1.29/1.62	2329 r2(A,f1(A,c1)).  [para(2280(a,1),28(a,1))].
1.29/1.62	2330 $F.  [resolve(2329,a,2283,a)].
1.29/1.62	
1.29/1.62	% SZS output end Refutation
1.29/1.62	============================== end of proof ==========================
1.29/1.62	
1.29/1.62	============================== STATISTICS ============================
1.29/1.62	
1.29/1.62	Given=192. Generated=9689. Kept=2303. proofs=1.
1.29/1.62	Usable=181. Sos=1168. Demods=21. Limbo=0, Disabled=988. Hints=0.
1.29/1.62	Megabytes=1.75.
1.29/1.62	User_CPU=0.59, System_CPU=0.01, Wall_clock=0.
1.29/1.62	
1.29/1.62	============================== end of statistics =====================
1.29/1.62	
1.29/1.62	============================== end of search =========================
1.29/1.62	
1.29/1.62	THEOREM PROVED
1.29/1.62	% SZS status Theorem
1.29/1.62	
1.29/1.62	Exiting with 1 proof.
1.29/1.62	
1.29/1.62	Process 1831 exit (max_proofs) Thu Aug 29 11:34:40 2019
1.29/1.62	Prover9 interrupted
1.29/1.62	EOF