0.07/0.21	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.21	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.42	% Computer   : n017.cluster.edu
0.12/0.42	% Model      : x86_64 x86_64
0.12/0.42	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.42	% Memory     : 8042.1875MB
0.12/0.42	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.42	% CPULimit   : 960
0.12/0.42	% DateTime   : Thu Jul  2 07:05:08 EDT 2020
0.12/0.42	% CPUTime    : 
0.73/1.09	============================== Prover9 ===============================
0.73/1.09	Prover9 (32) version 2009-11A, November 2009.
0.73/1.09	Process 4970 was started by sandbox2 on n017.cluster.edu,
0.73/1.09	Thu Jul  2 07:05:08 2020
0.73/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_4817_n017.cluster.edu".
0.73/1.09	============================== end of head ===========================
0.73/1.09	
0.73/1.09	============================== INPUT =================================
0.73/1.09	
0.73/1.09	% Reading from file /tmp/Prover9_4817_n017.cluster.edu
0.73/1.09	
0.73/1.09	set(prolog_style_variables).
0.73/1.09	set(auto2).
0.73/1.09	    % set(auto2) -> set(auto).
0.73/1.09	    % set(auto) -> set(auto_inference).
0.73/1.09	    % set(auto) -> set(auto_setup).
0.73/1.09	    % set(auto_setup) -> set(predicate_elim).
0.73/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.09	    % set(auto) -> set(auto_limits).
0.73/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.09	    % set(auto) -> set(auto_denials).
0.73/1.09	    % set(auto) -> set(auto_process).
0.73/1.09	    % set(auto2) -> assign(new_constants, 1).
0.73/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.09	    % set(auto2) -> assign(max_hours, 1).
0.73/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.09	    % set(auto2) -> set(sort_initial_sos).
0.73/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.09	    % set(auto2) -> assign(max_megs, 400).
0.73/1.09	    % set(auto2) -> assign(stats, some).
0.73/1.09	    % set(auto2) -> clear(echo_input).
0.73/1.09	    % set(auto2) -> set(quiet).
0.73/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.09	    % set(auto2) -> clear(print_given).
0.73/1.09	assign(lrs_ticks,-1).
0.73/1.09	assign(sos_limit,10000).
0.73/1.09	assign(order,kbo).
0.73/1.09	set(lex_order_vars).
0.73/1.09	clear(print_given).
0.73/1.09	
0.73/1.09	% formulas(sos).  % not echoed (2 formulas)
0.73/1.09	
0.73/1.09	============================== end of input ==========================
0.73/1.09	
0.73/1.09	% From the command line: assign(max_seconds, 960).
0.73/1.09	
0.73/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.09	
0.73/1.09	% Formulas that are not ordinary clauses:
0.73/1.09	1 (exists A exists B exists C (predicate2(C,kill,A,AuntAgatha) & (all F all G all H (predicate2(H,kill,F,G) -> (exists I predicate2(I,hate,F,G)))) & (all J -(exists K exists L exists M (predicate2(L,kill,J,K) & property2(M,rich,comp_than,K) & J = M))) & (all N all O (predicate2(O,hate,AuntAgatha,N) -> -(exists P predicate2(P,hate,Charles,N)))) & -(exists Q predicate2(Q,hate,AuntAgatha,Butler)) & (all R (R != Butler -> (exists S predicate2(S,hate,AuntAgatha,R)))) & (all T (-(exists U (T = U & property2(U,rich,comp_than,AuntAgatha))) -> (exists V predicate2(V,hate,Butler,T)))) & (all W all X (predicate2(X,hate,AuntAgatha,W) -> (exists Y predicate2(Y,hate,Butler,W)))) & (all Z -(all A1 exists B1 predicate2(B1,hate,Z,A1))) & Butler != AuntAgatha & (all D all E (predicate1(E,live,D) & modifier_pp(E,in,DreadburyMansion) -> D = Butler | D = Charles | D = AuntAgatha)) & modifier_pp(B,in,DreadburyMansion) & predicate1(B,live,A))) # label(background) # label(axiom) # label(non_clause).  [assumption].
0.73/1.09	2 -(exists A predicate2(A,kill,AuntAgatha,AuntAgatha)) # label(prove) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.09	
0.73/1.09	============================== end of process non-clausal formulas ===
0.73/1.09	
0.73/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.09	
0.73/1.09	============================== PREDICATE ELIMINATION =================
0.73/1.09	
0.73/1.09	============================== end predicate elimination =============
0.73/1.09	
0.73/1.09	Auto_denials:  (non-Horn, no changes).
0.73/1.09	
0.73/1.09	Term ordering decisions:
0.73/1.09	Function symbol KB weights:  hate=1. in=1. kill=1. live=1. comp_than=1. rich=1. f1=1. f2=1. f3=1. f5=1. f6=1. f7=1. f9=1. f8=1. f4=1.
0.73/1.09	
0.73/1.09	============================== PROOF =================================
0.73/1.09	% SZS status Theorem
0.73/1.09	% SZS output start Refutation
0.73/1.09	
0.73/1.09	% Proof 1 at 0.01 (+ 0.00) seconds.
0.73/1.09	% Length of proof is 3.
0.73/1.09	% Level of proof is 2.
0.73/1.09	% Maximum clause weight is 0.000.
0.73/1.09	% Given clauses 0.
0.73/1.09	
0.73/1.09	1 (exists A exists B exists C (predicate2(C,kill,A,AuntAgatha) & (all F all G all H (predicate2(H,kill,F,G) -> (exists I predicate2(I,hate,F,G)))) & (all J -(exists K exists L exists M (predicate2(L,kill,J,K) & property2(M,rich,comp_than,K) & J = M))) & (all N all O (predicate2(O,hate,AuntAgatha,N) -> -(exists P predicate2(P,hate,Charles,N)))) & -(exists Q predicate2(Q,hate,AuntAgatha,Butler)) & (all R (R != Butler -> (exists S predicate2(S,hate,AuntAgatha,R)))) & (all T (-(exists U (T = U & property2(U,rich,comp_than,AuntAgatha))) -> (exists V predicate2(V,hate,Butler,T)))) & (all W all X (predicate2(X,hate,AuntAgatha,W) -> (exists Y predicate2(Y,hate,Butler,W)))) & (all Z -(all A1 exists B1 predicate2(B1,hate,Z,A1))) & Butler != AuntAgatha & (all D all E (predicate1(E,live,D) & modifier_pp(E,in,DreadburyMansion) -> D = Butler | D = Charles | D = AuntAgatha)) & modifier_pp(B,in,DreadburyMansion) & predicate1(B,live,A))) # label(background) # label(axiom) # label(non_clause).  [assumption].
0.73/1.09	9 A != B # label(background) # label(axiom).  [clausify(1)].
0.73/1.09	10 $F.  [copy(9),xx(a)].
0.73/1.09	
0.73/1.09	% SZS output end Refutation
0.73/1.09	============================== end of proof ==========================
0.73/1.09	
0.73/1.09	============================== STATISTICS ============================
0.73/1.09	
0.73/1.09	Given=0. Generated=7. Kept=6. proofs=1.
0.73/1.09	Usable=0. Sos=0. Demods=0. Limbo=6, Disabled=7. Hints=0.
0.73/1.09	Megabytes=0.07.
0.73/1.09	User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
0.73/1.09	
0.73/1.09	============================== end of statistics =====================
0.73/1.09	
0.73/1.09	============================== end of search =========================
0.73/1.09	
0.73/1.09	THEOREM PROVED
0.73/1.09	% SZS status Theorem
0.73/1.09	
0.73/1.09	Exiting with 1 proof.
0.73/1.09	
0.73/1.09	Process 4970 exit (max_proofs) Thu Jul  2 07:05:08 2020
0.73/1.09	Prover9 interrupted
0.73/1.09	EOF