0.08/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.08/0.29	% Computer   : n004.cluster.edu
0.08/0.29	% Model      : x86_64 x86_64
0.08/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.29	% Memory     : 8042.1875MB
0.08/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.29	% CPULimit   : 960
0.08/0.29	% DateTime   : Thu Jul  2 12:30:43 EDT 2020
0.08/0.29	% CPUTime    : 
0.63/0.95	============================== Prover9 ===============================
0.63/0.95	Prover9 (32) version 2009-11A, November 2009.
0.63/0.95	Process 16193 was started by sandbox2 on n004.cluster.edu,
0.63/0.95	Thu Jul  2 12:30:44 2020
0.63/0.95	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_16038_n004.cluster.edu".
0.63/0.95	============================== end of head ===========================
0.63/0.95	
0.63/0.95	============================== INPUT =================================
0.63/0.95	
0.63/0.95	% Reading from file /tmp/Prover9_16038_n004.cluster.edu
0.63/0.95	
0.63/0.95	set(prolog_style_variables).
0.63/0.95	set(auto2).
0.63/0.95	    % set(auto2) -> set(auto).
0.63/0.95	    % set(auto) -> set(auto_inference).
0.63/0.95	    % set(auto) -> set(auto_setup).
0.63/0.95	    % set(auto_setup) -> set(predicate_elim).
0.63/0.95	    % set(auto_setup) -> assign(eq_defs, unfold).
0.63/0.95	    % set(auto) -> set(auto_limits).
0.63/0.95	    % set(auto_limits) -> assign(max_weight, "100.000").
0.63/0.95	    % set(auto_limits) -> assign(sos_limit, 20000).
0.63/0.95	    % set(auto) -> set(auto_denials).
0.63/0.95	    % set(auto) -> set(auto_process).
0.63/0.95	    % set(auto2) -> assign(new_constants, 1).
0.63/0.95	    % set(auto2) -> assign(fold_denial_max, 3).
0.63/0.95	    % set(auto2) -> assign(max_weight, "200.000").
0.63/0.95	    % set(auto2) -> assign(max_hours, 1).
0.63/0.95	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.63/0.95	    % set(auto2) -> assign(max_seconds, 0).
0.63/0.95	    % set(auto2) -> assign(max_minutes, 5).
0.63/0.95	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.63/0.95	    % set(auto2) -> set(sort_initial_sos).
0.63/0.95	    % set(auto2) -> assign(sos_limit, -1).
0.63/0.95	    % set(auto2) -> assign(lrs_ticks, 3000).
0.63/0.95	    % set(auto2) -> assign(max_megs, 400).
0.63/0.95	    % set(auto2) -> assign(stats, some).
0.63/0.95	    % set(auto2) -> clear(echo_input).
0.63/0.95	    % set(auto2) -> set(quiet).
0.63/0.95	    % set(auto2) -> clear(print_initial_clauses).
0.63/0.95	    % set(auto2) -> clear(print_given).
0.63/0.95	assign(lrs_ticks,-1).
0.63/0.95	assign(sos_limit,10000).
0.63/0.95	assign(order,kbo).
0.63/0.95	set(lex_order_vars).
0.63/0.95	clear(print_given).
0.63/0.95	
0.63/0.95	% formulas(sos).  % not echoed (9 formulas)
0.63/0.95	
0.63/0.95	============================== end of input ==========================
0.63/0.95	
0.63/0.95	% From the command line: assign(max_seconds, 960).
0.63/0.95	
0.63/0.95	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.63/0.95	
0.63/0.95	% Formulas that are not ordinary clauses:
0.63/0.95	1 (all B all C ((all D (member(D,C) <-> member(D,B))) -> C = B)) # label(member_equal) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	2 (all B all C intersection(C,B) = intersection(B,C)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	3 (all B all C ((all D (member(D,C) <-> member(D,B))) <-> B = C)) # label(equal_member_defn) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	4 (all B all C ((all D (member(D,B) -> member(D,C))) <-> subset(B,C))) # label(subset_defn) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	5 (all B all C (subset(C,B) & subset(B,C) <-> B = C)) # label(equal_defn) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	6 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	7 (all B all C all D (member(D,difference(B,C)) <-> -member(D,C) & member(D,B))) # label(difference_defn) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	8 (all B all C all D (member(D,C) & member(D,B) <-> member(D,intersection(B,C)))) # label(intersection_defn) # label(axiom) # label(non_clause).  [assumption].
0.63/0.95	9 -(all B all C all D difference(intersection(B,C),D) = intersection(B,difference(C,D))) # label(prove_difference_and_intersection) # label(negated_conjecture) # label(non_clause).  [assumption].
0.63/0.95	
0.63/0.95	============================== end of process non-clausal formulas ===
0.63/0.95	
0.63/0.95	============================== PROCESS INITIAL CLAUSES ===============
0.63/0.95	
0.63/0.95	============================== PREDICATE ELIMINATION =================
0.63/0.95	
0.63/0.95	============================== end predicate elimination =============
0.63/0.95	
0.63/0.95	Auto_denials:  (non-Horn, no changes).
0.63/0.95	
0.63/0.95	Term ordering decisions:
0.63/0.95	Function symbol KB weights:  c1=1. c2=1. c3=1. intersection=1. difference=1. f1=1. f2=1. f3=1.
0.63/0.95	
0.63/0.95	============================== end of process initial clauses ========
0.63/0.95	
0.63/0.95	============================== CLAUSES FOR SEARCH ====================
0.63/0.95	
0.63/0.95	============================== end of clauses for searchAlarm clock 
119.52/120.03	Prover9 interrupted
119.52/120.03	EOF