0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n025.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% DateTime   : Thu Jul  2 07:26:03 EDT 2020
0.11/0.32	% CPUTime    : 
2.90/3.20	============================== Prover9 ===============================
2.90/3.20	Prover9 (32) version 2009-11A, November 2009.
2.90/3.20	Process 20547 was started by sandbox2 on n025.cluster.edu,
2.90/3.20	Thu Jul  2 07:26:04 2020
2.90/3.20	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_20387_n025.cluster.edu".
2.90/3.20	============================== end of head ===========================
2.90/3.20	
2.90/3.20	============================== INPUT =================================
2.90/3.20	
2.90/3.20	% Reading from file /tmp/Prover9_20387_n025.cluster.edu
2.90/3.20	
2.90/3.20	set(prolog_style_variables).
2.90/3.20	set(auto2).
2.90/3.20	    % set(auto2) -> set(auto).
2.90/3.20	    % set(auto) -> set(auto_inference).
2.90/3.20	    % set(auto) -> set(auto_setup).
2.90/3.20	    % set(auto_setup) -> set(predicate_elim).
2.90/3.20	    % set(auto_setup) -> assign(eq_defs, unfold).
2.90/3.20	    % set(auto) -> set(auto_limits).
2.90/3.20	    % set(auto_limits) -> assign(max_weight, "100.000").
2.90/3.20	    % set(auto_limits) -> assign(sos_limit, 20000).
2.90/3.20	    % set(auto) -> set(auto_denials).
2.90/3.20	    % set(auto) -> set(auto_process).
2.90/3.20	    % set(auto2) -> assign(new_constants, 1).
2.90/3.20	    % set(auto2) -> assign(fold_denial_max, 3).
2.90/3.20	    % set(auto2) -> assign(max_weight, "200.000").
2.90/3.20	    % set(auto2) -> assign(max_hours, 1).
2.90/3.20	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
2.90/3.20	    % set(auto2) -> assign(max_seconds, 0).
2.90/3.20	    % set(auto2) -> assign(max_minutes, 5).
2.90/3.20	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
2.90/3.20	    % set(auto2) -> set(sort_initial_sos).
2.90/3.20	    % set(auto2) -> assign(sos_limit, -1).
2.90/3.20	    % set(auto2) -> assign(lrs_ticks, 3000).
2.90/3.20	    % set(auto2) -> assign(max_megs, 400).
2.90/3.20	    % set(auto2) -> assign(stats, some).
2.90/3.20	    % set(auto2) -> clear(echo_input).
2.90/3.20	    % set(auto2) -> set(quiet).
2.90/3.20	    % set(auto2) -> clear(print_initial_clauses).
2.90/3.20	    % set(auto2) -> clear(print_given).
2.90/3.20	assign(lrs_ticks,-1).
2.90/3.20	assign(sos_limit,10000).
2.90/3.20	assign(order,kbo).
2.90/3.20	set(lex_order_vars).
2.90/3.20	clear(print_given).
2.90/3.20	
2.90/3.20	% formulas(sos).  % not echoed (1 formulas)
2.90/3.20	
2.90/3.20	============================== end of input ==========================
2.90/3.20	
2.90/3.20	% From the command line: assign(max_seconds, 960).
2.90/3.20	
2.90/3.20	============================== PROCESS NON-CLAUSAL FORMULAS ==========
2.90/3.20	
2.90/3.20	% Formulas that are not ordinary clauses:
2.90/3.20	1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))) -> ((big_f(Y1,Z,Y2) <-> (big_f(Y2,Y3,Y1) -> big_f(Y3,Y1,Y2) & big_f(Y1,Y2,Y3))) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2) & big_f(Y2,Y3,Y1) <-> big_f(Z,Z,Z))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause).  [assumption].
2.90/3.20	
2.90/3.20	============================== end of process non-clausal formulas ===
2.90/3.20	
2.90/3.20	============================== PROCESS INITIAL CLAUSES ===============
2.90/3.20	
2.90/3.20	============================== PREDICATE ELIMINATION =================
2.90/3.20	
2.90/3.20	============================== end predicate elimination =============
2.90/3.20	
2.90/3.20	Auto_denials:  (non-Horn, no changes).
2.90/3.20	
2.90/3.20	Term ordering decisions:
2.90/3.20	Function symbol KB weights:  c1=1. f1=1.
2.90/3.20	
2.90/3.20	============================== end of process initial clauses ========
2.90/3.20	
2.90/3.20	============================== CLAUSES FOR SEARCH ====================
2.90/3.20	
2.90/3.20	============================== end of clauses for search =============
2.90/3.20	
2.90/3.20	============================== SEARCH ================================
2.90/3.20	
2.90/3.20	% Starting search at 0.01 seconds.
2.90/3.20	
2.90/3.20	============================== PROOF =================================
2.90/3.20	% SZS status Theorem
2.90/3.20	% SZS output start Refutation
2.90/3.20	
2.90/3.20	% Proof 1 at 2.17 (+ 0.01) seconds.
2.90/3.20	% Length of proof is 50.
2.90/3.20	% Level of proof is 26.
2.90/3.20	% Maximum clause weight is 40.000.
2.90/3.20	% Given clauses 401.
2.90/3.20	
2.90/3.20	1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))) -> ((big_f(Y1,Z,Y2) <-> (big_f(Y2,Y3,Y1) -> big_f(Y3,Y1,Y2) & big_f(Y1,Y2,Y3))) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2) & big_f(Y2,Y3,Y1) <-> big_f(Z,Z,Z))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause).  [assumption].
2.90/3.20	2 big_f(A,B,f1(B,A,C)) | big_f(C,B,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	3 big_f(A,f1(A,B,C),B) | big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	7 -big_f(A,B,C) | -big_f(C,A,B) | -big_f(B,C,A) | -big_f(f1(A,B,C),f1(A,B,C),f1(A,B,C)) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	9 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(A,C,B) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	10 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(B,A,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	12 -big_f(A,f1(A,B,C),B) | -big_f(B,C,A) | big_f(C,A,B) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	13 -big_f(A,f1(A,B,C),B) | -big_f(B,C,A) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	15 -big_f(f1(A,B,C),B,A) | big_f(C,A,B) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	16 -big_f(f1(A,B,C),B,A) | big_f(B,C,A) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	17 big_f(f1(A,B,C),B,A) | -big_f(C,A,B) | -big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	18 -big_f(A,B,C) | -big_f(c1,c1,f1(A,B,C)) | big_f(C,A,B) | big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
2.90/3.20	22 -big_f(f1(A,A,A),A,A) | big_f(A,A,A).  [factor(15,b,c)].
2.90/3.20	36 big_f(f1(f1(A,B,C),B,A),B,f1(A,B,C)) | -big_f(B,A,f1(A,B,C)) | big_f(B,C,A).  [resolve(17,b,3,a)].
2.90/3.20	38 big_f(f1(A,B,f1(B,A,C)),B,A) | -big_f(f1(B,A,C),A,B) | big_f(A,C,B).  [resolve(17,c,3,a)].
2.90/3.20	40 -big_f(c1,c1,A) | big_f(A,c1,c1) | big_f(c1,A,c1).  [resolve(18,b,2,a),merge(d)].
2.90/3.20	54 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1).  [resolve(40,a,2,a)].
2.90/3.20	70 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1) | big_f(c1,c1,A).  [resolve(54,a,15,a),merge(c)].
2.90/3.20	81 big_f(A,c1,c1) | big_f(c1,c1,A) | -big_f(c1,A,c1).  [resolve(70,a,13,a),merge(d)].
2.90/3.20	84 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1).  [resolve(81,c,3,a)].
2.90/3.20	86 big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1) | big_f(c1,c1,A).  [resolve(84,a,16,a),merge(c)].
2.90/3.20	91 big_f(c1,A,c1) | big_f(c1,c1,A) | -big_f(A,c1,c1).  [resolve(86,a,10,a),merge(d)].
2.90/3.20	156 big_f(f1(c1,c1,f1(c1,c1,A)),c1,c1) | big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)).  [resolve(38,b,84,a),merge(d)].
2.90/3.20	205 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,f1(c1,c1,f1(c1,c1,A)),c1) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))).  [resolve(156,a,91,c)].
2.90/3.20	700 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))) | -big_f(c1,f1(c1,c1,A),c1).  [resolve(205,c,13,a),merge(e)].
2.90/3.20	708 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))).  [resolve(700,d,3,a),merge(d)].
2.90/3.20	717 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | -big_f(f1(c1,c1,A),c1,c1).  [resolve(708,c,10,a),merge(d)].
2.90/3.20	723 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)).  [resolve(717,c,84,a),merge(c),merge(d)].
2.90/3.20	731 big_f(c1,A,c1) | -big_f(A,c1,c1).  [resolve(723,b,9,a),merge(c)].
2.90/3.20	736 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1).  [resolve(731,b,54,a),merge(b)].
2.90/3.20	750 big_f(A,c1,c1) | -big_f(c1,A,c1).  [resolve(736,a,12,a),merge(c)].
2.90/3.20	753 big_f(f1(c1,c1,A),c1,c1) | big_f(A,c1,c1).  [resolve(750,b,736,a)].
2.90/3.20	760 big_f(A,c1,c1) | big_f(c1,c1,A).  [resolve(753,a,15,a),merge(b)].
2.90/3.20	784 big_f(A,c1,c1) | big_f(c1,A,c1).  [resolve(760,b,40,a),merge(b)].
2.90/3.20	795 big_f(c1,A,c1).  [resolve(784,a,731,b),merge(b)].
2.90/3.20	796 big_f(A,c1,c1).  [resolve(784,b,750,b),merge(b)].
2.90/3.20	801 big_f(c1,c1,A).  [resolve(795,a,13,a),unit_del(a,795)].
2.90/3.20	806 -big_f(A,B,C) | big_f(C,A,B) | big_f(B,C,A).  [back_unit_del(18),unit_del(b,801)].
2.90/3.20	810 -big_f(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)).  [ur(7,a,796,a,b,795,a,c,801,a)].
2.90/3.20	812 -big_f(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)).  [ur(7,a,801,a,b,796,a,c,795,a)].
2.90/3.20	831 -big_f(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)).  [ur(22,b,810,a)].
2.90/3.20	833 -big_f(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A)).  [ur(22,b,812,a)].
2.90/3.21	893 big_f(A,B,f1(B,A,C)) | big_f(f1(B,A,C),A,B) | big_f(A,C,B).  [resolve(806,a,3,a)].
2.90/3.21	894 big_f(f1(A,B,C),B,A) | big_f(A,f1(A,B,C),B) | big_f(C,A,B).  [resolve(806,a,2,a)].
2.90/3.21	1030 big_f(f1(A,c1,c1),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))).  [resolve(893,b,831,a),unit_del(b,810)].
2.90/3.21	1055 big_f(f1(c1,c1,A),f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A)).  [resolve(894,a,833,a),unit_del(b,812)].
2.90/3.21	1486 big_f(f1(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))).  [resolve(1030,a,36,b),unit_del(b,810)].
2.90/3.21	1492 -big_f(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1)).  [ur(13,b,1030,a,c,831,a)].
2.90/3.21	1504 -big_f(f1(c1,c1,A),f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A))).  [ur(10,b,1055,a,c,833,a)].
2.90/3.21	1540 $F.  [ur(806,b,1492,a,c,1504,a),unit_del(a,1486)].
2.90/3.21	
2.90/3.21	% SZS output end Refutation
2.90/3.21	============================== end of proof ==========================
2.90/3.21	
2.90/3.21	============================== STATISTICS ============================
2.90/3.21	
2.90/3.21	Given=401. Generated=7128. Kept=1538. proofs=1.
2.90/3.21	Usable=317. Sos=723. Demods=0. Limbo=0, Disabled=515. Hints=0.
2.90/3.21	Megabytes=2.49.
2.90/3.21	User_CPU=2.17, System_CPU=0.01, Wall_clock=2.
2.90/3.21	
2.90/3.21	============================== end of statistics =====================
2.90/3.21	
2.90/3.21	============================== end of search =========================
2.90/3.21	
2.90/3.21	THEOREM PROVED
2.90/3.21	% SZS status Theorem
2.90/3.21	
2.90/3.21	Exiting with 1 proof.
2.90/3.21	
2.90/3.21	Process 20547 exit (max_proofs) Thu Jul  2 07:26:06 2020
2.90/3.21	Prover9 interrupted
2.90/3.21	EOF