0.06/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer : n020.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit : 960
0.11/0.32	% WCLimit  : 120
0.11/0.32	% DateTime : Tue Aug  9 04:04:05 EDT 2022
0.11/0.32	% CPUTime  : 
0.35/0.85	============================== Prover9 ===============================
0.35/0.85	Prover9 (32) version 2009-11A, November 2009.
0.35/0.85	Process 17016 was started by sandbox2 on n020.cluster.edu,
0.35/0.85	Tue Aug  9 04:04:05 2022
0.35/0.85	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_16862_n020.cluster.edu".
0.35/0.85	============================== end of head ===========================
0.35/0.85	
0.35/0.85	============================== INPUT =================================
0.35/0.85	
0.35/0.85	% Reading from file /tmp/Prover9_16862_n020.cluster.edu
0.35/0.85	
0.35/0.85	set(prolog_style_variables).
0.35/0.85	set(auto2).
0.35/0.85	    % set(auto2) -> set(auto).
0.35/0.85	    % set(auto) -> set(auto_inference).
0.35/0.85	    % set(auto) -> set(auto_setup).
0.35/0.85	    % set(auto_setup) -> set(predicate_elim).
0.35/0.85	    % set(auto_setup) -> assign(eq_defs, unfold).
0.35/0.85	    % set(auto) -> set(auto_limits).
0.35/0.85	    % set(auto_limits) -> assign(max_weight, "100.000").
0.35/0.85	    % set(auto_limits) -> assign(sos_limit, 20000).
0.35/0.85	    % set(auto) -> set(auto_denials).
0.35/0.85	    % set(auto) -> set(auto_process).
0.35/0.85	    % set(auto2) -> assign(new_constants, 1).
0.35/0.85	    % set(auto2) -> assign(fold_denial_max, 3).
0.35/0.85	    % set(auto2) -> assign(max_weight, "200.000").
0.35/0.85	    % set(auto2) -> assign(max_hours, 1).
0.35/0.85	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.35/0.85	    % set(auto2) -> assign(max_seconds, 0).
0.35/0.85	    % set(auto2) -> assign(max_minutes, 5).
0.35/0.85	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.35/0.85	    % set(auto2) -> set(sort_initial_sos).
0.35/0.85	    % set(auto2) -> assign(sos_limit, -1).
0.35/0.85	    % set(auto2) -> assign(lrs_ticks, 3000).
0.35/0.85	    % set(auto2) -> assign(max_megs, 400).
0.35/0.85	    % set(auto2) -> assign(stats, some).
0.35/0.85	    % set(auto2) -> clear(echo_input).
0.35/0.85	    % set(auto2) -> set(quiet).
0.35/0.85	    % set(auto2) -> clear(print_initial_clauses).
0.35/0.85	    % set(auto2) -> clear(print_given).
0.35/0.85	assign(lrs_ticks,-1).
0.35/0.85	assign(sos_limit,10000).
0.35/0.85	assign(order,kbo).
0.35/0.85	set(lex_order_vars).
0.35/0.85	clear(print_given).
0.35/0.85	
0.35/0.85	% formulas(sos).  % not echoed (12 formulas)
0.35/0.85	
0.35/0.85	============================== end of input ==========================
0.35/0.85	
0.35/0.85	% From the command line: assign(max_seconds, 960).
0.35/0.85	
0.35/0.85	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.35/0.85	
0.35/0.85	% Formulas that are not ordinary clauses:
0.35/0.85	1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y2 = Y3)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	4 (all X16 all X17 exists Y23 all X18 (X18 != Y23 & -r4(X16,X17,X18) | Y23 = X18 & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	6 (all X3 all X10 (X10 = X3 | (all Y12 ((all Y13 (-r2(X3,Y13) | Y12 != Y13)) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	7 (all X6 ((exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	8 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	9 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y18 = Y8)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.35/0.85	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.35/0.85	12 -(exists Y1 ((exists Y2 ((exists Y3 (r2(Y3,Y2) & (exists Y4 (r2(Y4,Y3) & (exists Y6 (r2(Y6,Y4) & (exists Y8 (r2(Y8,Y6) & r1(Y8))))))))) & Y1 = Y2)) & (exists Y5 ((exists Y7 ((exists Y9 (r1(Y9) & r2(Y9,Y7))) & r2(Y7,Y5))) & r3(Y5,Y5,Y1))))) # label(twoplustwoeqfour) # label(negated_conjecture) # label(non_clause).  [assumption].
0.97/1.32	
0.97/1.32	============================== end of process non-clausal formulas ===
0.97/1.32	
0.97/1.32	============================== PROCESS INITIAL CLAUSES ===============
0.97/1.32	
0.97/1.32	============================== PREDICATE ELIMINATION =================
0.97/1.32	13 -r4(A,B,C) | C = f10(A,B) # label(axiom_4) # label(axiom).  [clausify(4)].
0.97/1.32	14 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
0.97/1.32	15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
0.97/1.32	16 r4(A,f4(A,B),f3(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
0.97/1.32	17 A != f10(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(4)].
0.97/1.32	Derived: f5(A,B) = f10(A,B).  [resolve(13,a,14,a)].
0.97/1.32	Derived: f15(A) = f10(A,f16(A)).  [resolve(13,a,15,a)].
0.97/1.32	Derived: f3(A,B) = f10(A,f4(A,B)).  [resolve(13,a,16,a)].
0.97/1.32	
0.97/1.32	============================== end predicate elimination =============
0.97/1.32	
0.97/1.32	Auto_denials:  (non-Horn, no changes).
0.97/1.32	
0.97/1.32	Term ordering decisions:
0.97/1.32	Function symbol KB weights:  c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f14=1. f1=1. f11=1. f12=1. f13=1. f15=1. f16=1. f17=1. f18=1. f19=1.
0.97/1.32	
0.97/1.32	============================== end of process initial clauses ========
0.97/1.32	
0.97/1.32	============================== CLAUSES FOR SEARCH ====================
0.97/1.32	
0.97/1.32	============================== end of clauses for search =============
0.97/1.32	
0.97/1.32	============================== SEARCH ================================
0.97/1.32	
0.97/1.32	% Starting search at 0.08 seconds.
0.97/1.32	
0.97/1.32	============================== PROOF =================================
0.97/1.32	% SZS status Theorem
0.97/1.32	% SZS output start Refutation
0.97/1.32	
0.97/1.32	% Proof 1 at 0.48 (+ 0.01) seconds.
0.97/1.32	% Length of proof is 39.
0.97/1.32	% Level of proof is 7.
0.97/1.32	% Maximum clause weight is 29.000.
0.97/1.32	% Given clauses 192.
0.97/1.32	
0.97/1.32	1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.97/1.32	3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.97/1.32	8 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.97/1.32	10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.32	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.97/1.32	12 -(exists Y1 ((exists Y2 ((exists Y3 (r2(Y3,Y2) & (exists Y4 (r2(Y4,Y3) & (exists Y6 (r2(Y6,Y4) & (exists Y8 (r2(Y8,Y6) & r1(Y8))))))))) & Y1 = Y2)) & (exists Y5 ((exists Y7 ((exists Y9 (r1(Y9) & r2(Y9,Y7))) & r2(Y7,Y5))) & r3(Y5,Y5,Y1))))) # label(twoplustwoeqfour) # label(negated_conjecture) # label(non_clause).  [assumption].
0.97/1.32	20 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.97/1.32	21 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
0.97/1.32	23 r2(A,f8(B,A)) # label(axiom_1a) # label(axiom).  [clausify(3)].
0.97/1.32	25 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
0.97/1.32	26 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.97/1.32	27 r3(A,f19(A),A).  [copy(26),rewrite([21(2)])].
0.97/1.32	29 f7(A,B) = f6(A,B) # label(axiom_1a) # label(axiom).  [clausify(3)].
0.97/1.32	30 r2(f9(A,B),f6(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
0.97/1.32	33 r3(A,f8(A,B),f7(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
0.97/1.32	34 r3(A,f8(A,B),f6(A,B)).  [copy(33),rewrite([29(2)])].
0.97/1.32	39 -r2(A,B) | -r2(C,A) | -r2(D,C) | -r2(E,D) | -r1(E) | F != B | -r1(V6) | -r2(V6,V7) | -r2(V7,V8) | -r3(V8,V8,F) # label(twoplustwoeqfour) # label(negated_conjecture).  [clausify(12)].
0.97/1.32	40 -r1(A) | A = c1 # label(axiom_1) # label(axiom).  [clausify(10)].
0.97/1.32	41 -r1(A) | c1 = A.  [copy(40),flip(b)].
0.97/1.32	44 -r2(A,B) | B = f1(A) # label(axiom_2) # label(axiom).  [clausify(1)].
0.97/1.32	45 -r2(A,B) | f1(A) = B.  [copy(44),flip(b)].
0.97/1.32	48 -r3(A,B,C) | C = f14(A,B) # label(axiom_3) # label(axiom).  [clausify(8)].
0.97/1.32	49 -r3(A,B,C) | f14(A,B) = C.  [copy(48),flip(b)].
0.97/1.32	69 -r2(A,B) | -r2(C,A) | -r2(D,C) | -r2(E,D) | -r1(E) | F != B | -r1(V6) | -r2(V6,D) | -r3(C,C,F).  [factor(39,c,i)].
0.97/1.32	131 -r2(A,B) | -r2(C,A) | -r2(D,C) | -r2(E,D) | -r1(E) | F != B | -r3(C,C,F).  [factor(69,d,h),merge(g)].
0.97/1.32	957 f19(A) = c1.  [resolve(41,a,20,a),flip(a)].
0.97/1.32	1123 r3(A,c1,A).  [back_rewrite(27),rewrite([957(1)])].
0.97/1.32	1124 r1(c1).  [back_rewrite(20),rewrite([957(1)])].
0.97/1.32	1131 f8(A,B) = f1(B).  [resolve(45,a,23,a),flip(a)].
0.97/1.32	1139 r3(A,f1(B),f6(A,B)).  [back_rewrite(34),rewrite([1131(1)])].
0.97/1.32	1140 r2(A,f1(A)).  [back_rewrite(23),rewrite([1131(1)])].
0.97/1.32	1143 f14(A,B) = f9(A,B).  [resolve(49,a,25,a)].
0.97/1.32	1145 -r3(A,B,C) | f9(A,B) = C.  [back_rewrite(49),rewrite([1143(2)])].
0.97/1.32	2222 -r2(f1(f1(c1)),f9(f1(f1(c1)),f1(c1))).  [ur(131,a,30,a,c,1140,a,d,1140,a,e,1124,a,f,xx,g,1139,a)].
0.97/1.32	2316 f9(A,f1(B)) = f6(A,B).  [resolve(1145,a,1139,a)].
0.97/1.32	2317 f9(A,c1) = A.  [resolve(1145,a,1123,a)].
0.97/1.32	2320 -r2(f1(f1(c1)),f6(f1(f1(c1)),c1)).  [back_rewrite(2222),rewrite([2316(9)])].
0.97/1.32	2366 r2(A,f6(A,c1)).  [para(2317(a,1),30(a,1))].
0.97/1.32	2367 $F.  [resolve(2366,a,2320,a)].
0.97/1.32	
0.97/1.32	% SZS output end Refutation
0.97/1.32	============================== end of proof ==========================
0.97/1.32	
0.97/1.32	============================== STATISTICS ============================
0.97/1.32	
0.97/1.32	Given=192. Generated=9826. Kept=2340. proofs=1.
0.97/1.32	Usable=183. Sos=1203. Demods=21. Limbo=0, Disabled=988. Hints=0.
0.97/1.32	Megabytes=1.76.
0.97/1.32	User_CPU=0.48, System_CPU=0.01, Wall_clock=1.
0.97/1.32	
0.97/1.32	============================== end of statistics =====================
0.97/1.32	
0.97/1.32	============================== end of search =========================
0.97/1.32	
0.97/1.32	THEOREM PROVED
0.97/1.32	% SZS status Theorem
0.97/1.32	
0.97/1.32	Exiting with 1 proof.
0.97/1.32	
0.97/1.32	Process 17016 exit (max_proofs) Tue Aug  9 04:04:06 2022
0.97/1.32	Prover9 interrupted
0.97/1.32	EOF