0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n019.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% DateTime   : Thu Jul  2 12:55:56 EDT 2020
0.14/0.36	% CPUTime    : 
0.48/1.00	============================== Prover9 ===============================
0.48/1.00	Prover9 (32) version 2009-11A, November 2009.
0.48/1.00	Process 25002 was started by sandbox2 on n019.cluster.edu,
0.48/1.00	Thu Jul  2 12:55:57 2020
0.48/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_24841_n019.cluster.edu".
0.48/1.00	============================== end of head ===========================
0.48/1.00	
0.48/1.00	============================== INPUT =================================
0.48/1.00	
0.48/1.00	% Reading from file /tmp/Prover9_24841_n019.cluster.edu
0.48/1.00	
0.48/1.00	set(prolog_style_variables).
0.48/1.00	set(auto2).
0.48/1.00	    % set(auto2) -> set(auto).
0.48/1.00	    % set(auto) -> set(auto_inference).
0.48/1.00	    % set(auto) -> set(auto_setup).
0.48/1.00	    % set(auto_setup) -> set(predicate_elim).
0.48/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.00	    % set(auto) -> set(auto_limits).
0.48/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.00	    % set(auto) -> set(auto_denials).
0.48/1.00	    % set(auto) -> set(auto_process).
0.48/1.00	    % set(auto2) -> assign(new_constants, 1).
0.48/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.00	    % set(auto2) -> assign(max_hours, 1).
0.48/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.00	    % set(auto2) -> set(sort_initial_sos).
0.48/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.00	    % set(auto2) -> assign(max_megs, 400).
0.48/1.00	    % set(auto2) -> assign(stats, some).
0.48/1.00	    % set(auto2) -> clear(echo_input).
0.48/1.00	    % set(auto2) -> set(quiet).
0.48/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.00	    % set(auto2) -> clear(print_given).
0.48/1.00	assign(lrs_ticks,-1).
0.48/1.00	assign(sos_limit,10000).
0.48/1.00	assign(order,kbo).
0.48/1.00	set(lex_order_vars).
0.48/1.00	clear(print_given).
0.48/1.00	
0.48/1.00	% formulas(sos).  % not echoed (11 formulas)
0.48/1.00	
0.48/1.00	============================== end of input ==========================
0.48/1.00	
0.48/1.00	% From the command line: assign(max_seconds, 960).
0.48/1.00	
0.48/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.00	
0.48/1.00	% Formulas that are not ordinary clauses:
0.48/1.00	1 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	2 (all A all B all C (C = cartesian_product2(A,B) <-> (all D (in(D,C) <-> (exists E exists F (in(F,B) & D = ordered_pair(E,F) & in(E,A))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	3 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(B,D) & in(A,C))) # label(l55_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	4 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	5 (all A all B ((all C (in(C,B) <-> C = A)) <-> singleton(A) = B)) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	8 (all A all B ((all C (in(C,A) <-> in(C,B))) -> B = A)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	9 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	10 (all A all B unordered_pair(B,A) = unordered_pair(A,B)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.48/1.00	11 -(all A all B cartesian_product2(singleton(A),singleton(B)) = singleton(ordered_pair(A,B))) # label(t35_zfmisc_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.00	
0.48/1.00	============================== end of process non-clausal formulas ===
0.48/1.00	
0.48/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.48/1.00	
0.48/1.00	============================== PREDICATE ELIMINATION =================
0.48/1.00	
0.48/1.00	============================== end predicate elimination =============
0.48/1.00	
0.48/1.00	Auto_denials:  (non-Horn, no changes).
0.48/1.00	
0.48/1.00	Term ordering decisions:
0.48/1.00	
0.48/1.00	% Assigning unary symbol singleton kb_weight 0 andAlarm clock 
119.78/120.03	Prover9 interrupted
119.78/120.04	EOF