0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.31	% Computer   : n024.cluster.edu
0.14/0.31	% Model      : x86_64 x86_64
0.14/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.31	% Memory     : 8042.1875MB
0.14/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.31	% CPULimit   : 960
0.14/0.31	% DateTime   : Thu Jul  2 07:46:26 EDT 2020
0.14/0.31	% CPUTime    : 
0.61/0.93	============================== Prover9 ===============================
0.61/0.93	Prover9 (32) version 2009-11A, November 2009.
0.61/0.93	Process 26755 was started by sandbox2 on n024.cluster.edu,
0.61/0.93	Thu Jul  2 07:46:27 2020
0.61/0.93	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_26602_n024.cluster.edu".
0.61/0.93	============================== end of head ===========================
0.61/0.93	
0.61/0.93	============================== INPUT =================================
0.61/0.93	
0.61/0.93	% Reading from file /tmp/Prover9_26602_n024.cluster.edu
0.61/0.93	
0.61/0.93	set(prolog_style_variables).
0.61/0.93	set(auto2).
0.61/0.93	    % set(auto2) -> set(auto).
0.61/0.93	    % set(auto) -> set(auto_inference).
0.61/0.93	    % set(auto) -> set(auto_setup).
0.61/0.93	    % set(auto_setup) -> set(predicate_elim).
0.61/0.93	    % set(auto_setup) -> assign(eq_defs, unfold).
0.61/0.93	    % set(auto) -> set(auto_limits).
0.61/0.93	    % set(auto_limits) -> assign(max_weight, "100.000").
0.61/0.93	    % set(auto_limits) -> assign(sos_limit, 20000).
0.61/0.93	    % set(auto) -> set(auto_denials).
0.61/0.93	    % set(auto) -> set(auto_process).
0.61/0.93	    % set(auto2) -> assign(new_constants, 1).
0.61/0.93	    % set(auto2) -> assign(fold_denial_max, 3).
0.61/0.93	    % set(auto2) -> assign(max_weight, "200.000").
0.61/0.93	    % set(auto2) -> assign(max_hours, 1).
0.61/0.93	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.61/0.93	    % set(auto2) -> assign(max_seconds, 0).
0.61/0.93	    % set(auto2) -> assign(max_minutes, 5).
0.61/0.93	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.61/0.93	    % set(auto2) -> set(sort_initial_sos).
0.61/0.93	    % set(auto2) -> assign(sos_limit, -1).
0.61/0.93	    % set(auto2) -> assign(lrs_ticks, 3000).
0.61/0.93	    % set(auto2) -> assign(max_megs, 400).
0.61/0.93	    % set(auto2) -> assign(stats, some).
0.61/0.93	    % set(auto2) -> clear(echo_input).
0.61/0.93	    % set(auto2) -> set(quiet).
0.61/0.93	    % set(auto2) -> clear(print_initial_clauses).
0.61/0.93	    % set(auto2) -> clear(print_given).
0.61/0.93	assign(lrs_ticks,-1).
0.61/0.93	assign(sos_limit,10000).
0.61/0.93	assign(order,kbo).
0.61/0.93	set(lex_order_vars).
0.61/0.93	clear(print_given).
0.61/0.93	
0.61/0.93	% formulas(sos).  % not echoed (32 formulas)
0.61/0.93	
0.61/0.93	============================== end of input ==========================
0.61/0.93	
0.61/0.93	% From the command line: assign(max_seconds, 960).
0.61/0.93	
0.61/0.93	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.61/0.93	
0.61/0.93	% Formulas that are not ordinary clauses:
0.61/0.93	1 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	2 (all A all B A = set_intersection2(A,A)) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	3 (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.61/0.93	4 (all A all B (-(disjoint(A,B) & (exists C in(C,set_intersection2(A,B)))) & -((all C -in(C,set_intersection2(A,B))) & -disjoint(A,B)))) # label(t4_xboole_0) # label(lemma) # label(non_clause).  [assumption].
0.61/0.93	5 (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.61/0.93	6 (all A all B (subset(B,A) & subset(A,B) <-> B = A)) # label(d10_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	7 (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.61/0.93	8 (all A all B (empty_set = set_intersection2(A,B) <-> disjoint(A,B))) # label(d7_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	9 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	10 (all A (subset(A,empty_set) -> A = empty_set)) # label(t3_xboole_1) # label(lemma) # label(non_clause).  [assumption].
0.61/0.93	11 $T # label(dt_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	12 (all A all B -(empty(B) & B != A & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	13 (all A all B (-empty(A) -> -empty(set_union2(B,A)))) # label(fc3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	14 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	15 (all A all B A = set_union2(A,A)) # label(idempotence_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	16 (all A all B all C ((all D (in(D,A) | in(D,B) <-> in(D,C))) <-> set_union2(A,B) = C)) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	17 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	18 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	19 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	20 (all A all B (-((all C -(in(C,A) & in(C,B))) & -disjoint(A,B)) & -((exists C (in(C,B) & in(C,A))) & disjoint(A,B)))) # label(t3_xboole_0) # label(lemma) # label(non_clause).  [assumption].
13.96/14.31	21 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	22 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	23 (all A subset(empty_set,A)) # label(t2_xboole_1) # label(lemma) # label(non_clause).  [assumption].
13.96/14.31	24 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	25 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	26 (all A (empty(A) -> empty_set = A)) # label(t6_boole) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	27 (all A all B subset(A,set_union2(A,B))) # label(t7_xboole_1) # label(lemma) # label(non_clause).  [assumption].
13.96/14.31	28 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	29 (all A all B (-empty(A) -> -empty(set_union2(A,B)))) # label(fc2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	30 (all A set_union2(A,empty_set) = A) # label(t1_boole) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	31 -(all A all B all C (subset(C,B) & subset(A,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(negated_conjecture) # label(non_clause).  [assumption].
13.96/14.31	
13.96/14.31	============================== end of process non-clausal formulas ===
13.96/14.31	
13.96/14.31	============================== PROCESS INITIAL CLAUSES ===============
13.96/14.31	
13.96/14.31	============================== PREDICATE ELIMINATION =================
13.96/14.31	
13.96/14.31	============================== end predicate elimination =============
13.96/14.31	
13.96/14.31	Auto_denials:  (non-Horn, no changes).
13.96/14.31	
13.96/14.31	Term ordering decisions:
13.96/14.31	
13.96/14.31	% Assigning unary symbol f5 kb_weight 0 and highest precedence (19).
13.96/14.31	Function symbol KB weights:  empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_union2=1. set_intersection2=1. f2=1. f3=1. f6=1. f1=1. f4=1. f5=0.
13.96/14.31	
13.96/14.31	============================== end of process initial clauses ========
13.96/14.31	
13.96/14.31	============================== CLAUSES FOR SEARCH ====================
13.96/14.31	
13.96/14.31	============================== end of clauses for search =============
13.96/14.31	
13.96/14.31	============================== SEARCH ================================
13.96/14.31	
13.96/14.31	% Starting search at 0.01 seconds.
13.96/14.31	
13.96/14.31	Low Water (keep): wt=17.000, iters=3355
13.96/14.31	
13.96/14.31	Low Water (keep): wt=15.000, iters=3342
13.96/14.31	
13.96/14.31	Low Water (keep): wt=11.000, iters=3367
13.96/14.31	
13.96/14.31	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 43 (0.00 of 0.43 sec).
13.96/14.31	
13.96/14.31	Low Water (keep): wt=10.000, iters=3372
13.96/14.31	
13.96/14.31	Low Water (keep): wt=9.000, iters=3369
13.96/14.31	
13.96/14.31	============================== PROOF =================================
13.96/14.31	% SZS status Theorem
13.96/14.31	% SZS output start Refutation
13.96/14.31	
13.96/14.31	% Proof 1 at 13.07 (+ 0.31) seconds.
13.96/14.31	% Length of proof is 19.
13.96/14.31	% Level of proof is 4.
13.96/14.31	% Maximum clause weight is 14.000.
13.96/14.31	% Given clauses 2172.
13.96/14.31	
13.96/14.31	5 (all A all B ((all C (in(C,A) -> in(C,B))) <-> subset(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	16 (all A all B all C ((all D (in(D,A) | in(D,B) <-> in(D,C))) <-> set_union2(A,B) = C)) # label(d2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	25 (all A all B set_union2(A,B) = set_union2(B,A)) # label(commutativity_k2_xboole_0) # label(axiom) # label(non_clause).  [assumption].
13.96/14.31	31 -(all A all B all C (subset(C,B) & subset(A,B) -> subset(set_union2(A,C),B))) # label(t8_xboole_1) # label(negated_conjecture) # label(non_clause).  [assumption].
13.96/14.31	36 subset(c5,c4) # label(t8_xboole_1) # label(negated_conjecture).  [clausify(31)].
13.96/14.31	37 subset(c3,c4) # label(t8_xboole_1) # label(negated_conjecture).  [clausify(31)].
13.96/14.31	44 set_union2(A,B) = set_union2(B,A) # label(commutativity_k2_xboole_0) # label(axiom).  [clausify(25)].
13.96/14.31	45 in(f3(A,B),A) | subset(A,B) # label(d3_tarski) # label(axiom).  [clausify(5)].
13.96/14.31	54 -subset(set_union2(c3,c5),c4) # label(t8_xboole_1) # label(negated_conjecture).  [clausify(31)].
13.96/14.31	67 -in(f3(A,B),B) | subset(A,B) # label(d3_tarski) # label(axiom).  [clausify(5)].
13.96/14.31	70 -in(A,B) | in(A,C) | -subset(B,C) # label(d3_tarski) # label(axiom).  [clausify(5)].
13.96/14.31	78 in(A,B) | in(A,C) | -in(A,D) | set_union2(B,C) != D # label(d2_xboole_0) # label(axiom).  [clausify(16)].
13.96/14.31	108 in(f3(set_union2(c3,c5),c4),set_union2(c3,c5)).  [resolve(54,a,45,b)].
13.96/14.31	145 -in(f3(set_union2(c3,c5),c4),c4).  [ur(67,b,54,a)].
13.96/14.31	154 -in(A,c3) | in(A,c4).  [resolve(70,c,37,a)].
13.96/14.31	155 -in(A,c5) | in(A,c4).  [resolve(70,c,36,a)].
13.96/14.31	5352 -in(f3(set_union2(c3,c5),c4),c5).  [ur(155,b,145,a)].
13.96/14.31	5353 -in(f3(set_union2(c3,c5),c4),c3).  [ur(154,b,145,a)].
13.96/14.31	12015 $F.  [ur(78,a,5352,a,b,5353,a,d,44,a),unit_del(a,108)].
13.96/14.31	
13.96/14.31	% SZS output end Refutation
13.96/14.31	============================== end of proof ==========================
13.96/14.31	
13.96/14.31	============================== STATISTICS ============================
13.96/14.31	
13.96/14.31	Given=2172. Generated=435031. Kept=11981. proofs=1.
13.96/14.31	Usable=2151. Sos=9643. Demods=7. Limbo=0, Disabled=237. Hints=0.
13.96/14.31	Megabytes=7.94.
13.96/14.31	User_CPU=13.07, System_CPU=0.31, Wall_clock=13.
13.96/14.31	
13.96/14.31	============================== end of statistics =====================
13.96/14.31	
13.96/14.31	============================== end of search =========================
13.96/14.31	
13.96/14.31	THEOREM PROVED
13.96/14.31	% SZS status Theorem
13.96/14.31	
13.96/14.31	Exiting with 1 proof.
13.96/14.31	
13.96/14.31	Process 26755 exit (max_proofs) Thu Jul  2 07:46:40 2020
13.96/14.31	Prover9 interrupted
13.96/14.31	EOF