0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer   : n026.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 960
0.14/0.34	% DateTime   : Thu Jul  2 07:46:39 EDT 2020
0.14/0.34	% CPUTime    : 
0.76/1.04	============================== Prover9 ===============================
0.76/1.04	Prover9 (32) version 2009-11A, November 2009.
0.76/1.04	Process 21805 was started by sandbox on n026.cluster.edu,
0.76/1.04	Thu Jul  2 07:46:40 2020
0.76/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_21516_n026.cluster.edu".
0.76/1.04	============================== end of head ===========================
0.76/1.04	
0.76/1.04	============================== INPUT =================================
0.76/1.04	
0.76/1.04	% Reading from file /tmp/Prover9_21516_n026.cluster.edu
0.76/1.04	
0.76/1.04	set(prolog_style_variables).
0.76/1.04	set(auto2).
0.76/1.04	    % set(auto2) -> set(auto).
0.76/1.04	    % set(auto) -> set(auto_inference).
0.76/1.04	    % set(auto) -> set(auto_setup).
0.76/1.04	    % set(auto_setup) -> set(predicate_elim).
0.76/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.04	    % set(auto) -> set(auto_limits).
0.76/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.04	    % set(auto) -> set(auto_denials).
0.76/1.04	    % set(auto) -> set(auto_process).
0.76/1.04	    % set(auto2) -> assign(new_constants, 1).
0.76/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.04	    % set(auto2) -> assign(max_hours, 1).
0.76/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.04	    % set(auto2) -> set(sort_initial_sos).
0.76/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.04	    % set(auto2) -> assign(max_megs, 400).
0.76/1.04	    % set(auto2) -> assign(stats, some).
0.76/1.04	    % set(auto2) -> clear(echo_input).
0.76/1.04	    % set(auto2) -> set(quiet).
0.76/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.04	    % set(auto2) -> clear(print_given).
0.76/1.04	assign(lrs_ticks,-1).
0.76/1.04	assign(sos_limit,10000).
0.76/1.04	assign(order,kbo).
0.76/1.04	set(lex_order_vars).
0.76/1.04	clear(print_given).
0.76/1.04	
0.76/1.04	% formulas(sos).  % not echoed (19 formulas)
0.76/1.04	
0.76/1.04	============================== end of input ==========================
0.76/1.04	
0.76/1.04	% From the command line: assign(max_seconds, 960).
0.76/1.04	
0.76/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.04	
0.76/1.04	% Formulas that are not ordinary clauses:
0.76/1.04	1 (all X26 all X27 (-id(X26,X27) | -r1(X27) & -r1(X26) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	2 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & -id(X18,Y23) | r4(X16,X17,X18) & id(X18,Y23))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	3 (all X2 all X9 exists Y2 ((exists Y3 (id(Y3,Y2) & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))) & (exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	4 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X39,X42) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X40,X43) | -id(X38,X41))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	5 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	6 (all X6 ((exists Y19 (r1(Y19) & id(X6,Y19))) | (exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	7 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	8 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | -id(Y13,Y12))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	9 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	10 (all X28 all X29 all X30 all X31 (-r2(X30,X31) & -r2(X28,X29) | r2(X28,X29) & r2(X30,X31) | -id(X29,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	11 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & id(Y8,Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	12 (all X11 exists Y21 all X12 (-id(X12,Y21) & -r2(X11,X12) | id(X12,Y21) & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	13 (all X32 all X33 all X34 all X35 all X36 all X37 (r3(X32,X33,X34) & r3(X35,X36,X37) | -r3(X35,X36,X37) & -r3(X32,X33,X34) | -id(X32,X35) | -id(X33,X36) | -id(X34,X37))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	14 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -id(X15,Y22) & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	16 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	17 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	18 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	19 -(exists Y1 exists Y3 exists Y2 exists Y4 ((exists Y5 (id(Y4,Y5) & r4(Y2,Y2,Y5))) & (exists Y6 ((exists Y7 (r3(Y7,Y6,Y4) & r4(Y1,Y1,Y7))) & r4(Y3,Y3,Y6))))) # label(fermattothepoweroftwoid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.27/1.53	
1.27/1.53	============================== end of process non-clausal formulas ===
1.27/1.53	
1.27/1.53	============================== PROCESS INITIAL CLAUSES ===============
1.27/1.53	
1.27/1.53	============================== PREDICATE ELIMINATION =================
1.27/1.53	
1.27/1.53	============================== end predicate elimination =============
1.27/1.53	
1.27/1.53	Auto_denials:  (non-Horn, no changes).
1.27/1.53	
1.27/1.53	Term ordering decisions:
1.27/1.53	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f13=1. f16=1. f17=1. f18=1. f19=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f14=1. f15=1.
1.27/1.53	
1.27/1.53	============================== end of process initial clauses ========
1.27/1.53	
1.27/1.53	============================== CLAUSES FOR SEARCH ====================
1.27/1.53	
1.27/1.53	============================== end of clauses for search =============
1.27/1.53	
1.27/1.53	============================== SEARCH ================================
1.27/1.53	
1.27/1.53	% Starting search at 0.02 seconds.
1.27/1.53	
1.27/1.53	Low Water (keep): wt=15.000, iters=4743
1.27/1.53	
1.27/1.53	Low Water (keep): wt=14.000, iters=4324
1.27/1.53	
1.27/1.53	Low Water (keep): wt=13.000, iters=3496
1.27/1.53	
1.27/1.53	Low Water (keep): wt=12.000, iters=3346
1.27/1.53	
1.27/1.53	Low Water (keep): wt=11.000, iters=3465
1.27/1.53	
1.27/1.53	Low Water (keep): wt=10.000, iters=3346
1.27/1.53	
1.27/1.53	Low Water (keep): wt=9.000, iters=3368
1.27/1.53	
1.27/1.53	============================== PROOF =================================
1.27/1.53	% SZS status Theorem
1.27/1.53	% SZS output start Refutation
1.27/1.53	
1.27/1.53	% Proof 1 at 0.48 (+ 0.03) seconds.
1.27/1.53	% Length of proof is 46.
1.27/1.53	% Level of proof is 8.
1.27/1.53	% Maximum clause weight is 19.000.
1.27/1.53	% Given clauses 274.
1.27/1.53	
1.27/1.53	1 (all X26 all X27 (-id(X26,X27) | -r1(X27) & -r1(X26) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	3 (all X2 all X9 exists Y2 ((exists Y3 (id(Y3,Y2) & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))) & (exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	4 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X39,X42) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X40,X43) | -id(X38,X41))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	5 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	6 (all X6 ((exists Y19 (r1(Y19) & id(X6,Y19))) | (exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	9 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	11 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & id(Y8,Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	17 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.27/1.53	19 -(exists Y1 exists Y3 exists Y2 exists Y4 ((exists Y5 (id(Y4,Y5) & r4(Y2,Y2,Y5))) & (exists Y6 ((exists Y7 (r3(Y7,Y6,Y4) & r4(Y1,Y1,Y7))) & r4(Y3,Y3,Y6))))) # label(fermattothepoweroftwoid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.27/1.53	21 r1(f10(A)) # label(axiom_5a) # label(axiom).  [clausify(11)].
1.27/1.53	22 r1(f11(A)) # label(axiom_5a) # label(axiom).  [clausify(11)].
1.27/1.53	23 r1(f15(A)) # label(axiom_4a) # label(axiom).  [clausify(17)].
1.27/1.53	24 id(f14(A),A) # label(axiom_4a) # label(axiom).  [clausify(17)].
1.27/1.53	26 id(f9(A),f11(A)) # label(axiom_5a) # label(axiom).  [clausify(11)].
1.27/1.53	28 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom).  [clausify(3)].
1.27/1.53	29 r4(A,f10(A),f9(A)) # label(axiom_5a) # label(axiom).  [clausify(11)].
1.27/1.53	30 r3(A,f15(A),f14(A)) # label(axiom_4a) # label(axiom).  [clausify(17)].
1.27/1.53	33 r1(f6(A)) | id(A,f8(A)) # label(axiom_6a) # label(axiom).  [clausify(6)].
1.27/1.53	38 r1(f6(A)) | r2(f7(A),f8(A)) # label(axiom_6a) # label(axiom).  [clausify(6)].
1.27/1.53	39 id(A,f6(A)) | id(A,f8(A)) # label(axiom_6a) # label(axiom).  [clausify(6)].
1.27/1.53	41 id(A,f6(A)) | r2(f7(A),f8(A)) # label(axiom_6a) # label(axiom).  [clausify(6)].
1.27/1.53	42 -id(A,B) | -r1(A) | -r2(C,B) # label(axiom_7a) # label(axiom).  [clausify(9)].
1.27/1.53	43 -id(A,B) | -r4(C,C,B) | -r3(D,E,A) | -r4(F,F,D) | -r4(V6,V6,E) # label(fermattothepoweroftwoid) # label(negated_conjecture).  [clausify(19)].
1.27/1.53	44 id(A,c1) | -r1(A) # label(axiom_1) # label(axiom).  [clausify(5)].
1.27/1.53	46 id(A,B) | -id(B,A) # label(axiom_6) # label(axiom).  [clausify(15)].
1.27/1.53	47 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom).  [clausify(1)].
1.27/1.53	60 -id(A,B) | r4(C,B,D) | -r4(E,A,F) | -id(F,D) | -id(E,C) # label(axiom_11) # label(axiom).  [clausify(4)].
1.27/1.53	72 -id(A,B) | r4(B,B,C) | -r4(A,A,D) | -id(D,C).  [factor(60,a,e)].
1.27/1.53	85 -id(A,f8(B)) | -r1(A) | id(B,f6(B)).  [resolve(42,c,41,b)].
1.27/1.53	86 -id(A,f8(B)) | -r1(A) | r1(f6(B)).  [resolve(42,c,38,b)].
1.27/1.53	118 -r4(A,A,f15(f5(B,B))).  [ur(43,a,24,a,b,28,a,c,30,a,d,28,a)].
1.27/1.53	122 id(f15(A),c1).  [resolve(44,b,23,a)].
1.27/1.53	132 id(A,f14(A)).  [resolve(46,b,24,a)].
1.27/1.53	136 r1(f9(A)).  [resolve(47,a,26,a),unit_del(a,22)].
1.27/1.53	215 -r1(A) | id(A,f6(A)).  [resolve(85,a,39,b),merge(c)].
1.27/1.53	252 id(f9(A),c1).  [resolve(136,a,44,b)].
1.27/1.53	264 id(c1,f15(A)).  [resolve(122,a,46,b)].
1.27/1.53	265 -r1(A) | r1(f6(A)).  [resolve(86,a,33,b),merge(c)].
1.27/1.53	762 r1(f6(f10(A))).  [resolve(265,a,21,a)].
1.27/1.53	1042 id(f6(f10(A)),c1).  [resolve(762,a,44,b)].
1.27/1.53	2387 id(c1,f6(f10(A))).  [resolve(1042,a,46,b)].
1.27/1.53	5372 id(f10(A),f6(f10(A))).  [resolve(215,a,21,a)].
1.27/1.53	5847 -r4(A,A,c1).  [ur(72,a,132,a,b,118,a,d,264,a)].
1.27/1.53	6842 -id(f10(c1),f6(f10(A))).  [ur(60,b,5847,a,c,29,a,d,252,a,e,2387,a)].
1.27/1.53	6843 $F.  [resolve(6842,a,5372,a)].
1.27/1.53	
1.27/1.53	% SZS output end Refutation
1.27/1.53	============================== end of proof ==========================
1.27/1.53	
1.27/1.53	============================== STATISTICS ============================
1.27/1.53	
1.27/1.53	Given=274. Generated=40414. Kept=6823. proofs=1.
1.27/1.53	Usable=274. Sos=6012. Demods=0. Limbo=355, Disabled=224. Hints=0.
1.27/1.53	Megabytes=3.87.
1.27/1.53	User_CPU=0.48, System_CPU=0.03, Wall_clock=0.
1.27/1.53	
1.27/1.53	============================== end of statistics =====================
1.27/1.53	
1.27/1.53	============================== end of search =========================
1.27/1.53	
1.27/1.53	THEOREM PROVED
1.27/1.53	% SZS status Theorem
1.27/1.53	
1.27/1.53	Exiting with 1 proof.
1.27/1.53	
1.27/1.53	Process 21805 exit (max_proofs) Thu Jul  2 07:46:40 2020
1.27/1.53	Prover9 interrupted
1.29/1.54	EOF