0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n015.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   : 1200
0.13/0.34	% DateTime   : Tue Jul 13 17:06:04 EDT 2021
0.13/0.34	% CPUTime    : 
0.76/1.06	============================== Prover9 ===============================
0.76/1.06	Prover9 (32) version 2009-11A, November 2009.
0.76/1.06	Process 24165 was started by sandbox2 on n015.cluster.edu,
0.76/1.06	Tue Jul 13 17:06:05 2021
0.76/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_23972_n015.cluster.edu".
0.76/1.06	============================== end of head ===========================
0.76/1.06	
0.76/1.06	============================== INPUT =================================
0.76/1.06	
0.76/1.06	% Reading from file /tmp/Prover9_23972_n015.cluster.edu
0.76/1.06	
0.76/1.06	set(prolog_style_variables).
0.76/1.06	set(auto2).
0.76/1.06	    % set(auto2) -> set(auto).
0.76/1.06	    % set(auto) -> set(auto_inference).
0.76/1.06	    % set(auto) -> set(auto_setup).
0.76/1.06	    % set(auto_setup) -> set(predicate_elim).
0.76/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.06	    % set(auto) -> set(auto_limits).
0.76/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.06	    % set(auto) -> set(auto_denials).
0.76/1.06	    % set(auto) -> set(auto_process).
0.76/1.06	    % set(auto2) -> assign(new_constants, 1).
0.76/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.06	    % set(auto2) -> assign(max_hours, 1).
0.76/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.06	    % set(auto2) -> set(sort_initial_sos).
0.76/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.06	    % set(auto2) -> assign(max_megs, 400).
0.76/1.06	    % set(auto2) -> assign(stats, some).
0.76/1.06	    % set(auto2) -> clear(echo_input).
0.76/1.06	    % set(auto2) -> set(quiet).
0.76/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.06	    % set(auto2) -> clear(print_given).
0.76/1.06	assign(lrs_ticks,-1).
0.76/1.06	assign(sos_limit,10000).
0.76/1.06	assign(order,kbo).
0.76/1.06	set(lex_order_vars).
0.76/1.06	clear(print_given).
0.76/1.06	
0.76/1.06	% formulas(sos).  % not echoed (44 formulas)
0.76/1.06	
0.76/1.06	============================== end of input ==========================
0.76/1.06	
0.76/1.06	% From the command line: assign(max_seconds, 1200).
0.76/1.06	
0.76/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.06	
0.76/1.06	% Formulas that are not ordinary clauses:
0.76/1.06	1 (all A empty_set = set_difference(empty_set,A)) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	2 (exists A (ordinal(A) & epsilon_connected(A) & epsilon_transitive(A))) # label(rc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	3 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	4 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	5 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	6 (all A (empty(A) -> empty_set = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	7 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	8 (all A all B (relation(B) & relation(A) -> relation(set_difference(A,B)))) # label(fc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	9 (all A all B all C ((all D (in(D,C) <-> in(D,A) & -in(D,B))) <-> set_difference(A,B) = C)) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	10 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	11 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	12 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	13 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	14 (all A all B all C -(empty(C) & element(B,powerset(C)) & in(A,B))) # label(t5_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	15 (all A ((all B all C -(in(B,A) & C != B & -in(C,B) & -in(B,C) & in(C,A))) <-> epsilon_connected(A))) # label(d3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	16 (all A all B all C -(in(A,B) & in(B,C) & in(C,A))) # label(t3_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	17 (exists A (relation(A) & relation_empty_yielding(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	18 (all A (ordinal(A) -> epsilon_connected(A) & epsilon_transitive(A))) # label(cc1_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	19 (all A all B -(empty(B) & B != A & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	20 (exists A (relation(A) & function(A) & empty(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	21 (all A (epsilon_connected(A) & epsilon_transitive(A) -> ordinal(A))) # label(cc2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	22 (all A all B all C (element(B,powerset(C)) & in(A,B) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	23 (all A (ordinal(A) <-> epsilon_connected(A) & epsilon_transitive(A))) # label(d4_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	24 (all A all B -((all C -(in(C,B) & (all D -(in(D,C) & in(D,B))))) & in(A,B))) # label(t7_tarski) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	25 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	26 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	27 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	28 (exists A (relation(A) & function(A) & relation_empty_yielding(A))) # label(rc4_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	29 (all A ((all B (in(B,A) -> subset(B,A))) <-> epsilon_transitive(A))) # label(d2_ordinal1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	30 (all A all B (subset(A,B) <-> element(A,powerset(B)))) # label(t3_subset) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	31 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	32 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	33 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	34 (all A (relation(A) & empty(A) & function(A) -> relation(A) & function(A) & one_to_one(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	35 (exists A (relation_non_empty(A) & function(A) & relation(A))) # label(rc5_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	36 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	37 (exists A (function(A) & one_to_one(A) & relation(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.06	38 -(all A all B (ordinal(B) -> (in(A,B) -> ordinal(A)))) # label(t23_ordinal1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.76/1.06	
0.76/1.06	============================== end of process non-clausal formulas ===
0.76/1.06	
0.76/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.76/1.06	
0.76/1.06	============================== PREDICATE ELIMINATION =================
0.76/1.06	39 -epsilon_connected(A) | -epsilon_transitive(A) | ordinal(A) # label(cc2_ordinal1) # label(axiom).  [clausify(21)].
0.76/1.06	40 epsilon_connected(c1) # label(rc1_ordinal1) # label(axiom).  [clausify(2)].
0.76/1.06	41 in(f2(A),A) | epsilon_connected(A) # label(d3_ordinal1) # label(axiom).  [clausify(15)].
0.76/1.06	42 in(f3(A),A) | epsilon_connected(A) # label(d3_ordinal1) # label(axiom).  [clausify(15)].
0.76/1.06	43 -ordinal(A) | epsilon_connected(A) # label(cc1_ordinal1) # label(axiom).  [clausify(18)].
0.76/1.06	44 -ordinal(A) | epsilon_connected(A) # label(d4_ordinal1) # label(axiom).  [clausify(23)].
0.76/1.06	Derived: -epsilon_transitive(c1) | ordinal(c1).  [resolve(39,a,40,a)].
0.76/1.06	Derived: -epsilon_transitive(A) | ordinal(A) | in(f2(A),A).  [resolve(39,a,41,b)].
0.76/1.06	Derived: -epsilon_transitive(A) | ordinal(A) | in(f3(A),A).  [resolve(39,a,42,b)].
0.76/1.06	45 ordinal(A) | -epsilon_connected(A) | -epsilon_transitive(A) # label(d4_ordinal1) # label(axiom).  [clausify(23)].
0.76/1.06	46 f3(A) != Alarm clock 
119.86/120.11	Prover9 interrupted
119.86/120.11	EOF