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