0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n003.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 09:11:47 EDT 2019
0.12/0.33	% CPUTime    : 
0.77/1.03	============================== Prover9 ===============================
0.77/1.03	Prover9 (32) version 2009-11A, November 2009.
0.77/1.03	Process 29275 was started by sandbox2 on n003.cluster.edu,
0.77/1.03	Thu Aug 29 09:11:47 2019
0.77/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_29122_n003.cluster.edu".
0.77/1.03	============================== end of head ===========================
0.77/1.03	
0.77/1.03	============================== INPUT =================================
0.77/1.03	
0.77/1.03	% Reading from file /tmp/Prover9_29122_n003.cluster.edu
0.77/1.03	
0.77/1.03	set(prolog_style_variables).
0.77/1.03	set(auto2).
0.77/1.03	    % set(auto2) -> set(auto).
0.77/1.03	    % set(auto) -> set(auto_inference).
0.77/1.03	    % set(auto) -> set(auto_setup).
0.77/1.03	    % set(auto_setup) -> set(predicate_elim).
0.77/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.03	    % set(auto) -> set(auto_limits).
0.77/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.03	    % set(auto) -> set(auto_denials).
0.77/1.03	    % set(auto) -> set(auto_process).
0.77/1.03	    % set(auto2) -> assign(new_constants, 1).
0.77/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.03	    % set(auto2) -> assign(max_hours, 1).
0.77/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.03	    % set(auto2) -> set(sort_initial_sos).
0.77/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.03	    % set(auto2) -> assign(max_megs, 400).
0.77/1.03	    % set(auto2) -> assign(stats, some).
0.77/1.03	    % set(auto2) -> clear(echo_input).
0.77/1.03	    % set(auto2) -> set(quiet).
0.77/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.03	    % set(auto2) -> clear(print_given).
0.77/1.03	assign(lrs_ticks,-1).
0.77/1.03	assign(sos_limit,10000).
0.77/1.03	assign(order,kbo).
0.77/1.03	set(lex_order_vars).
0.77/1.03	clear(print_given).
0.77/1.03	
0.77/1.03	% formulas(sos).  % not echoed (12 formulas)
0.77/1.03	
0.77/1.03	============================== end of input ==========================
0.77/1.03	
0.77/1.03	% From the command line: assign(max_seconds, 180).
0.77/1.03	
0.77/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.03	
0.77/1.03	% Formulas that are not ordinary clauses:
0.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/1.03	12 -(exists Y1 ((exists Y2 (r4(Y2,Y2,Y1) & (exists Y4 (r2(Y4,Y2) & r1(Y4))))) & (exists Y3 (Y3 = Y1 & (exists Y5 (r2(Y5,Y3) & r1(Y5))))))) # label(onetimesoneeqone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.06	
0.77/1.06	============================== end of process non-clausal formulas ===
0.77/1.06	
0.77/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.06	
0.77/1.06	============================== PREDICATE ELIMINATION =================
0.77/1.06	13 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
0.77/1.06	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.77/1.06	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	18 r3(A,B,C) | C != f14(A,B) # label(axiom_3) # label(axiom).  [clausify(6)].
0.77/1.06	Derived: f2(A,B) = f14(A,B).  [resolve(13,b,14,a)].
0.77/1.06	Derived: f18(A) = f14(A,f19(A)).  [resolve(13,b,15,a)].
0.77/1.06	Derived: f3(A,B) = f14(A,f4(A,B)).  [resolve(13,b,16,a)].
0.77/1.06	Derived: f9(A,B) = f14(f10(A,B),A).  [resolve(13,b,17,a)].
0.77/1.06	
0.77/1.06	============================== end predicate elimination =============
0.77/1.06	
0.77/1.06	Auto_denials:  (non-Horn, no changes).
0.77/1.06	
0.77/1.06	Term ordering decisions:
0.77/1.06	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.
0.77/1.06	
0.77/1.06	============================== end of process initial clauses ========
0.77/1.06	
0.77/1.06	============================== CLAUSES FOR SEARCH ====================
0.77/1.06	
0.77/1.06	============================== end of clauses for search =============
0.77/1.06	
0.77/1.06	============================== SEARCH ================================
0.77/1.06	
0.77/1.06	% Starting search at 0.01 seconds.
0.77/1.06	
0.77/1.06	============================== PROOF =================================
0.77/1.06	% SZS status Theorem
0.77/1.06	% SZS output start Refutation
0.77/1.06	
0.77/1.06	% Proof 1 at 0.04 (+ 0.00) seconds.
0.77/1.06	% Length of proof is 63.
0.77/1.06	% Level of proof is 7.
0.77/1.06	% Maximum clause weight is 17.000.
0.77/1.06	% Given clauses 82.
0.77/1.06	
0.77/1.06	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.77/1.06	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.77/1.06	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.77/1.06	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.77/1.06	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.77/1.06	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	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.77/1.06	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.77/1.06	12 -(exists Y1 ((exists Y2 (r4(Y2,Y2,Y1) & (exists Y4 (r2(Y4,Y2) & r1(Y4))))) & (exists Y3 (Y3 = Y1 & (exists Y5 (r2(Y5,Y3) & r1(Y5))))))) # label(onetimesoneeqone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.06	13 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
0.77/1.06	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.77/1.06	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	19 r1(f16(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
0.77/1.06	20 r1(f17(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
0.77/1.06	21 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.77/1.06	22 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
0.77/1.06	23 r2(A,f4(B,A)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	24 r2(A,f12(B,A)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	25 f17(A) = f15(A) # label(axiom_5a) # label(axiom).  [clausify(10)].
0.77/1.06	26 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	27 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
0.77/1.06	28 r2(f2(A,B),f1(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	29 f3(A,B) = f1(A,B) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.77/1.06	31 f11(A,B) = f9(A,B) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	34 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.77/1.06	35 r4(A,f12(A,B),f9(A,B)).  [copy(34),rewrite([31(2)])].
0.77/1.06	38 -r4(A,A,B) | -r2(C,A) | -r1(C) | D != B | -r2(E,D) | -r1(E) # label(onetimesoneeqone) # label(negated_conjecture).  [clausify(12)].
0.77/1.06	39 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(8)].
0.77/1.06	40 c1 = A | -r1(A).  [copy(39),flip(a)].
0.77/1.06	43 -r2(A,B) | B = f13(A) # label(axiom_2) # label(axiom).  [clausify(5)].
0.77/1.06	44 -r2(A,B) | f13(A) = B.  [copy(43),flip(b)].
0.77/1.06	47 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
0.77/1.06	48 f5(A,B) = C | -r4(A,B,C).  [copy(47),flip(a)].
0.77/1.06	52 f2(A,B) = f14(A,B).  [resolve(13,b,14,a)].
0.77/1.06	53 f18(A) = f14(A,f19(A)).  [resolve(13,b,15,a)].
0.77/1.06	54 f14(A,f19(A)) = A.  [copy(53),rewrite([22(1)]),flip(a)].
0.77/1.06	55 f3(A,B) = f14(A,f4(A,B)).  [resolve(13,b,16,a)].
0.77/1.06	56 f14(A,f4(A,B)) = f1(A,B).  [copy(55),rewrite([29(1)]),flip(a)].
0.77/1.06	57 f9(A,B) = f14(f10(A,B),A).  [resolve(13,b,17,a)].
0.77/1.06	58 r1(f15(A)).  [back_rewrite(20),rewrite([25(1)])].
0.77/1.06	60 -r4(A,A,B) | -r2(C,A) | -r1(C) | D != B | -r2(C,D).  [factor(38,c,f)].
0.77/1.06	61 r2(f14(A,B),f1(A,B)).  [back_rewrite(28),rewrite([52(1)])].
0.77/1.06	62 r4(A,f12(A,B),f14(f10(A,B),A)).  [back_rewrite(35),rewrite([57(2)])].
0.77/1.06	121 f19(A) = c1.  [resolve(40,b,21,a),flip(a)].
0.77/1.06	122 f16(A) = c1.  [resolve(40,b,19,a),flip(a)].
0.77/1.06	136 f14(A,c1) = A.  [back_rewrite(54),rewrite([121(1)])].
0.77/1.06	137 r1(c1).  [back_rewrite(21),rewrite([121(1)])].
0.77/1.06	138 r4(A,c1,f15(A)).  [back_rewrite(27),rewrite([122(1)])].
0.77/1.06	141 f12(A,B) = f13(B).  [resolve(44,a,24,a),flip(a)].
0.77/1.06	142 f4(A,B) = f13(B).  [resolve(44,a,23,a),flip(a)].
0.77/1.06	149 r4(A,f13(B),f14(f10(A,B),A)).  [back_rewrite(62),rewrite([141(1)])].
0.77/1.06	150 r2(A,f13(A)).  [back_rewrite(24),rewrite([141(1)])].
0.77/1.06	151 f14(A,f13(B)) = f1(A,B).  [back_rewrite(56),rewrite([142(1)])].
0.77/1.06	153 f10(A,B) = f5(A,B).  [resolve(48,b,26,a),flip(a)].
0.77/1.06	154 r4(A,f13(B),f14(f5(A,B),A)).  [back_rewrite(149),rewrite([153(2)])].
0.77/1.06	166 f15(A) = c1.  [resolve(58,a,40,b),flip(a)].
0.77/1.06	167 r4(A,c1,c1).  [back_rewrite(138),rewrite([166(2)])].
0.77/1.06	190 f5(A,c1) = c1.  [resolve(167,a,48,b)].
0.77/1.06	191 r2(A,f1(A,c1)).  [para(136(a,1),61(a,1))].
0.77/1.06	201 f1(A,c1) = f13(A).  [resolve(191,a,44,a),flip(a)].
0.77/1.06	259 $F.  [ur(60,a,154,a,b,150,a,c,137,a,e,150,a),rewrite([190(6),151(6),201(5)]),xx(a)].
0.77/1.06	
0.77/1.06	% SZS output end Refutation
0.77/1.06	============================== end of proof ==========================
0.77/1.06	
0.77/1.06	============================== STATISTICS ============================
0.77/1.06	
0.77/1.06	Given=82. Generated=858. Kept=231. proofs=1.
0.77/1.06	Usable=68. Sos=61. Demods=22. Limbo=4, Disabled=134. Hints=0.
0.77/1.06	Megabytes=0.25.
0.77/1.06	User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
0.77/1.06	
0.77/1.06	============================== end of statistics =====================
0.77/1.06	
0.77/1.06	============================== end of search =========================
0.77/1.06	
0.77/1.06	THEOREM PROVED
0.77/1.06	% SZS status Theorem
0.77/1.06	
0.77/1.06	Exiting with 1 proof.
0.77/1.06	
0.77/1.06	Process 29275 exit (max_proofs) Thu Aug 29 09:11:48 2019
0.77/1.06	Prover9 interrupted
0.77/1.06	EOF