0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n025.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 15:21:30 EDT 2019
0.12/0.34	% CPUTime    : 
0.73/1.02	============================== Prover9 ===============================
0.73/1.02	Prover9 (32) version 2009-11A, November 2009.
0.73/1.02	Process 19611 was started by sandbox on n025.cluster.edu,
0.73/1.02	Thu Aug 29 15:21:31 2019
0.73/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_19458_n025.cluster.edu".
0.73/1.02	============================== end of head ===========================
0.73/1.02	
0.73/1.02	============================== INPUT =================================
0.73/1.02	
0.73/1.02	% Reading from file /tmp/Prover9_19458_n025.cluster.edu
0.73/1.02	
0.73/1.02	set(prolog_style_variables).
0.73/1.02	set(auto2).
0.73/1.02	    % set(auto2) -> set(auto).
0.73/1.02	    % set(auto) -> set(auto_inference).
0.73/1.02	    % set(auto) -> set(auto_setup).
0.73/1.02	    % set(auto_setup) -> set(predicate_elim).
0.73/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.02	    % set(auto) -> set(auto_limits).
0.73/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.02	    % set(auto) -> set(auto_denials).
0.73/1.02	    % set(auto) -> set(auto_process).
0.73/1.02	    % set(auto2) -> assign(new_constants, 1).
0.73/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.02	    % set(auto2) -> assign(max_hours, 1).
0.73/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.02	    % set(auto2) -> set(sort_initial_sos).
0.73/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.02	    % set(auto2) -> assign(max_megs, 400).
0.73/1.02	    % set(auto2) -> assign(stats, some).
0.73/1.02	    % set(auto2) -> clear(echo_input).
0.73/1.02	    % set(auto2) -> set(quiet).
0.73/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.02	    % set(auto2) -> clear(print_given).
0.73/1.02	assign(lrs_ticks,-1).
0.73/1.02	assign(sos_limit,10000).
0.73/1.02	assign(order,kbo).
0.73/1.02	set(lex_order_vars).
0.73/1.02	clear(print_given).
0.73/1.02	
0.73/1.02	% formulas(sos).  % not echoed (46 formulas)
0.73/1.02	
0.73/1.02	============================== end of input ==========================
0.73/1.02	
0.73/1.02	% From the command line: assign(max_seconds, 180).
0.73/1.02	
0.73/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.02	
0.73/1.02	% Formulas that are not ordinary clauses:
0.73/1.02	1 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	2 (exists A (v1_relat_1(A) & v1_xboole_0(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	3 (all A all B A = k3_xboole_0(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	4 (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].
0.73/1.02	5 (all A all B all C ((all D (r2_hidden(D,B) & r2_hidden(D,A) <-> r2_hidden(D,C))) <-> C = k3_xboole_0(A,B))) # label(d3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	6 (all A all B (r1_tarski(A,B) <-> (all C (r2_hidden(C,A) -> r2_hidden(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	7 (all A all B -v1_xboole_0(k2_tarski(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	8 (all A all B (r2_hidden(A,B) -> m1_subset_1(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	9 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	10 (all A all B k2_tarski(B,A) = k2_tarski(A,B)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	11 (exists A (-v1_xboole_0(A) & v1_relat_1(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	12 (all A exists B m1_eqrel_1(B,A)) # label(existence_m1_eqrel_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	13 (all A (-v1_xboole_0(A) -> (exists B (m1_subset_1(B,k1_zfmisc_1(A)) & -v1_xboole_0(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	14 (exists A (v3_relat_1(A) & v1_relat_1(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	15 (all A k1_xboole_0 = k3_xboole_0(A,k1_xboole_0)) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	16 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	17 (all A m1_eqrel_1(k3_pua2mss1(A),A)) # label(dt_k3_pua2mss1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	18 (all A all B -(v1_xboole_0(A) & A != B & v1_xboole_0(B))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	19 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	20 (all A all B (r2_hidden(A,B) -> -r2_hidden(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	21 (all A (v1_xboole_0(A) -> k1_xboole_0 = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	22 (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.73/1.03	23 (all A (v1_relat_1(A) -> (all B all C (C = k9_relat_1(A,B) <-> (all D ((exists E (r2_hidden(k4_tarski(E,D),A) & r2_hidden(E,B))) <-> r2_hidden(D,C))))))) # label(d13_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	24 (all A -v1_xboole_0(k1_zfmisc_1(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	25 (all A all B (v1_relat_1(A) & v1_relat_1(B) -> v1_relat_1(k3_xboole_0(A,B)))) # label(fc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	26 (all A all B -(v1_xboole_0(B) & r2_hidden(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	27 (all A (v1_xboole_0(A) -> v1_relat_1(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	28 (all A exists B m1_subset_1(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	29 (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].
0.73/1.03	30 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	31 (all A all B k3_xboole_0(B,A) = k3_xboole_0(A,B)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	32 (all A exists B (m1_subset_1(B,k1_zfmisc_1(A)) & v1_xboole_0(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	33 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	34 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	35 (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].
0.73/1.03	36 (all A all B k4_tarski(A,B) = k2_tarski(k2_tarski(A,B),k1_tarski(A))) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	37 (all A all B r1_tarski(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	38 (all A all B all C -(r2_hidden(A,B) & v1_xboole_0(C) & m1_subset_1(B,k1_zfmisc_1(C)))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	39 (all A -v1_xboole_0(k1_tarski(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	40 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	41 -(all A all B (v1_relat_1(B) -> (all C (v1_relat_1(C) -> r1_tarski(k9_relat_1(k3_xboole_0(B,C),k3_pua2mss1(A)),k3_xboole_0(k9_relat_1(B,k3_pua2mss1(A)),k9_relat_1(C,k3_pua2mss1(A)))))))) # label(t13_relset_2) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.03	
0.73/1.03	============================== end of process non-clausal formulas ===
0.73/1.03	
0.73/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.03	
0.73/1.03	============================== PREDICATE ELIMINATION =================
0.73/1.03	42 -m1_eqrel_1(A,B) | m1_subset_1(A,k1_zfmisc_1(k1_zfmisc_1(B))) # label(dt_m1_eqrel_1) # label(axiom).  [clausify(35)].
0.73/1.03	43 m1_eqrel_1(f3(A),A) # label(existence_m1_eqrel_1) # label(axiom).  [clausify(12)].
0.73/1.03	44 m1_eqrel_1(k3_pua2mss1(A),A) # label(dt_k3_pua2mss1) # label(axiom).  [clausify(17)].
0.73/1.03	Derived: m1_subset_1(f3(A),k1_zfmisc_1(k1_zfmisc_1(A))).  [resolve(42,a,43,a)].
0.73/1.03	Derived: m1_subset_1(k3_pua2mss1(A),k1_zfmisc_1(k1_zfmisc_1(A))).  [resolve(42,a,44,a)].
0.73/1.03	
0.73/1.03	============================== end predicate elimination =============
0.73/1.03	
0.73/1.03	Auto_denials:  (non-Horn, no changes).
0.73/1.03	
0.73/1.03	Term ordeCputime limit exceeded (core dumped)
180.05/180.34	EOF