0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n021.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 17:19:19 EDT 2019
0.12/0.33	% CPUTime    : 
0.71/1.00	============================== Prover9 ===============================
0.71/1.00	Prover9 (32) version 2009-11A, November 2009.
0.71/1.00	Process 21680 was started by sandbox2 on n021.cluster.edu,
0.71/1.00	Thu Aug 29 17:19:19 2019
0.71/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_21527_n021.cluster.edu".
0.71/1.00	============================== end of head ===========================
0.71/1.00	
0.71/1.00	============================== INPUT =================================
0.71/1.00	
0.71/1.00	% Reading from file /tmp/Prover9_21527_n021.cluster.edu
0.71/1.00	
0.71/1.00	set(prolog_style_variables).
0.71/1.00	set(auto2).
0.71/1.00	    % set(auto2) -> set(auto).
0.71/1.00	    % set(auto) -> set(auto_inference).
0.71/1.00	    % set(auto) -> set(auto_setup).
0.71/1.00	    % set(auto_setup) -> set(predicate_elim).
0.71/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.71/1.00	    % set(auto) -> set(auto_limits).
0.71/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.71/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.71/1.00	    % set(auto) -> set(auto_denials).
0.71/1.00	    % set(auto) -> set(auto_process).
0.71/1.00	    % set(auto2) -> assign(new_constants, 1).
0.71/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.71/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.71/1.00	    % set(auto2) -> assign(max_hours, 1).
0.71/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.71/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.71/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.71/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.71/1.00	    % set(auto2) -> set(sort_initial_sos).
0.71/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.71/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.71/1.00	    % set(auto2) -> assign(max_megs, 400).
0.71/1.00	    % set(auto2) -> assign(stats, some).
0.71/1.00	    % set(auto2) -> clear(echo_input).
0.71/1.00	    % set(auto2) -> set(quiet).
0.71/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.71/1.00	    % set(auto2) -> clear(print_given).
0.71/1.00	assign(lrs_ticks,-1).
0.71/1.00	assign(sos_limit,10000).
0.71/1.00	assign(order,kbo).
0.71/1.00	set(lex_order_vars).
0.71/1.00	clear(print_given).
0.71/1.00	
0.71/1.00	% formulas(sos).  % not echoed (12 formulas)
0.71/1.00	
0.71/1.00	============================== end of input ==========================
0.71/1.00	
0.71/1.00	% From the command line: assign(max_seconds, 180).
0.71/1.00	
0.71/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.71/1.00	
0.71/1.00	% Formulas that are not ordinary clauses:
0.71/1.00	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.71/1.00	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.71/1.00	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.71/1.00	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.71/1.00	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.71/1.00	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.71/1.00	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.71/1.00	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.71/1.00	9 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.71/1.00	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.71/1.00	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.71/1.00	12 -(exists Y1 ((all Y11 (Y1 != Y11 | -r1(Y11))) & (all X1 all X2 ((all Y3 all Y5 (Y5 != Y1 | -r3(X2,Y3,Y5))) | (exists Y7 ((exists Y9 (r2(Y9,Y7) & r1(Y9))) & Y7 = X1)) | (exists Y8 ((exists Y10 (r2(Y10,Y8) & r1(Y10))) & Y8 = X2)) | (all Y4 (-r4(X1,X2,Y4) | Y4 != Y1)) | (all Y2 all Y6 (Y6 != Y1 | -r3(X1,Y2,Y6))))))) # label(primeexist) # label(negated_conjecture) # label(non_clause).  [assumption].
8.77/9.07	
8.77/9.07	============================== end of process non-clausal formulas ===
8.77/9.07	
8.77/9.07	============================== PROCESS INITIAL CLAUSES ===============
8.77/9.07	
8.77/9.07	============================== PREDICATE ELIMINATION =================
8.77/9.07	13 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
8.77/9.07	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
8.77/9.07	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
8.77/9.07	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
8.77/9.07	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
8.77/9.07	18 r1(f20(A)) | r3(f22(A),f23(A),f24(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	19 r1(f20(A)) | r3(f21(A),f26(A),f27(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	20 f20(A) = A | r3(f22(A),f23(A),f24(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	21 f20(A) = A | r3(f21(A),f26(A),f27(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	22 r3(A,B,C) | C != f14(A,B) # label(axiom_3) # label(axiom).  [clausify(6)].
8.77/9.07	Derived: f2(A,B) = f14(A,B).  [resolve(13,b,14,a)].
8.77/9.07	Derived: f18(A) = f14(A,f19(A)).  [resolve(13,b,15,a)].
8.77/9.07	Derived: f3(A,B) = f14(A,f4(A,B)).  [resolve(13,b,16,a)].
8.77/9.07	Derived: f9(A,B) = f14(f10(A,B),A).  [resolve(13,b,17,a)].
8.77/9.07	Derived: f24(A) = f14(f22(A),f23(A)) | r1(f20(A)).  [resolve(13,b,18,b)].
8.77/9.07	Derived: f27(A) = f14(f21(A),f26(A)) | r1(f20(A)).  [resolve(13,b,19,b)].
8.77/9.07	Derived: f24(A) = f14(f22(A),f23(A)) | f20(A) = A.  [resolve(13,b,20,b)].
8.77/9.07	Derived: f27(A) = f14(f21(A),f26(A)) | f20(A) = A.  [resolve(13,b,21,b)].
8.77/9.07	23 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
8.77/9.07	24 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
8.77/9.07	25 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
8.77/9.07	26 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
8.77/9.07	27 r1(f20(A)) | r4(f21(A),f22(A),f25(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	28 f20(A) = A | r4(f21(A),f22(A),f25(A)) # label(primeexist) # label(negated_conjecture).  [clausify(12)].
8.77/9.07	Derived: f10(A,B) = f5(A,B).  [resolve(23,b,24,a)].
8.77/9.07	Derived: f15(A) = f5(A,f16(A)).  [resolve(23,b,25,a)].
8.77/9.07	Derived: f11(A,B) = f5(A,f12(A,B)).  [resolve(23,b,26,a)].
8.77/9.07	Derived: f25(A) = f5(f21(A),f22(A)) | r1(f20(A)).  [resolve(23,b,27,b)].
8.77/9.07	Derived: f25(A) = f5(f21(A),f22(A)) | f20(A) = A.  [resolve(23,b,28,b)].
8.77/9.07	29 r4(A,B,C) | C != f5(A,B) # label(axiom_4) # label(axiom).  [clausify(2)].
8.77/9.07	
8.77/9.07	============================== end predicate elimination =============
8.77/9.07	
8.77/9.07	Auto_denials:  (non-Horn, no changes).
8.77/9.07	
8.77/9.07	Term ordering decisions:
8.77/9.07	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. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1.
8.77/9.07	
8.77/9.07	============================== end of process initial clauses ========
8.77/9.07	
8.77/9.07	============================== CLAUSES FOR SEARCH ====================
8.77/9.07	
8.77/9.07	============================== end of clauses for search =============
8.77/9.07	
8.77/9.07	============================== SEARCH ================================
8.77/9.07	
8.77/9.07	% Starting search at 0.01 seconds.
8.77/9.07	
8.77/9.07	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 90 (0.00 of 0.39 sec).
8.77/9.07	
8.77/9.07	Low Water (keep): wt=26.000, iters=3461
8.77/9.07	
8.77/9.07	Low Water (keep): wt=24.000, iters=3387
8.77/9.07	
8.77/9.07	Low Water (keep): wt=23.000, iters=3361
8.77/9.07	
8.77/9.07	Low Water (keep): wt=22.000, iters=3372
8.77/9.07	
8.77/9.07	Low Water (keep): wt=20.000, iters=3461
8.77/9.07	
8.77/9.07	Low Water (keep): wt=19.000, iters=3335
8.77/9.07	
8.77/9.07	Low Water (keep): wt=18.000, iters=3335
8.77/9.07	
8.77/9.07	Low Water (keep): wt=17.000, iters=3340
8.77/9.07	
8.77/9.07	Low Water (keep): wt=16.000, iters=3335
8.77/9.07	
8.77/9.07	Low Water (displace): id=3245, wt=40.000
8.77/9.07	
8.77/9.07	Low Water (displace): id=3242, wt=36.000
8.77/9.07	
8.77/9.07	Low Water (displace): id=4533, wt=27.000
8.77/9.07	
8.77/9.07	Low Water (displace): id=4804, wt=26.000
8.77/9.07	
8.77/9.07	Low Water (Cputime limit exceeded (core dumped)
180.03/180.31	EOF