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   : n009.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:42 EDT 2021
0.13/0.35	% CPUTime    : 
0.97/1.26	============================== Prover9 ===============================
0.97/1.26	Prover9 (32) version 2009-11A, November 2009.
0.97/1.26	Process 25354 was started by sandbox on n009.cluster.edu,
0.97/1.26	Tue Jul 13 17:06:43 2021
0.97/1.26	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_25156_n009.cluster.edu".
0.97/1.26	============================== end of head ===========================
0.97/1.26	
0.97/1.26	============================== INPUT =================================
0.97/1.26	
0.97/1.26	% Reading from file /tmp/Prover9_25156_n009.cluster.edu
0.97/1.26	
0.97/1.26	set(prolog_style_variables).
0.97/1.26	set(auto2).
0.97/1.26	    % set(auto2) -> set(auto).
0.97/1.26	    % set(auto) -> set(auto_inference).
0.97/1.26	    % set(auto) -> set(auto_setup).
0.97/1.26	    % set(auto_setup) -> set(predicate_elim).
0.97/1.26	    % set(auto_setup) -> assign(eq_defs, unfold).
0.97/1.26	    % set(auto) -> set(auto_limits).
0.97/1.26	    % set(auto_limits) -> assign(max_weight, "100.000").
0.97/1.26	    % set(auto_limits) -> assign(sos_limit, 20000).
0.97/1.26	    % set(auto) -> set(auto_denials).
0.97/1.26	    % set(auto) -> set(auto_process).
0.97/1.26	    % set(auto2) -> assign(new_constants, 1).
0.97/1.26	    % set(auto2) -> assign(fold_denial_max, 3).
0.97/1.26	    % set(auto2) -> assign(max_weight, "200.000").
0.97/1.26	    % set(auto2) -> assign(max_hours, 1).
0.97/1.26	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.97/1.26	    % set(auto2) -> assign(max_seconds, 0).
0.97/1.26	    % set(auto2) -> assign(max_minutes, 5).
0.97/1.26	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.97/1.26	    % set(auto2) -> set(sort_initial_sos).
0.97/1.26	    % set(auto2) -> assign(sos_limit, -1).
0.97/1.26	    % set(auto2) -> assign(lrs_ticks, 3000).
0.97/1.26	    % set(auto2) -> assign(max_megs, 400).
0.97/1.26	    % set(auto2) -> assign(stats, some).
0.97/1.26	    % set(auto2) -> clear(echo_input).
0.97/1.26	    % set(auto2) -> set(quiet).
0.97/1.26	    % set(auto2) -> clear(print_initial_clauses).
0.97/1.26	    % set(auto2) -> clear(print_given).
0.97/1.26	assign(lrs_ticks,-1).
0.97/1.26	assign(sos_limit,10000).
0.97/1.26	assign(order,kbo).
0.97/1.26	set(lex_order_vars).
0.97/1.26	clear(print_given).
0.97/1.26	
0.97/1.26	% formulas(sos).  % not echoed (96 formulas)
0.97/1.26	
0.97/1.26	============================== end of input ==========================
0.97/1.26	
0.97/1.26	% From the command line: assign(max_seconds, 1200).
0.97/1.26	
0.97/1.26	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.97/1.26	
0.97/1.26	% Formulas that are not ordinary clauses:
0.97/1.26	1 (all A A = union(powerset(A))) # label(t99_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	2 (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.97/1.26	3 (all A all B (B = powerset(A) <-> (all C (in(C,B) <-> subset(C,A))))) # label(d1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	4 (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.97/1.26	5 (all A all B (in(A,B) -> set_union2(singleton(A),B) = B)) # label(t46_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	6 (all A all B subset(set_intersection2(A,B),A)) # label(t17_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	7 (all A all B (subset(A,B) -> set_union2(A,B) = B)) # label(t12_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	8 (all A all B all C (subset(A,B) -> subset(A,set_difference(B,singleton(C))) | in(C,A))) # label(l3_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	9 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	10 (all A all B -(empty(B) & in(A,B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	11 (all A all B all C (C = cartesian_product2(A,B) <-> (all D ((exists E exists F (in(F,B) & D = ordered_pair(E,F) & in(E,A))) <-> in(D,C))))) # label(d2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	12 (all A all B (subset(singleton(A),singleton(B)) -> A = B)) # label(t6_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	13 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	14 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	15 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	16 (all A all B all C all D -(unordered_pair(A,B) = unordered_pair(C,D) & D != A & C != A)) # label(t10_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	17 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	18 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	19 (all A all B ((all C ((exists D (in(D,A) & in(C,D))) <-> in(C,B))) <-> union(A) = B)) # label(d4_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	20 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	21 (all A all B (B != A & subset(A,B) <-> proper_subset(A,B))) # label(d8_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	22 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	23 (all A all B (-in(A,B) -> disjoint(singleton(A),B))) # label(l28_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	24 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	25 (all A all B (set_difference(A,B) = A <-> disjoint(A,B))) # label(t83_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	26 (all A all B (in(A,B) -> B = set_union2(singleton(A),B))) # label(l23_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	27 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	28 (all A all B A = set_union2(A,A)) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	29 (all A all B all C (singleton(A) = unordered_pair(B,C) -> B = C)) # label(t9_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	30 (all A all B all C all D (ordered_pair(C,D) = ordered_pair(A,B) -> D = B & C = A)) # label(t33_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	31 (all A all B (-(-disjoint(A,B) & (all C -(in(C,A) & in(C,B)))) & -(disjoint(A,B) & (exists C (in(C,A) & in(C,B)))))) # label(t3_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	32 (all A all B (subset(singleton(A),B) <-> in(A,B))) # label(l2_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	33 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(t106_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	34 (all A all B (in(A,B) -> subset(A,union(B)))) # label(t92_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	35 (all A all B (subset(A,B) <-> empty_set = set_difference(A,B))) # label(t37_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	36 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	37 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	38 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	39 (all A all B (-((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)) & -((all C -in(C,set_intersection2(A,B))) & -disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	40 (all A all B (A = singleton(B) | empty_set = A <-> subset(A,singleton(B)))) # label(l4_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	41 (all A all B all C all D (in(ordered_pair(A,B),cartesian_product2(C,D)) <-> in(A,C) & in(B,D))) # label(l55_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	42 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	43 (all A all B (A = B <-> subset(B,A) & subset(A,B))) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	44 (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.97/1.26	45 (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.97/1.26	46 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	47 (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.97/1.26	48 (all A singleton(A) != empty_set) # label(l1_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	49 (all A all B all C (C = set_difference(A,B) <-> (all D (-in(D,B) & in(D,A) <-> in(D,C))))) # label(d4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	50 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	51 (all A all B set_intersection2(B,A) = set_intersection2(A,B)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	52 (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.97/1.26	53 (all A all B all C (singleton(A) = unordered_pair(B,C) -> A = B)) # label(t8_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	54 (all A all B all C (C = unordered_pair(A,B) <-> (all D (D = A | B = D <-> in(D,C))))) # label(d2_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	55 (all A singleton(A) = unordered_pair(A,A)) # label(t69_enumset1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	56 (all A all B (subset(A,singleton(B)) <-> empty_set = A | A = singleton(B))) # label(t39_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	57 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	58 (all A (empty_set = A <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	59 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	60 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	61 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	62 (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.97/1.26	63 (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.97/1.26	64 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	65 (all A all B subset(set_difference(A,B),A)) # label(t36_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	66 (all A all B (-in(B,A) <-> A = set_difference(A,singleton(B)))) # label(t65_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	67 (all A all B A = set_intersection2(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	68 (all A all B (set_difference(A,B) = empty_set <-> subset(A,B))) # label(l32_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	69 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	70 (all A all B all C ((all D (in(D,C) <-> in(D,B) & in(D,A))) <-> set_intersection2(A,B) = C)) # label(d3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	71 $T # label(dt_k2_zfmisc_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	72 (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.97/1.26	73 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	74 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	75 (all A all B (subset(A,B) -> set_intersection2(A,B) = A)) # label(t28_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.97/1.26	76 (all A all B all C ((all D (in(D,C) <-> in(D,A) | in(D,B))) <-> set_union2(A,B) = C)) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.97/1.26	77 (all A all B -(empty(A) & B != A & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	78 (all A all B all C (subset(unordered_pair(A,B),C) <-> in(A,C) & in(B,C))) # label(t38_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
2.24/2.50	79 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	80 (all A all B -(disjoint(singleton(A),B) & in(A,B))) # label(l25_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
2.24/2.50	81 (all A all B -(subset(A,B) & proper_subset(B,A))) # label(t60_xboole_1) # label(lemma) # label(non_clause).  [assumption].
2.24/2.50	82 (all A all B (in(A,B) -> subset(A,union(B)))) # label(l50_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
2.24/2.50	83 (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].
2.24/2.50	84 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	85 (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].
2.24/2.50	86 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	87 (all A all B -proper_subset(A,A)) # label(irreflexivity_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	88 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	89 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	90 (all A all B (in(A,B) <-> subset(singleton(A),B))) # label(t37_zfmisc_1) # label(lemma) # label(non_clause).  [assumption].
2.24/2.50	91 (all A all B ((all C (in(C,B) <-> A = C)) <-> singleton(A) = B)) # label(d1_tarski) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	92 $T # label(dt_k3_tarski) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	93 (all A all B (proper_subset(A,B) -> -proper_subset(B,A))) # label(antisymmetry_r2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
2.24/2.50	94 -(all A all B all C (subset(A,B) -> subset(cartesian_product2(A,C),cartesian_product2(B,C)) & subset(cartesian_product2(C,A),cartesian_product2(C,B)))) # label(t118_zfmisc_1) # label(negated_conjecture) # label(non_clause).  [assumption].
2.24/2.50	
2.24/2.50	============================== end of process non-clausal formulas ===
2.24/2.50	
2.24/2.50	============================== PROCESS INITIAL CLAUSES ===============
2.24/2.50	
2.24/2.50	============================== PREDICATE ELIMINATION =================
2.24/2.50	
2.24/2.50	============================== end predicate elimination =============
2.24/2.50	
2.24/2.50	Auto_denials:  (non-Horn, no changes).
2.24/2.50	
2.24/2.50	Term ordering decisions:
2.24/2.50	Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_difference=1. set_union2=1. set_intersection2=1. unordered_pair=1. ordered_pair=1. cartesian_product2=1. f1=1. f7=1. f8=1. f10=1. f11=1. f15=1. f18=1. f19=1. singleton=1. union=1. powerset=1. f14=1. f4=1. f5=1. f6=1. f9=1. f12=1. f13=1. f16=1. f17=1. f2=1. f3=1.
2.24/2.50	
2.24/2.50	============================== end of process initial clauses ========
2.24/2.50	
2.24/2.50	============================== CLAUSES FOR SEARCH ====================
2.24/2.50	
2.24/2.50	============================== end of clauses for search =============
2.24/2.50	
2.24/2.50	============================== SEARCH ================================
2.24/2.50	
2.24/2.50	% Starting search at 0.03 seconds.
2.24/2.50	
2.24/2.50	Low Water (keep): wt=45.000, iters=3495
2.24/2.50	
2.24/2.50	Low Water (keep): wt=41.000, iters=3399
2.24/2.50	
2.24/2.50	Low Water (keep): wt=38.000, iters=3339
2.24/2.50	
2.24/2.50	Low Water (keep): wt=37.000, iters=3366
2.24/2.50	
2.24/2.50	Low Water (keep): wt=36.000, iters=3724
2.24/2.50	
2.24/2.50	Low Water (keep): wt=34.000, iters=3655
2.24/2.50	
2.24/2.50	Low Water (keep): wt=29.000, iters=3373
2.24/2.50	
2.24/2.50	Low Water (keep): wt=28.000, iters=3344
2.24/2.50	
2.24/2.50	Low Water (keep): wt=27.000, iters=3333
2.24/2.50	
2.24/2.50	Low Water (keep): wt=25.000, iters=3348
2.24/2.50	
2.24/2.50	Low Water (keep): wt=24.000, iters=3403
2.24/2.50	
2.24/2.50	Low Water (keep): wt=23.000, iters=3378
2.24/2.50	
2.24/2.50	Low Water (keep): wt=22.000, iters=3336
2.24/2.50	
2.24/2.50	Low Water (keep): wt=21.000, iters=3394
2.24/2.50	
2.24/2.50	Low Water (keep): wt=20.000, iters=3345
2.24/2.50	
2.24/2.50	Low Water (keep): wt=19.000, iters=3377
2.24/2.50	
2.24/2.50	Low Water (keep): wt=18.000, iters=3352
2.24/2.50	
2.24/2.50	Low Water (keep): wt=17.000, iters=3334
2.24/2.50	
2.24/2.50	Low Water (keep): wt=16.000, iterAlarm clock 
119.52/120.07	Prover9 interrupted
119.52/120.08	EOF