0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer : n007.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 : 1440
0.12/0.34	% WCLimit  : 180
0.12/0.34	% DateTime : Mon Jul  3 08:32:27 EDT 2023
0.12/0.34	% CPUTime  : 
0.44/1.01	============================== Prover9 ===============================
0.44/1.01	Prover9 (32) version 2009-11A, November 2009.
0.44/1.01	Process 16731 was started by sandbox on n007.cluster.edu,
0.44/1.01	Mon Jul  3 08:32:28 2023
0.44/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_16578_n007.cluster.edu".
0.44/1.01	============================== end of head ===========================
0.44/1.01	
0.44/1.01	============================== INPUT =================================
0.44/1.01	
0.44/1.01	% Reading from file /tmp/Prover9_16578_n007.cluster.edu
0.44/1.01	
0.44/1.01	set(prolog_style_variables).
0.44/1.01	set(auto2).
0.44/1.01	    % set(auto2) -> set(auto).
0.44/1.01	    % set(auto) -> set(auto_inference).
0.44/1.01	    % set(auto) -> set(auto_setup).
0.44/1.01	    % set(auto_setup) -> set(predicate_elim).
0.44/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.01	    % set(auto) -> set(auto_limits).
0.44/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.01	    % set(auto) -> set(auto_denials).
0.44/1.01	    % set(auto) -> set(auto_process).
0.44/1.01	    % set(auto2) -> assign(new_constants, 1).
0.44/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.01	    % set(auto2) -> assign(max_hours, 1).
0.44/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.01	    % set(auto2) -> set(sort_initial_sos).
0.44/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.01	    % set(auto2) -> assign(max_megs, 400).
0.44/1.01	    % set(auto2) -> assign(stats, some).
0.44/1.01	    % set(auto2) -> clear(echo_input).
0.44/1.01	    % set(auto2) -> set(quiet).
0.44/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.01	    % set(auto2) -> clear(print_given).
0.44/1.01	assign(lrs_ticks,-1).
0.44/1.01	assign(sos_limit,10000).
0.44/1.01	assign(order,kbo).
0.44/1.01	set(lex_order_vars).
0.44/1.01	clear(print_given).
0.44/1.01	
0.44/1.01	% formulas(sos).  % not echoed (49 formulas)
0.44/1.01	
0.44/1.01	============================== end of input ==========================
0.44/1.01	
0.44/1.01	% From the command line: assign(max_seconds, 1440).
0.44/1.01	
0.44/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.01	
0.44/1.01	% Formulas that are not ordinary clauses:
0.44/1.01	1 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	2 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	3 (all A A = set_union2(A,empty_set)) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	4 (all A all B all C (subset(A,B) -> subset(set_difference(A,C),set_difference(B,C)))) # label(t33_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	5 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	6 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	7 (all A all B all C (subset(A,B) -> subset(set_intersection2(A,C),set_intersection2(B,C)))) # label(t26_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	8 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	9 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	10 (all A all B (subset(A,B) & subset(B,A) <-> A = B)) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	11 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	12 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	13 (all A all B set_union2(A,set_difference(B,A)) = set_union2(A,B)) # label(t39_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	14 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	15 (all A all B (-(disjoint(A,B) & (exists C (in(C,B) & in(C,A)))) & -(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))))) # label(t3_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	16 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	17 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	18 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	19 (all A all B ((all C (in(C,A) -> in(C,B))) <-> subset(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	20 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	21 (all A all B (subset(A,B) -> A = set_intersection2(A,B))) # label(t28_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	22 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	23 (all A all B (disjoint(A,B) <-> empty_set = set_intersection2(A,B))) # label(d7_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	24 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	25 (all A all B (empty_set = set_difference(A,B) <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	26 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	27 (all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -(disjoint(A,B) & (exists C in(C,set_intersection2(A,B)))))) # label(t4_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	28 (all A empty_set = set_intersection2(A,empty_set)) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	29 (all A all B -(B != A & empty(B) & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	30 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	31 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	32 (all A all B (empty_set = set_difference(A,B) <-> subset(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	33 (all A all B all C (set_difference(A,B) = C <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	34 (all A all B set_union2(B,A) = set_union2(A,B)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	35 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	36 (all A all B all C (subset(A,B) & subset(C,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	37 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	38 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	39 (all A empty_set = set_difference(empty_set,A)) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	40 (all A all B all C (subset(B,C) & subset(A,B) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	41 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	42 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	43 (all A (subset(A,empty_set) -> empty_set = A)) # label(t3_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	44 (all A all B all C (set_intersection2(A,B) = C <-> (all D (in(D,C) <-> in(D,B) & in(D,A))))) # label(d3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	45 (all A all B all C (C = set_union2(A,B) <-> (all D (in(D,A) | in(D,B) <-> in(D,C))))) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.01	46 (all A all B all C (subset(A,C) & subset(A,B) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.44/1.01	47 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause).  [assumptionAlarm clock 
179.73/180.05	Prover9 interrupted
179.73/180.05	EOF