0.06/0.10	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.10	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.31	% Computer : n023.cluster.edu
0.09/0.31	% Model    : x86_64 x86_64
0.09/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	% Memory   : 8042.1875MB
0.09/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit : 1440
0.09/0.31	% WCLimit  : 180
0.09/0.31	% DateTime : Mon Jul  3 08:16:36 EDT 2023
0.09/0.31	% CPUTime  : 
2.02/2.30	============================== Prover9 ===============================
2.02/2.30	Prover9 (32) version 2009-11A, November 2009.
2.02/2.30	Process 17682 was started by sandbox2 on n023.cluster.edu,
2.02/2.30	Mon Jul  3 08:16:36 2023
2.02/2.30	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_17529_n023.cluster.edu".
2.02/2.30	============================== end of head ===========================
2.02/2.30	
2.02/2.30	============================== INPUT =================================
2.02/2.30	
2.02/2.30	% Reading from file /tmp/Prover9_17529_n023.cluster.edu
2.02/2.30	
2.02/2.30	set(prolog_style_variables).
2.02/2.30	set(auto2).
2.02/2.30	    % set(auto2) -> set(auto).
2.02/2.30	    % set(auto) -> set(auto_inference).
2.02/2.30	    % set(auto) -> set(auto_setup).
2.02/2.30	    % set(auto_setup) -> set(predicate_elim).
2.02/2.30	    % set(auto_setup) -> assign(eq_defs, unfold).
2.02/2.30	    % set(auto) -> set(auto_limits).
2.02/2.30	    % set(auto_limits) -> assign(max_weight, "100.000").
2.02/2.30	    % set(auto_limits) -> assign(sos_limit, 20000).
2.02/2.30	    % set(auto) -> set(auto_denials).
2.02/2.30	    % set(auto) -> set(auto_process).
2.02/2.30	    % set(auto2) -> assign(new_constants, 1).
2.02/2.30	    % set(auto2) -> assign(fold_denial_max, 3).
2.02/2.30	    % set(auto2) -> assign(max_weight, "200.000").
2.02/2.30	    % set(auto2) -> assign(max_hours, 1).
2.02/2.30	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
2.02/2.30	    % set(auto2) -> assign(max_seconds, 0).
2.02/2.30	    % set(auto2) -> assign(max_minutes, 5).
2.02/2.30	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
2.02/2.30	    % set(auto2) -> set(sort_initial_sos).
2.02/2.30	    % set(auto2) -> assign(sos_limit, -1).
2.02/2.30	    % set(auto2) -> assign(lrs_ticks, 3000).
2.02/2.30	    % set(auto2) -> assign(max_megs, 400).
2.02/2.30	    % set(auto2) -> assign(stats, some).
2.02/2.30	    % set(auto2) -> clear(echo_input).
2.02/2.30	    % set(auto2) -> set(quiet).
2.02/2.30	    % set(auto2) -> clear(print_initial_clauses).
2.02/2.30	    % set(auto2) -> clear(print_given).
2.02/2.30	assign(lrs_ticks,-1).
2.02/2.30	assign(sos_limit,10000).
2.02/2.30	assign(order,kbo).
2.02/2.30	set(lex_order_vars).
2.02/2.30	clear(print_given).
2.02/2.30	
2.02/2.30	% formulas(sos).  % not echoed (8 formulas)
2.02/2.30	
2.02/2.30	============================== end of input ==========================
2.02/2.30	
2.02/2.30	% From the command line: assign(max_seconds, 1440).
2.02/2.30	
2.02/2.30	============================== PROCESS NON-CLAUSAL FORMULAS ==========
2.02/2.30	
2.02/2.30	% Formulas that are not ordinary clauses:
2.02/2.30	1 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	2 (all B all C all D (member(D,difference(B,C)) <-> member(D,B) & -member(D,C))) # label(difference_defn) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	3 (all B all C (C = B <-> (all D (member(D,C) <-> member(D,B))))) # label(equal_member_defn) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	4 (all B all C (C = B <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	5 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	6 (all B all C union(C,B) = union(B,C)) # label(commutativity_of_union) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	7 (all B all C all D (member(D,C) | member(D,B) <-> member(D,union(B,C)))) # label(union_defn) # label(axiom) # label(non_clause).  [assumption].
2.02/2.30	8 -(all B all C all D difference(B,union(C,D)) = difference(difference(B,C),D)) # label(prove_difference_difference_union) # label(negated_conjecture) # label(non_clause).  [assumption].
2.02/2.30	
2.02/2.30	============================== end of process non-clausal formulas ===
2.02/2.30	
2.02/2.30	============================== PROCESS INITIAL CLAUSES ===============
2.02/2.30	
2.02/2.30	============================== PREDICATE ELIMINATION =================
2.02/2.30	
2.02/2.30	============================== end predicate elimination =============
2.02/2.30	
2.02/2.30	Auto_denials:  (non-Horn, no changes).
2.02/2.30	
2.02/2.30	Term ordering decisions:
2.02/2.30	Function symbol KB weights:  c1=1. c2=1. c3=1. union=1. difference=1. f1=1. f2=1.
2.02/2.30	
2.02/2.30	============================== end of process initial clauses ========
2.02/2.30	
2.02/2.30	============================== CLAUSES FOR SEARCH ====================
2.02/2.30	
2.02/2.30	============================== end of clauses for search =============
2.02/2.30	
2.02/2.30	============================== SEARCH ================================
2.02/2.30	
2.02/2.30	% Starting search at 0.01 seconds.
2.02/2.30	
2.02/2.30	Low Water (keep): wt=109.000, iters=3514
2.02/2.30	
2.02/2.30	Low Water (keep): wt=106.00Alarm clock 
179.73/180.01	Prover9 interrupted
179.73/180.02	EOF