0.05/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer   : n027.cluster.edu
0.09/0.29	% Model      : x86_64 x86_64
0.09/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory     : 8042.1875MB
0.09/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1200
0.09/0.29	% DateTime   : Tue Jul 13 13:37:40 EDT 2021
0.09/0.30	% CPUTime    : 
0.70/1.01	============================== Prover9 ===============================
0.70/1.01	Prover9 (32) version 2009-11A, November 2009.
0.70/1.01	Process 8389 was started by sandbox on n027.cluster.edu,
0.70/1.01	Tue Jul 13 13:37:40 2021
0.70/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_8235_n027.cluster.edu".
0.70/1.01	============================== end of head ===========================
0.70/1.01	
0.70/1.01	============================== INPUT =================================
0.70/1.01	
0.70/1.01	% Reading from file /tmp/Prover9_8235_n027.cluster.edu
0.70/1.01	
0.70/1.01	set(prolog_style_variables).
0.70/1.01	set(auto2).
0.70/1.01	    % set(auto2) -> set(auto).
0.70/1.01	    % set(auto) -> set(auto_inference).
0.70/1.01	    % set(auto) -> set(auto_setup).
0.70/1.01	    % set(auto_setup) -> set(predicate_elim).
0.70/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.70/1.01	    % set(auto) -> set(auto_limits).
0.70/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.70/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.70/1.01	    % set(auto) -> set(auto_denials).
0.70/1.01	    % set(auto) -> set(auto_process).
0.70/1.01	    % set(auto2) -> assign(new_constants, 1).
0.70/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.70/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.70/1.01	    % set(auto2) -> assign(max_hours, 1).
0.70/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.70/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.70/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.70/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.70/1.01	    % set(auto2) -> set(sort_initial_sos).
0.70/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.70/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.70/1.01	    % set(auto2) -> assign(max_megs, 400).
0.70/1.01	    % set(auto2) -> assign(stats, some).
0.70/1.01	    % set(auto2) -> clear(echo_input).
0.70/1.01	    % set(auto2) -> set(quiet).
0.70/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.70/1.01	    % set(auto2) -> clear(print_given).
0.70/1.01	assign(lrs_ticks,-1).
0.70/1.01	assign(sos_limit,10000).
0.70/1.01	assign(order,kbo).
0.70/1.01	set(lex_order_vars).
0.70/1.01	clear(print_given).
0.70/1.01	
0.70/1.01	% formulas(sos).  % not echoed (19 formulas)
0.70/1.01	
0.70/1.01	============================== end of input ==========================
0.70/1.01	
0.70/1.01	% From the command line: assign(max_seconds, 1200).
0.70/1.01	
0.70/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.70/1.01	
0.70/1.01	% Formulas that are not ordinary clauses:
0.70/1.01	1 (all X32 all X33 all X34 all X35 all X36 all X37 (-id(X33,X36) | r3(X35,X36,X37) & r3(X32,X33,X34) | -r3(X32,X33,X34) & -r3(X35,X36,X37) | -id(X34,X37) | -id(X32,X35))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & id(Y3,Y2))) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	3 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	4 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	5 (all X11 exists Y21 all X12 (id(X12,Y21) & r2(X11,X12) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	6 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	7 (all X16 all X17 exists Y23 all X18 (-id(X18,Y23) & -r4(X16,X17,X18) | id(X18,Y23) & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	8 (all X6 ((exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))) | (exists Y19 (id(X6,Y19) & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	9 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-id(Y20,Y10) | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	11 (all X28 all X29 all X30 all X31 (-id(X29,X31) | r2(X28,X29) & r2(X30,X31) | -r2(X28,X29) & -r2(X30,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.70/1.01	12 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -r3(X13,X14,X15) & -id(X15,Y22))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	13 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	14 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X40,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | r4(X38,X39,X40) & r4(X41,X42,X43) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	15 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	16 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	17 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & id(Y5,Y4))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	18 (all X3 all X10 (id(X3,X10) | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | -id(Y13,Y12))))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	19 -(exists Y1 exists Y3 exists Y2 exists Y4 ((exists Y6 ((exists Y7 (r3(Y7,Y6,Y4) & r4(Y1,Y1,Y7))) & r4(Y3,Y3,Y6))) & (exists Y5 (id(Y4,Y5) & r4(Y2,Y2,Y5))))) # label(fermattothepoweroftwoid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.54/1.88	
1.54/1.88	============================== end of process non-clausal formulas ===
1.54/1.88	
1.54/1.88	============================== PROCESS INITIAL CLAUSES ===============
1.54/1.88	
1.54/1.88	============================== PREDICATE ELIMINATION =================
1.54/1.88	
1.54/1.88	============================== end predicate elimination =============
1.54/1.88	
1.54/1.88	Auto_denials:  (non-Horn, no changes).
1.54/1.88	
1.54/1.88	Term ordering decisions:
1.54/1.88	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f8=1. f12=1. f16=1. f17=1. f18=1. f19=1. f5=1. f6=1. f7=1. f9=1. f10=1. f11=1. f13=1. f14=1. f15=1.
1.54/1.88	
1.54/1.88	============================== end of process initial clauses ========
1.54/1.88	
1.54/1.88	============================== CLAUSES FOR SEARCH ====================
1.54/1.88	
1.54/1.88	============================== end of clauses for search =============
1.54/1.88	
1.54/1.88	============================== SEARCH ================================
1.54/1.88	
1.54/1.88	% Starting search at 0.01 seconds.
1.54/1.88	
1.54/1.88	Low Water (keep): wt=10.000, iters=3552
1.54/1.88	
1.54/1.88	============================== PROOF =================================
1.54/1.88	% SZS status Theorem
1.54/1.88	% SZS output start Refutation
1.54/1.88	
1.54/1.88	% Proof 1 at 0.85 (+ 0.02) seconds.
1.54/1.88	% Length of proof is 35.
1.54/1.88	% Level of proof is 6.
1.54/1.88	% Maximum clause weight is 19.000.
1.54/1.88	% Given clauses 238.
1.54/1.88	
1.54/1.88	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & id(Y3,Y2))) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	4 (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.54/1.88	6 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	13 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	14 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X40,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | r4(X38,X39,X40) & r4(X41,X42,X43) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	15 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	16 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.54/1.88	19 -(exists Y1 exists Y3 exists Y2 exists Y4 ((exists Y6 ((exists Y7 (r3(Y7,Y6,Y4) & r4(Y1,Y1,Y7))) & r4(Y3,Y3,Y6))) & (exists Y5 (id(Y4,Y5) & r4(Y2,Y2,Y5))))) # label(fermattothepoweroftwoid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.54/1.88	21 r1(f6(A)) # label(axiom_4a) # label(axiom).  [clausify(4)].
1.54/1.88	22 r1(f14(A)) # label(axiom_5a) # label(axiom).  [clausify(16)].
1.54/1.88	23 r1(f15(A)) # label(axiom_5a) # label(axiom).  [clausify(16)].
1.54/1.88	24 id(f5(A),A) # label(axiom_4a) # label(axiom).  [clausify(4)].
1.54/1.88	26 id(f13(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(16)].
1.54/1.88	28 r4(A,B,f4(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
1.54/1.88	29 r3(A,f6(A),f5(A)) # label(axiom_4a) # label(axiom).  [clausify(4)].
1.54/1.88	30 r4(A,f14(A),f13(A)) # label(axiom_5a) # label(axiom).  [clausify(16)].
1.54/1.88	43 -r3(A,B,C) | -r4(D,D,A) | -r4(E,E,B) | -id(C,F) | -r4(V6,V6,F) # label(fermattothepoweroftwoid) # label(negated_conjecture).  [clausify(19)].
1.54/1.88	44 id(A,c1) | -r1(A) # label(axiom_1) # label(axiom).  [clausify(15)].
1.54/1.88	46 id(A,B) | -id(B,A) # label(axiom_6) # label(axiom).  [clausify(13)].
1.54/1.88	50 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom).  [clausify(6)].
1.54/1.88	62 -id(A,B) | -id(C,D) | -r4(A,E,C) | r4(B,F,D) | -id(E,F) # label(axiom_11) # label(axiom).  [clausify(14)].
1.54/1.88	78 -id(A,B) | -id(C,D) | -r4(A,A,C) | r4(B,B,D).  [factor(62,a,e)].
1.54/1.88	114 -r4(A,A,f6(f4(B,B))).  [ur(43,a,29,a,b,28,a,d,24,a,e,28,a)].
1.54/1.88	124 id(f6(A),c1).  [resolve(44,b,21,a)].
1.54/1.88	132 id(A,f5(A)).  [resolve(46,b,24,a)].
1.54/1.88	146 r1(f13(A)).  [resolve(50,a,26,a),unit_del(a,23)].
1.54/1.88	147 -r1(A) | r1(f5(A)).  [resolve(50,a,24,a)].
1.54/1.88	296 id(f13(A),c1).  [resolve(146,a,44,b)].
1.54/1.88	333 id(c1,f6(A)).  [resolve(124,a,46,b)].
1.54/1.88	613 r1(f5(f14(A))).  [resolve(147,a,22,a)].
1.54/1.88	831 id(f5(f14(A)),c1).  [resolve(613,a,44,b)].
1.54/1.88	1689 id(c1,f5(f14(A))).  [resolve(831,a,46,b)].
1.54/1.88	3058 -r4(A,A,c1).  [ur(78,a,132,a,b,333,a,d,114,a)].
1.54/1.88	5476 -id(A,f5(f14(A))).  [ur(62,b,296,a,c,30,a,d,3058,a,e,132,a)].
1.54/1.88	5477 $F.  [resolve(5476,a,1689,a)].
1.54/1.88	
1.54/1.88	% SZS output end Refutation
1.54/1.88	============================== end of proof ==========================
1.54/1.88	
1.54/1.88	============================== STATISTICS ============================
1.54/1.88	
1.54/1.88	Given=238. Generated=21958. Kept=5457. proofs=1.
1.54/1.88	Usable=238. Sos=4358. Demods=0. Limbo=574, Disabled=329. Hints=0.
1.54/1.88	Megabytes=2.90.
1.54/1.88	User_CPU=0.85, System_CPU=0.02, Wall_clock=1.
1.54/1.88	
1.54/1.88	============================== end of statistics =====================
1.54/1.88	
1.54/1.88	============================== end of search =========================
1.54/1.88	
1.54/1.88	THEOREM PROVED
1.54/1.88	% SZS status Theorem
1.54/1.88	
1.54/1.88	Exiting with 1 proof.
1.54/1.88	
1.54/1.88	Process 8389 exit (max_proofs) Tue Jul 13 13:37:41 2021
1.54/1.88	Prover9 interrupted
1.54/1.88	EOF