0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n012.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 16:59:46 EDT 2021
0.13/0.35	% CPUTime    : 
0.86/1.17	============================== Prover9 ===============================
0.86/1.17	Prover9 (32) version 2009-11A, November 2009.
0.86/1.17	Process 24391 was started by sandbox on n012.cluster.edu,
0.86/1.17	Tue Jul 13 16:59:47 2021
0.86/1.17	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_24210_n012.cluster.edu".
0.86/1.17	============================== end of head ===========================
0.86/1.17	
0.86/1.17	============================== INPUT =================================
0.86/1.17	
0.86/1.17	% Reading from file /tmp/Prover9_24210_n012.cluster.edu
0.86/1.17	
0.86/1.17	set(prolog_style_variables).
0.86/1.17	set(auto2).
0.86/1.17	    % set(auto2) -> set(auto).
0.86/1.17	    % set(auto) -> set(auto_inference).
0.86/1.17	    % set(auto) -> set(auto_setup).
0.86/1.17	    % set(auto_setup) -> set(predicate_elim).
0.86/1.17	    % set(auto_setup) -> assign(eq_defs, unfold).
0.86/1.17	    % set(auto) -> set(auto_limits).
0.86/1.17	    % set(auto_limits) -> assign(max_weight, "100.000").
0.86/1.17	    % set(auto_limits) -> assign(sos_limit, 20000).
0.86/1.17	    % set(auto) -> set(auto_denials).
0.86/1.17	    % set(auto) -> set(auto_process).
0.86/1.17	    % set(auto2) -> assign(new_constants, 1).
0.86/1.17	    % set(auto2) -> assign(fold_denial_max, 3).
0.86/1.17	    % set(auto2) -> assign(max_weight, "200.000").
0.86/1.17	    % set(auto2) -> assign(max_hours, 1).
0.86/1.17	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.86/1.17	    % set(auto2) -> assign(max_seconds, 0).
0.86/1.17	    % set(auto2) -> assign(max_minutes, 5).
0.86/1.17	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.86/1.17	    % set(auto2) -> set(sort_initial_sos).
0.86/1.17	    % set(auto2) -> assign(sos_limit, -1).
0.86/1.17	    % set(auto2) -> assign(lrs_ticks, 3000).
0.86/1.17	    % set(auto2) -> assign(max_megs, 400).
0.86/1.17	    % set(auto2) -> assign(stats, some).
0.86/1.17	    % set(auto2) -> clear(echo_input).
0.86/1.17	    % set(auto2) -> set(quiet).
0.86/1.17	    % set(auto2) -> clear(print_initial_clauses).
0.86/1.17	    % set(auto2) -> clear(print_given).
0.86/1.17	assign(lrs_ticks,-1).
0.86/1.17	assign(sos_limit,10000).
0.86/1.17	assign(order,kbo).
0.86/1.17	set(lex_order_vars).
0.86/1.17	clear(print_given).
0.86/1.17	
0.86/1.17	% formulas(sos).  % not echoed (19 formulas)
0.86/1.17	
0.86/1.17	============================== end of input ==========================
0.86/1.17	
0.86/1.17	% From the command line: assign(max_seconds, 1200).
0.86/1.17	
0.86/1.17	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.86/1.17	
0.86/1.17	% Formulas that are not ordinary clauses:
0.86/1.17	1 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	2 (all A all B (B = A <-> subset(B,A) & subset(A,B))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	3 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	4 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	5 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	6 (all A all B subset(union(set_intersection2(A,B)),set_intersection2(union(A),union(B)))) # label(t97_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	7 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	8 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	9 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	10 (all A all B all C (set_union2(A,B) = C <-> (all D (in(D,B) | in(D,A) <-> in(D,C))))) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	11 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	12 (all A all B all C (set_intersection2(A,B) = C <-> (all D (in(D,B) & in(D,A) <-> in(D,C))))) # label(d3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	13 (all A all B A = set_union2(A,A)) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	14 (all A all B set_intersection2(B,A) = set_intersection2(A,B)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.17	15 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumptiAlarm clock 
119.53/120.07	Prover9 interrupted
119.53/120.07	EOF