0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n006.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% DateTime   : Tue Jul 13 10:47:40 EDT 2021
0.14/0.36	% CPUTime    : 
0.49/1.06	============================== Prover9 ===============================
0.49/1.06	Prover9 (32) version 2009-11A, November 2009.
0.49/1.06	Process 22470 was started by sandbox2 on n006.cluster.edu,
0.49/1.06	Tue Jul 13 10:47:41 2021
0.49/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_22316_n006.cluster.edu".
0.49/1.06	============================== end of head ===========================
0.49/1.06	
0.49/1.06	============================== INPUT =================================
0.49/1.06	
0.49/1.06	% Reading from file /tmp/Prover9_22316_n006.cluster.edu
0.49/1.06	
0.49/1.06	set(prolog_style_variables).
0.49/1.06	set(auto2).
0.49/1.06	    % set(auto2) -> set(auto).
0.49/1.06	    % set(auto) -> set(auto_inference).
0.49/1.06	    % set(auto) -> set(auto_setup).
0.49/1.06	    % set(auto_setup) -> set(predicate_elim).
0.49/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.49/1.06	    % set(auto) -> set(auto_limits).
0.49/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.49/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.49/1.06	    % set(auto) -> set(auto_denials).
0.49/1.06	    % set(auto) -> set(auto_process).
0.49/1.06	    % set(auto2) -> assign(new_constants, 1).
0.49/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.49/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.49/1.06	    % set(auto2) -> assign(max_hours, 1).
0.49/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.49/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.49/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.49/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.49/1.06	    % set(auto2) -> set(sort_initial_sos).
0.49/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.49/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.49/1.06	    % set(auto2) -> assign(max_megs, 400).
0.49/1.06	    % set(auto2) -> assign(stats, some).
0.49/1.06	    % set(auto2) -> clear(echo_input).
0.49/1.06	    % set(auto2) -> set(quiet).
0.49/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.49/1.06	    % set(auto2) -> clear(print_given).
0.49/1.06	assign(lrs_ticks,-1).
0.49/1.06	assign(sos_limit,10000).
0.49/1.06	assign(order,kbo).
0.49/1.06	set(lex_order_vars).
0.49/1.06	clear(print_given).
0.49/1.06	
0.49/1.06	% formulas(sos).  % not echoed (1 formulas)
0.49/1.06	
0.49/1.06	============================== end of input ==========================
0.49/1.06	
0.49/1.06	% From the command line: assign(max_seconds, 1200).
0.49/1.06	
0.49/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.49/1.06	
0.49/1.06	% Formulas that are not ordinary clauses:
0.49/1.06	1 -((exists X all E exists N all W (big_s(N,W) -> big_d(W,X,E))) & (all E exists D all A all B (big_d(A,B,D) -> (all Y all Z (big_f(B,Z) & big_f(A,Y) -> big_d(Y,Z,E))))) & (all X exists Y big_f(X,Y)) -> (exists Y all E exists M all W (big_s(M,W) -> (all Z (big_f(W,Z) -> big_d(Z,Y,E)))))) # label(x2138) # label(negated_conjecture) # label(non_clause).  [assumption].
0.49/1.06	
0.49/1.06	============================== end of process non-clausal formulas ===
0.49/1.06	
0.49/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.49/1.06	
0.49/1.06	============================== PREDICATE ELIMINATION =================
0.49/1.06	2 -big_s(f1(A),B) | big_d(B,c1,A) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	3 big_s(A,f5(B,A)) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	Derived: big_d(f5(A,f1(B)),c1,B).  [resolve(2,a,3,a)].
0.49/1.06	
0.49/1.06	============================== end predicate elimination =============
0.49/1.06	
0.49/1.06	Auto_denials:
0.49/1.06	  % copying label x2138 to answer in negative clause
0.49/1.06	
0.49/1.06	Term ordering decisions:
0.49/1.06	Function symbol KB weights:  c1=1. f5=1. f6=1. f1=1. f2=1. f3=1. f4=1.
0.49/1.06	
0.49/1.06	============================== end of process initial clauses ========
0.49/1.06	
0.49/1.06	============================== CLAUSES FOR SEARCH ====================
0.49/1.06	
0.49/1.06	============================== end of clauses for search =============
0.49/1.06	
0.49/1.06	============================== SEARCH ================================
0.49/1.06	
0.49/1.06	% Starting search at 0.01 seconds.
0.49/1.06	
0.49/1.06	============================== PROOF =================================
0.49/1.06	% SZS status Theorem
0.49/1.06	% SZS output start Refutation
0.49/1.06	
0.49/1.06	% Proof 1 at 0.01 (+ 0.00) seconds: x2138.
0.49/1.06	% Length of proof is 10.
0.49/1.06	% Level of proof is 4.
0.49/1.06	% Maximum clause weight is 15.000.
0.49/1.06	% Given clauses 5.
0.49/1.06	
0.49/1.06	1 -((exists X all E exists N all W (big_s(N,W) -> big_d(W,X,E))) & (all E exists D all A all B (big_d(A,B,D) -> (all Y all Z (big_f(B,Z) & big_f(A,Y) -> big_d(Y,Z,E))))) & (all X exists Y big_f(X,Y)) -> (exists Y all E exists M all W (big_s(M,W) -> (all Z (big_f(W,Z) -> big_d(Z,Y,E)))))) # label(x2138) # label(negated_conjecture) # label(non_clause).  [assumption].
0.49/1.06	2 -big_s(f1(A),B) | big_d(B,c1,A) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	3 big_s(A,f5(B,A)) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	4 big_f(A,f3(A)) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	5 big_f(f5(A,B),f6(A,B)) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	6 -big_d(f6(A,B),A,f4(A)) # label(x2138) # label(negated_conjecture) # answer(x2138).  [clausify(1)].
0.49/1.06	7 -big_d(A,B,f2(C)) | -big_f(B,D) | -big_f(A,E) | big_d(E,D,C) # label(x2138) # label(negated_conjecture).  [clausify(1)].
0.49/1.06	8 big_d(f5(A,f1(B)),c1,B).  [resolve(2,a,3,a)].
0.49/1.06	9 big_d(f6(A,f1(f2(B))),f3(c1),B).  [hyper(7,a,8,a,b,4,a,c,5,a)].
0.49/1.06	10 $F # answer(x2138).  [resolve(9,a,6,a)].
0.49/1.06	
0.49/1.06	% SZS output end Refutation
0.49/1.06	============================== end of proof ==========================
0.49/1.06	
0.49/1.06	============================== STATISTICS ============================
0.49/1.06	
0.49/1.06	Given=5. Generated=6. Kept=6. proofs=1.
0.49/1.06	Usable=5. Sos=0. Demods=0. Limbo=0, Disabled=7. Hints=0.
0.49/1.06	Megabytes=0.04.
0.49/1.06	User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
0.49/1.06	
0.49/1.06	============================== end of statistics =====================
0.49/1.06	
0.49/1.06	============================== end of search =========================
0.49/1.06	
0.49/1.06	THEOREM PROVED
0.49/1.06	% SZS status Theorem
0.49/1.06	
0.49/1.06	Exiting with 1 proof.
0.49/1.06	
0.49/1.06	Process 22470 exit (max_proofs) Tue Jul 13 10:47:41 2021
0.49/1.06	Prover9 interrupted
0.49/1.06	EOF