0.07/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.36	% Computer : n020.cluster.edu
0.13/0.36	% Model    : x86_64 x86_64
0.13/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.36	% Memory   : 8042.1875MB
0.13/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.36	% CPULimit : 1440
0.13/0.36	% WCLimit  : 180
0.13/0.36	% DateTime : Mon Jul  3 11:52:46 EDT 2023
0.13/0.36	% CPUTime  : 
0.41/1.02	============================== Prover9 ===============================
0.41/1.02	Prover9 (32) version 2009-11A, November 2009.
0.41/1.02	Process 19120 was started by sandbox2 on n020.cluster.edu,
0.41/1.02	Mon Jul  3 11:52:46 2023
0.41/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_18965_n020.cluster.edu".
0.41/1.02	============================== end of head ===========================
0.41/1.02	
0.41/1.02	============================== INPUT =================================
0.41/1.02	
0.41/1.02	% Reading from file /tmp/Prover9_18965_n020.cluster.edu
0.41/1.02	
0.41/1.02	set(prolog_style_variables).
0.41/1.02	set(auto2).
0.41/1.02	    % set(auto2) -> set(auto).
0.41/1.02	    % set(auto) -> set(auto_inference).
0.41/1.02	    % set(auto) -> set(auto_setup).
0.41/1.02	    % set(auto_setup) -> set(predicate_elim).
0.41/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/1.02	    % set(auto) -> set(auto_limits).
0.41/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/1.02	    % set(auto) -> set(auto_denials).
0.41/1.02	    % set(auto) -> set(auto_process).
0.41/1.02	    % set(auto2) -> assign(new_constants, 1).
0.41/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.41/1.02	    % set(auto2) -> assign(max_hours, 1).
0.41/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.41/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.41/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/1.02	    % set(auto2) -> set(sort_initial_sos).
0.41/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.41/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/1.02	    % set(auto2) -> assign(max_megs, 400).
0.41/1.02	    % set(auto2) -> assign(stats, some).
0.41/1.02	    % set(auto2) -> clear(echo_input).
0.41/1.02	    % set(auto2) -> set(quiet).
0.41/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.41/1.02	    % set(auto2) -> clear(print_given).
0.41/1.02	assign(lrs_ticks,-1).
0.41/1.02	assign(sos_limit,10000).
0.41/1.02	assign(order,kbo).
0.41/1.02	set(lex_order_vars).
0.41/1.02	clear(print_given).
0.41/1.02	
0.41/1.02	% formulas(sos).  % not echoed (12 formulas)
0.41/1.02	
0.41/1.02	============================== end of input ==========================
0.41/1.02	
0.41/1.02	% From the command line: assign(max_seconds, 1440).
0.41/1.02	
0.41/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/1.02	
0.41/1.02	% Formulas that are not ordinary clauses:
0.41/1.02	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y5 = Y4)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	2 (all X11 exists Y21 all X12 (r2(X11,X12) & X12 = Y21 | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	3 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	4 (all X2 all X9 exists Y2 ((exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))) & (exists Y3 (Y3 = Y2 & (exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	6 (all X3 all X10 ((all Y12 ((all Y13 (Y13 != Y12 | -r2(X3,Y13))) | -r2(X10,Y12))) | X3 = X10)) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	7 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & Y23 != X18 | r4(X16,X17,X18) & X18 = Y23)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	8 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | X15 != Y22 & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	9 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	10 (all X6 ((exists Y1 exists Y11 (r2(Y1,Y11) & X6 = Y11)) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	11 (all X7 all Y10 ((all Y20 (Y20 != Y10 | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.41/1.02	12 -(exists Y1 ((all Y11 (-r1(Y11) | Y11 != Y1)) & (all X1 all X2 ((all Y4 (-r4(X1,X2,Y4) | Y4 != Y1)) | (exists Y8 (X2 = Y8 & (exists Y10 (r2(Y10,Y8) & r1(Y10))))) | (exists Y7 (X1 = Y7 & (exists Y9 (r2(Y9,Y7) & r1(Y9))))) | (all Y3 all Y5 (-r3(X2,Y3,Y5) | Y5 != Y1)) | (all Y2 all Y6 (-r3(X1,Y2,Y6) | Y1 != Y6)))))) # label(primeexist) # label(negated_conjecture) # label(non_clause).  [assumption].
9.07/9.40	
9.07/9.40	============================== end of process non-clausal formulas ===
9.07/9.40	
9.07/9.40	============================== PROCESS INITIAL CLAUSES ===============
9.07/9.40	
9.07/9.40	============================== PREDICATE ELIMINATION =================
9.07/9.40	13 A = f13(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(8)].
9.07/9.40	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
9.07/9.40	15 r3(A,f7(A),f6(A)) # label(axiom_4a) # label(axiom).  [clausify(3)].
9.07/9.40	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
9.07/9.40	17 r3(f9(A,B),A,f8(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
9.07/9.40	18 r1(f20(A)) | r3(f22(A),f24(A),f25(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	19 r1(f20(A)) | r3(f21(A),f26(A),f27(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	20 f20(A) = A | r3(f22(A),f24(A),f25(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	21 f20(A) = A | r3(f21(A),f26(A),f27(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	22 r3(A,B,C) | C != f13(A,B) # label(axiom_3) # label(axiom).  [clausify(8)].
9.07/9.40	Derived: f2(A,B) = f13(A,B).  [resolve(13,b,14,a)].
9.07/9.40	Derived: f6(A) = f13(A,f7(A)).  [resolve(13,b,15,a)].
9.07/9.40	Derived: f3(A,B) = f13(A,f4(A,B)).  [resolve(13,b,16,a)].
9.07/9.40	Derived: f8(A,B) = f13(f9(A,B),A).  [resolve(13,b,17,a)].
9.07/9.40	Derived: f25(A) = f13(f22(A),f24(A)) | r1(f20(A)).  [resolve(13,b,18,b)].
9.07/9.40	Derived: f27(A) = f13(f21(A),f26(A)) | r1(f20(A)).  [resolve(13,b,19,b)].
9.07/9.40	Derived: f25(A) = f13(f22(A),f24(A)) | f20(A) = A.  [resolve(13,b,20,b)].
9.07/9.40	Derived: f27(A) = f13(f21(A),f26(A)) | f20(A) = A.  [resolve(13,b,21,b)].
9.07/9.40	23 -r4(A,B,C) | C = f12(A,B) # label(axiom_4) # label(axiom).  [clausify(7)].
9.07/9.40	24 r4(A,B,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
9.07/9.40	25 r4(A,f15(A),f14(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
9.07/9.40	26 r4(A,f11(A,B),f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
9.07/9.40	27 r1(f20(A)) | r4(f21(A),f22(A),f23(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	28 f20(A) = A | r4(f21(A),f22(A),f23(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
9.07/9.40	Derived: f9(A,B) = f12(A,B).  [resolve(23,a,24,a)].
9.07/9.40	Derived: f14(A) = f12(A,f15(A)).  [resolve(23,a,25,a)].
9.07/9.40	Derived: f10(A,B) = f12(A,f11(A,B)).  [resolve(23,a,26,a)].
9.07/9.40	Derived: f23(A) = f12(f21(A),f22(A)) | r1(f20(A)).  [resolve(23,a,27,b)].
9.07/9.40	Derived: f23(A) = f12(f21(A),f22(A)) | f20(A) = A.  [resolve(23,a,28,b)].
9.07/9.40	29 A != f12(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(7)].
9.07/9.40	
9.07/9.40	============================== end predicate elimination =============
9.07/9.40	
9.07/9.40	Auto_denials:  (non-Horn, no changes).
9.07/9.40	
9.07/9.40	Term ordering decisions:
9.07/9.40	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f5=1. f6=1. f7=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1.
9.07/9.40	
9.07/9.40	============================== end of process initial clauses ========
9.07/9.40	
9.07/9.40	============================== CLAUSES FOR SEARCH ====================
9.07/9.40	
9.07/9.40	============================== end of clauses for search =============
9.07/9.40	
9.07/9.40	============================== SEARCH ================================
9.07/9.40	
9.07/9.40	% Starting search at 0.01 seconds.
9.07/9.40	
9.07/9.40	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 28 (0.00 of 0.38 sec).
9.07/9.40	
9.07/9.40	Low Water (keep): wt=26.000, iters=3467
9.07/9.40	
9.07/9.40	Low Water (keep): wt=25.000, iters=3431
9.07/9.40	
9.07/9.40	Low Water (keep): wt=24.000, iters=3366
9.07/9.40	
9.07/9.40	Low Water (keep): wt=23.000, iters=3372
9.07/9.40	
9.07/9.40	Low Water (keep): wt=22.000, iters=3398
9.07/9.40	
9.07/9.40	Low Water (keep): wt=21.000, iters=3334
9.07/9.40	
9.07/9.40	Low Water (keep): wt=20.000, iters=3399
9.07/9.40	
9.07/9.40	Low Water (keep): wt=19.000, iters=3409
9.07/9.40	
9.07/9.40	Low Water (keep): wt=18.000, iters=3336
9.07/9.40	
9.07/9.40	Low Water (keep): wt=17.000, iters=3354
9.07/9.40	
9.07/9.40	Low Water (keep): wt=16.000, iters=3345
9.07/9.40	
9.07/9.40	Low Water (displace): id=2654, wt=40.000
9.07/9.40	
9.07/9.40	Low Water (displace): id=2651, wt=36.000
9.07/9.40	
9.07/9.40	Low Water (disAlarm clock 
179.64/180.03	Prover9 interrupted
179.64/180.03	EOF