0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer   : n028.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% DateTime   : Thu Jul  2 15:39:22 EDT 2020
0.10/0.32	% CPUTime    : 
0.74/1.07	============================== Prover9 ===============================
0.74/1.07	Prover9 (32) version 2009-11A, November 2009.
0.74/1.07	Process 7934 was started by sandbox2 on n028.cluster.edu,
0.74/1.07	Thu Jul  2 15:39:22 2020
0.74/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7780_n028.cluster.edu".
0.74/1.07	============================== end of head ===========================
0.74/1.07	
0.74/1.07	============================== INPUT =================================
0.74/1.07	
0.74/1.07	% Reading from file /tmp/Prover9_7780_n028.cluster.edu
0.74/1.07	
0.74/1.07	set(prolog_style_variables).
0.74/1.07	set(auto2).
0.74/1.07	    % set(auto2) -> set(auto).
0.74/1.07	    % set(auto) -> set(auto_inference).
0.74/1.07	    % set(auto) -> set(auto_setup).
0.74/1.07	    % set(auto_setup) -> set(predicate_elim).
0.74/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.07	    % set(auto) -> set(auto_limits).
0.74/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.07	    % set(auto) -> set(auto_denials).
0.74/1.07	    % set(auto) -> set(auto_process).
0.74/1.07	    % set(auto2) -> assign(new_constants, 1).
0.74/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.07	    % set(auto2) -> assign(max_hours, 1).
0.74/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.07	    % set(auto2) -> set(sort_initial_sos).
0.74/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.07	    % set(auto2) -> assign(max_megs, 400).
0.74/1.07	    % set(auto2) -> assign(stats, some).
0.74/1.07	    % set(auto2) -> clear(echo_input).
0.74/1.07	    % set(auto2) -> set(quiet).
0.74/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.07	    % set(auto2) -> clear(print_given).
0.74/1.07	assign(lrs_ticks,-1).
0.74/1.07	assign(sos_limit,10000).
0.74/1.07	assign(order,kbo).
0.74/1.07	set(lex_order_vars).
0.74/1.07	clear(print_given).
0.74/1.07	
0.74/1.07	% formulas(sos).  % not echoed (41 formulas)
0.74/1.07	
0.74/1.07	============================== end of input ==========================
0.74/1.07	
0.74/1.07	% From the command line: assign(max_seconds, 960).
0.74/1.07	
0.74/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.07	
0.74/1.07	% Formulas that are not ordinary clauses:
0.74/1.07	1 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	2 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	3 (all A all B (r1_tarski(A,B) <-> m1_subset_1(A,k1_zfmisc_1(B)))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	4 (all A all B (r1_tarski(B,A) & r1_tarski(A,B) <-> B = A)) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	5 (all A all B all C -(v1_xboole_0(C) & m1_subset_1(B,k1_zfmisc_1(C)) & r2_hidden(A,B))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	6 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	7 (all A exists B (v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	8 (all A all B (r2_hidden(A,k3_pua2mss1(B)) <-> (exists C (A = k1_tarski(C) & r2_hidden(C,B))))) # label(t1_relset_2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	9 (all A -v1_xboole_0(k1_tarski(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	10 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	11 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	12 (all A all B -(v1_xboole_0(A) & v1_xboole_0(B) & B != A)) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	13 (exists A (v1_xboole_0(A) & v1_relat_1(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	14 (all A all B -(r2_hidden(A,B) & v1_xboole_0(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	15 (exists A (v1_relat_1(A) & -v1_xboole_0(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	16 (all A all B all C ((all D (r2_hidden(D,C) <-> r2_hidden(D,A) & -r2_hidden(D,B))) <-> C = k4_xboole_0(A,B))) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	17 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	18 (all A k4_xboole_0(A,k1_xboole_0) = A) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	19 (all A exists B m1_eqrel_1(B,A)) # label(existence_m1_eqrel_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	20 (all A k4_xboole_0(k1_xboole_0,A) = k1_xboole_0) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	21 (all A (v1_xboole_0(A) -> k1_xboole_0 = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	22 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	23 (all A (v1_xboole_0(A) -> v1_relat_1(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	24 (all A all B (m1_subset_1(A,B) -> r2_hidden(A,B) | v1_xboole_0(B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	25 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k4_xboole_0(A,B)))) # label(fc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	26 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	27 (all A all B (m1_eqrel_1(B,A) -> m1_subset_1(B,k1_zfmisc_1(k1_zfmisc_1(A))))) # label(dt_m1_eqrel_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	28 (all A (-v1_xboole_0(A) -> (exists B (-v1_xboole_0(B) & m1_subset_1(B,k1_zfmisc_1(A)))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	29 (all A all B (r1_tarski(k1_tarski(A),k1_tarski(B)) -> B = A)) # label(t6_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	30 (all A all B ((all C (r2_hidden(C,A) -> r2_hidden(C,B))) <-> r1_tarski(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	31 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	32 (exists A (v1_relat_1(A) & v3_relat_1(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	33 (all A m1_eqrel_1(k3_pua2mss1(A),A)) # label(dt_k3_pua2mss1) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	34 (all A all B all C (r2_hidden(A,B) & m1_subset_1(B,k1_zfmisc_1(C)) -> m1_subset_1(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	35 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
1.25/1.53	36 -(all A all B k4_xboole_0(k3_pua2mss1(A),k3_pua2mss1(B)) = k3_pua2mss1(k4_xboole_0(A,B))) # label(t5_relset_2) # label(negated_conjecture) # label(non_clause).  [assumption].
1.25/1.53	
1.25/1.53	============================== end of process non-clausal formulas ===
1.25/1.53	
1.25/1.53	============================== PROCESS INITIAL CLAUSES ===============
1.25/1.53	
1.25/1.53	============================== PREDICATE ELIMINATION =================
1.25/1.53	37 -m1_eqrel_1(A,B) | m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))) # label(dt_m1_eqrel_1) # label(axiom).  [clausify(27)].
1.25/1.53	38 m1_eqrel_1(f5(A),A) # label(existence_m1_eqrel_1) # label(axiom).  [clausify(19)].
1.25/1.53	39 m1_eqrel_1(k3_pua2mss1(A),A) # label(dt_k3_pua2mss1) # label(axiom).  [clausify(33)].
1.25/1.53	Derived: m1_subset_1(f5(A),k1_zfmisc_1(k1_zfmisc_1(A))).  [resolve(37,a,38,a)].
1.25/1.53	Derived: m1_subset_1(k3_pua2mss1(A),k1_zfmisc_1(k1_zfmisc_1(A))).  [resolve(37,a,39,a)].
1.25/1.53	
1.25/1.53	============================== end predicate elimination =============
1.25/1.53	
1.25/1.53	Auto_denials:  (non-Horn, no changes).
1.25/1.53	
1.25/1.53	Term ordering decisions:
1.25/1.53	Function symbol KB weights:  k1_xboole_0=1. c1=1. c2=1. c3=1. c4=1. c5=1. k4_xboole_0=1. f2=1. f7=1. k1_zfmisc_1=1. k1_tarski=1. k3_pua2mss1=1. f1=1. f3=1. f5=1. f6=1. f4=1.
1.25/1.53	
1.25/1.53	============================== end of process initial clauses ========
1.25/1.53	
1.25/1.53	============================== CLAUSES FOR SEARCH ====================
1.25/1.53	
1.25/1.53	============================== end of clauses for search =============
1.25/1.53	
1.25/1.53	============================== SEARCH ================================
1.25/1.53	
1.25/1.53	% Starting search at 0.01 seconds.
1.25/1.53	
1.25/1.53	Low Water (keep): wt=27.000, iters=3424
1.25/1.53	
1.25/1.53	Low Water (keep): wt=23.000, iters=3360
1.25/1.53	
1.25/1.53	Low Water (keep): wt=20.000, iters=3351
1.25/1.53	
1.25/1.53	Low Water (keep): wt=19.000, itAlarm clock 
119.64/120.03	Prover9 interrupted
119.64/120.03	EOF