0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n015.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   : 1200
0.12/0.34	% DateTime   : Tue Jul 13 17:02:04 EDT 2021
0.12/0.34	% CPUTime    : 
0.96/1.26	============================== Prover9 ===============================
0.96/1.26	Prover9 (32) version 2009-11A, November 2009.
0.96/1.26	Process 21437 was started by sandbox on n015.cluster.edu,
0.96/1.26	Tue Jul 13 17:02:05 2021
0.96/1.26	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_21265_n015.cluster.edu".
0.96/1.26	============================== end of head ===========================
0.96/1.26	
0.96/1.26	============================== INPUT =================================
0.96/1.26	
0.96/1.26	% Reading from file /tmp/Prover9_21265_n015.cluster.edu
0.96/1.26	
0.96/1.26	set(prolog_style_variables).
0.96/1.26	set(auto2).
0.96/1.26	    % set(auto2) -> set(auto).
0.96/1.26	    % set(auto) -> set(auto_inference).
0.96/1.26	    % set(auto) -> set(auto_setup).
0.96/1.26	    % set(auto_setup) -> set(predicate_elim).
0.96/1.26	    % set(auto_setup) -> assign(eq_defs, unfold).
0.96/1.26	    % set(auto) -> set(auto_limits).
0.96/1.26	    % set(auto_limits) -> assign(max_weight, "100.000").
0.96/1.26	    % set(auto_limits) -> assign(sos_limit, 20000).
0.96/1.26	    % set(auto) -> set(auto_denials).
0.96/1.26	    % set(auto) -> set(auto_process).
0.96/1.26	    % set(auto2) -> assign(new_constants, 1).
0.96/1.26	    % set(auto2) -> assign(fold_denial_max, 3).
0.96/1.26	    % set(auto2) -> assign(max_weight, "200.000").
0.96/1.26	    % set(auto2) -> assign(max_hours, 1).
0.96/1.26	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.96/1.26	    % set(auto2) -> assign(max_seconds, 0).
0.96/1.26	    % set(auto2) -> assign(max_minutes, 5).
0.96/1.26	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.96/1.26	    % set(auto2) -> set(sort_initial_sos).
0.96/1.26	    % set(auto2) -> assign(sos_limit, -1).
0.96/1.26	    % set(auto2) -> assign(lrs_ticks, 3000).
0.96/1.26	    % set(auto2) -> assign(max_megs, 400).
0.96/1.26	    % set(auto2) -> assign(stats, some).
0.96/1.26	    % set(auto2) -> clear(echo_input).
0.96/1.26	    % set(auto2) -> set(quiet).
0.96/1.26	    % set(auto2) -> clear(print_initial_clauses).
0.96/1.26	    % set(auto2) -> clear(print_given).
0.96/1.26	assign(lrs_ticks,-1).
0.96/1.26	assign(sos_limit,10000).
0.96/1.26	assign(order,kbo).
0.96/1.26	set(lex_order_vars).
0.96/1.26	clear(print_given).
0.96/1.26	
0.96/1.26	% formulas(sos).  % not echoed (87 formulas)
0.96/1.26	
0.96/1.26	============================== end of input ==========================
0.96/1.26	
0.96/1.26	% From the command line: assign(max_seconds, 1200).
0.96/1.26	
0.96/1.26	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.96/1.26	
0.96/1.26	% Formulas that are not ordinary clauses:
0.96/1.26	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.96/1.26	2 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	3 (all A all B all C (subset(A,B) & subset(A,C) -> subset(A,set_intersection2(B,C)))) # label(t19_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	4 (all A all B (-(-disjoint(A,B) & (all C -(in(C,B) & in(C,A)))) & -(disjoint(A,B) & (exists C (in(C,B) & in(C,A)))))) # label(t3_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	5 (all A (empty_set = A <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	6 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	7 (all A all B all C (unordered_pair(A,B) = C <-> (all D (in(D,C) <-> A = D | B = D)))) # label(d2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	8 (all A all B set_difference(set_union2(A,B),B) = set_difference(A,B)) # label(t40_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	9 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	10 (all A all B (subset(A,B) -> set_union2(A,set_difference(B,A)) = B)) # label(t45_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	11 (all A all B all C (cartesian_product2(A,B) = C <-> (all D (in(D,C) <-> (exists E exists F (ordered_pair(E,F) = D & in(F,B) & in(E,A))))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	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.96/1.26	13 (all A all B (empty_set = set_intersection2(A,B) <-> disjoint(A,B))) # label(d7_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	14 (all A all B (A = empty_set | singleton(B) = A <-> subset(A,singleton(B)))) # label(l4_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	15 (all A all B set_union2(A,B) = set_union2(A,set_difference(B,A))) # label(t39_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	16 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	17 (all A all B all C (disjoint(B,C) & subset(A,B) -> disjoint(A,C))) # label(t63_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	18 (all A all B set_union2(B,A) = set_union2(A,B)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	19 (all A all B ((all C (in(C,B) <-> (exists D (in(D,A) & in(C,D))))) <-> B = union(A))) # label(d4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	20 (all A all B (-in(A,B) -> disjoint(singleton(A),B))) # label(l28_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	21 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	22 (all A all B set_union2(A,A) = A) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	23 (all A singleton(A) = unordered_pair(A,A)) # label(t69_enumset1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	24 (all A all B (disjoint(A,B) <-> A = set_difference(A,B))) # label(t83_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	25 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	26 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(l23_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	27 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	28 (all A all B ((all C (subset(C,A) <-> in(C,B))) <-> B = powerset(A))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	29 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	30 (all A all B all C (singleton(A) = unordered_pair(B,C) -> B = A)) # label(t8_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	31 (all A all B all C (set_union2(A,B) = C <-> (all D (in(D,C) <-> in(D,A) | in(D,B))))) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	32 (all A all B set_intersection2(B,A) = set_intersection2(A,B)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	33 (all A all B (singleton(A) = B <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	34 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	35 (all A all B (A = B <-> subset(B,A) & subset(A,B))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	36 (all A all B A = set_intersection2(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	37 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	38 (all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	39 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	40 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	41 (all A all B set_difference(A,set_difference(A,B)) = set_intersection2(A,B)) # label(t48_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	42 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.26	43 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	44 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	45 (all A all B unordered_pair(B,A) = unordered_pair(A,B)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.26	46 (all A all B -(B != A & empty(B) & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	47 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	48 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	49 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	50 (all A all B -(in(A,B) & disjoint(singleton(A),B))) # label(l25_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	51 (all A (empty(A) -> empty_set = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	52 (all A all B (subset(singleton(A),singleton(B)) -> B = A)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	53 (all A all B (proper_subset(A,B) <-> B != A & subset(A,B))) # label(d8_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	54 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	55 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	56 (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.96/1.27	57 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	58 (all A all B all C (unordered_pair(B,C) = singleton(A) -> C = B)) # label(t9_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	59 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	60 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	61 (all A all B (subset(A,B) -> A = set_intersection2(A,B))) # label(t28_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	62 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	63 (all A all B (subset(A,B) -> B = set_union2(A,B))) # label(t12_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	64 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	65 (all A all B all C all D (ordered_pair(C,D) = ordered_pair(A,B) -> B = D & A = C)) # label(t33_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	66 (all A all B all C ((all D (-in(D,B) & in(D,A) <-> in(D,C))) <-> set_difference(A,B) = C)) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	67 (all A all B all C all D -(unordered_pair(C,D) = unordered_pair(A,B) & C != A & D != A)) # label(t10_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	68 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	69 (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.96/1.27	70 (all A empty_set = set_intersection2(A,empty_set)) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	71 (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.96/1.27	72 (all A all B (subset(A,B) <-> set_difference(A,B) = empty_set)) # label(t37_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	73 (all A all B all C (subset(A,B) & subset(B,C) -> subset(A,C))) # label(t1_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	74 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	75 (all A A = set_difference(A,empty_set)) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	76 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.96/1.27	77 (all A all B (-((all C -in(C,set_intersection2(A,B))) & -disjoint(A,B)) & -(disjoint(A,B) & (exists C in(C,set_intersection2(A,B)))))) # label(t4_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.96/1.27	78Alarm clock 
119.50/120.08	Prover9 interrupted
119.50/120.08	EOF