0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer   : n009.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% DateTime   : Thu Jul  2 07:15:51 EDT 2020
0.09/0.30	% CPUTime    : 
0.69/1.01	============================== Prover9 ===============================
0.69/1.01	Prover9 (32) version 2009-11A, November 2009.
0.69/1.01	Process 12235 was started by sandbox2 on n009.cluster.edu,
0.69/1.01	Thu Jul  2 07:15:52 2020
0.69/1.01	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_12080_n009.cluster.edu".
0.69/1.01	============================== end of head ===========================
0.69/1.01	
0.69/1.01	============================== INPUT =================================
0.69/1.01	
0.69/1.01	% Reading from file /tmp/Prover9_12080_n009.cluster.edu
0.69/1.01	
0.69/1.01	set(prolog_style_variables).
0.69/1.01	set(auto2).
0.69/1.01	    % set(auto2) -> set(auto).
0.69/1.01	    % set(auto) -> set(auto_inference).
0.69/1.01	    % set(auto) -> set(auto_setup).
0.69/1.01	    % set(auto_setup) -> set(predicate_elim).
0.69/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/1.01	    % set(auto) -> set(auto_limits).
0.69/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/1.01	    % set(auto) -> set(auto_denials).
0.69/1.01	    % set(auto) -> set(auto_process).
0.69/1.01	    % set(auto2) -> assign(new_constants, 1).
0.69/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.69/1.01	    % set(auto2) -> assign(max_hours, 1).
0.69/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.69/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.69/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/1.01	    % set(auto2) -> set(sort_initial_sos).
0.69/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.69/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/1.01	    % set(auto2) -> assign(max_megs, 400).
0.69/1.01	    % set(auto2) -> assign(stats, some).
0.69/1.01	    % set(auto2) -> clear(echo_input).
0.69/1.01	    % set(auto2) -> set(quiet).
0.69/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.69/1.01	    % set(auto2) -> clear(print_given).
0.69/1.01	assign(lrs_ticks,-1).
0.69/1.01	assign(sos_limit,10000).
0.69/1.01	assign(order,kbo).
0.69/1.01	set(lex_order_vars).
0.69/1.01	clear(print_given).
0.69/1.01	
0.69/1.01	% formulas(sos).  % not echoed (12 formulas)
0.69/1.01	
0.69/1.01	============================== end of input ==========================
0.69/1.01	
0.69/1.01	% From the command line: assign(max_seconds, 960).
0.69/1.01	
0.69/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/1.01	
0.69/1.01	% Formulas that are not ordinary clauses:
0.69/1.01	1 (all X16 all X17 exists Y23 all X18 (r4(X16,X17,X18) & X18 = Y23 | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	2 (all X6 ((exists Y19 (X6 = Y19 & r1(Y19))) | (exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	6 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (Y18 = Y8 & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	7 (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.69/1.01	8 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	10 (all X3 all X10 (X10 = X3 | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | Y13 != Y12)))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	12 -(exists Y1 ((all Y2 ((all Y3 (-r2(Y3,Y2) | -r1(Y3))) | Y1 != Y2)) & (all Y4 (-r1(Y4) | Y1 != Y4)))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause).  [assumption].
1.11/1.46	
1.11/1.46	============================== end of process non-clausal formulas ===
1.11/1.46	
1.11/1.46	============================== PROCESS INITIAL CLAUSES ===============
1.11/1.46	
1.11/1.46	============================== PREDICATE ELIMINATION =================
1.11/1.46	13 A = f1(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(1)].
1.11/1.46	14 r4(A,B,f7(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.11/1.46	15 r4(A,f11(A),f10(A)) # label(axiom_5a) # label(axiom).  [clausify(6)].
1.11/1.46	16 r4(A,f9(A,B),f8(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.11/1.46	17 r4(A,B,C) | C != f1(A,B) # label(axiom_4) # label(axiom).  [clausify(1)].
1.11/1.46	Derived: f7(A,B) = f1(A,B).  [resolve(13,b,14,a)].
1.11/1.46	Derived: f10(A) = f1(A,f11(A)).  [resolve(13,b,15,a)].
1.11/1.46	Derived: f8(A,B) = f1(A,f9(A,B)).  [resolve(13,b,16,a)].
1.11/1.46	18 -r3(A,B,C) | C = f13(A,B) # label(axiom_3) # label(axiom).  [clausify(7)].
1.11/1.46	19 r3(A,B,f17(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
1.11/1.46	20 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.11/1.46	21 r3(f7(A,B),A,f6(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.11/1.46	22 r3(A,f16(A,B),f15(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
1.11/1.46	Derived: f17(A,B) = f13(A,B).  [resolve(18,a,19,a)].
1.11/1.46	Derived: f18(A) = f13(A,f19(A)).  [resolve(18,a,20,a)].
1.11/1.46	Derived: f6(A,B) = f13(f7(A,B),A).  [resolve(18,a,21,a)].
1.11/1.46	Derived: f15(A,B) = f13(A,f16(A,B)).  [resolve(18,a,22,a)].
1.11/1.46	23 A != f13(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(7)].
1.11/1.46	
1.11/1.46	============================== end predicate elimination =============
1.11/1.46	
1.11/1.46	Auto_denials:  (non-Horn, no changes).
1.11/1.46	
1.11/1.46	Term ordering decisions:
1.11/1.46	Function symbol KB weights:  c1=1. f1=1. f6=1. f7=1. f8=1. f9=1. f13=1. f14=1. f15=1. f16=1. f17=1. f2=1. f3=1. f4=1. f5=1. f10=1. f11=1. f12=1. f18=1. f19=1. f20=1. f21=1. f22=1.
1.11/1.46	
1.11/1.46	============================== end of process initial clauses ========
1.11/1.46	
1.11/1.46	============================== CLAUSES FOR SEARCH ====================
1.11/1.46	
1.11/1.46	============================== end of clauses for search =============
1.11/1.46	
1.11/1.46	============================== SEARCH ================================
1.11/1.46	
1.11/1.46	% Starting search at 0.01 seconds.
1.11/1.46	
1.11/1.46	============================== PROOF =================================
1.11/1.46	% SZS status Theorem
1.11/1.46	% SZS output start Refutation
1.11/1.46	
1.11/1.46	% Proof 1 at 0.44 (+ 0.02) seconds.
1.11/1.46	% Length of proof is 48.
1.11/1.46	% Level of proof is 11.
1.11/1.46	% Maximum clause weight is 12.000.
1.11/1.46	% Given clauses 474.
1.11/1.46	
1.11/1.46	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	8 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	10 (all X3 all X10 (X10 = X3 | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | Y13 != Y12)))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.11/1.46	12 -(exists Y1 ((all Y2 ((all Y3 (-r2(Y3,Y2) | -r1(Y3))) | Y1 != Y2)) & (all Y4 (-r1(Y4) | Y1 != Y4)))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause).  [assumption].
1.11/1.46	26 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.11/1.46	27 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
1.11/1.46	30 r2(A,f16(B,A)) # label(axiom_1a) # label(axiom).  [clausify(9)].
1.11/1.46	31 r1(f21(A)) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	36 r1(f21(A)) | f22(A) = A # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	37 f20(A) = A | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	40 r2(f21(A),f20(A)) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	41 f20(A) = A | f22(A) = A # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	43 r2(f21(A),f20(A)) | f22(A) = A # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
1.11/1.46	44 -r2(A,B) | C != B | -r1(C) # label(axiom_7a) # label(axiom).  [clausify(8)].
1.11/1.46	45 r1(A) | A != c1 # label(axiom_1) # label(axiom).  [clausify(5)].
1.11/1.46	46 r1(A) | c1 != A.  [copy(45),flip(b)].
1.11/1.46	47 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(5)].
1.11/1.46	48 c1 = A | -r1(A).  [copy(47),flip(a)].
1.11/1.46	49 A = f5(B) | -r2(B,A) # label(axiom_2) # label(axiom).  [clausify(3)].
1.11/1.46	50 f5(A) = B | -r2(A,B).  [copy(49),flip(a)].
1.11/1.46	53 A = B | -r2(A,C) | -r2(B,D) | D != C # label(axiom_3a) # label(axiom).  [clausify(10)].
1.11/1.46	71 f20(A) = A | r1(A).  [para(41(b,1),37(b,1)),merge(b)].
1.11/1.46	81 f19(A) != f16(B,C).  [ur(44,a,30,a,c,26,a)].
1.11/1.46	85 -r1(f16(A,B)).  [ur(44,a,30,a,b,27,a),rewrite([27(2)])].
1.11/1.46	90 f21(A) = c1 | f22(A) = A.  [resolve(48,b,36,a),flip(a)].
1.11/1.46	92 f22(A) = c1 | r1(f21(A)).  [resolve(48,b,31,b),flip(a)].
1.11/1.46	93 f19(A) = c1.  [resolve(48,b,26,a),flip(a)].
1.11/1.46	96 f16(A,B) != c1.  [back_rewrite(81),rewrite([93(1)]),flip(a)].
1.11/1.46	106 f16(A,B) = f5(B).  [resolve(50,b,30,a),flip(a)].
1.11/1.46	108 f5(A) != c1.  [back_rewrite(96),rewrite([106(1)])].
1.11/1.46	109 -r1(f5(A)).  [back_rewrite(85),rewrite([106(1)])].
1.11/1.46	112 r2(A,f5(A)).  [back_rewrite(30),rewrite([106(1)])].
1.11/1.46	127 f20(f5(A)) = f5(A).  [resolve(109,a,71,b)].
1.11/1.46	153 -r2(c1,f5(f5(A))).  [ur(53,a,108,a(flip),c,112,a,d,27,a(flip)),rewrite([27(4)])].
1.11/1.46	179 r2(f21(f5(A)),f5(A)) | r1(f22(f5(A))).  [para(127(a,1),40(a,2))].
1.11/1.46	180 r2(f21(f5(A)),f5(A)) | f22(f5(A)) = f5(A).  [para(127(a,1),43(a,2))].
1.11/1.46	185 f22(A) = c1 | f21(A) = c1.  [resolve(92,b,48,b),flip(b)].
1.11/1.46	340 f21(A) = c1 | r1(f22(A)).  [resolve(185,a,46,b(flip))].
1.11/1.46	348 f21(A) = c1 | r1(A).  [para(90(b,1),340(b,1)),merge(b)].
1.11/1.46	355 f21(f5(A)) = c1.  [resolve(348,b,109,a)].
1.11/1.46	364 r2(c1,f5(A)) | f22(f5(A)) = f5(A).  [back_rewrite(180),rewrite([355(2)])].
1.11/1.46	365 r2(c1,f5(A)) | r1(f22(f5(A))).  [back_rewrite(179),rewrite([355(2)])].
1.11/1.46	462 r1(f22(f5(f5(A)))).  [resolve(365,a,153,a)].
1.11/1.46	474 f22(f5(f5(A))) = c1.  [resolve(462,a,48,b),flip(a)].
1.11/1.46	2771 $F.  [resolve(364,a,153,a),rewrite([474(3)]),flip(a),unit_del(a,108)].
1.11/1.46	
1.11/1.46	% SZS output end Refutation
1.11/1.46	============================== end of proof ==========================
1.11/1.46	
1.11/1.46	============================== STATISTICS ============================
1.11/1.46	
1.11/1.46	Given=474. Generated=12478. Kept=2739. proofs=1.
1.11/1.46	Usable=450. Sos=2091. Demods=37. Limbo=6, Disabled=236. Hints=0.
1.11/1.46	Megabytes=2.63.
1.11/1.46	User_CPU=0.44, System_CPU=0.02, Wall_clock=0.
1.11/1.46	
1.11/1.46	============================== end of statistics =====================
1.11/1.46	
1.11/1.46	============================== end of search =========================
1.11/1.46	
1.11/1.46	THEOREM PROVED
1.11/1.46	% SZS status Theorem
1.11/1.46	
1.11/1.46	Exiting with 1 proof.
1.11/1.46	
1.11/1.46	Process 12235 exit (max_proofs) Thu Jul  2 07:15:52 2020
1.11/1.46	Prover9 interrupted
1.11/1.46	EOF