0.11/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.31	% Computer : n027.cluster.edu
0.13/0.31	% Model    : x86_64 x86_64
0.13/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.31	% Memory   : 8042.1875MB
0.13/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.31	% CPULimit : 1440
0.13/0.31	% WCLimit  : 180
0.13/0.31	% DateTime : Mon Jul  3 07:37:31 EDT 2023
0.13/0.31	% CPUTime  : 
0.70/1.00	============================== Prover9 ===============================
0.70/1.00	Prover9 (32) version 2009-11A, November 2009.
0.70/1.00	Process 5713 was started by sandbox on n027.cluster.edu,
0.70/1.00	Mon Jul  3 07:37:32 2023
0.70/1.00	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_5559_n027.cluster.edu".
0.70/1.00	============================== end of head ===========================
0.70/1.00	
0.70/1.00	============================== INPUT =================================
0.70/1.00	
0.70/1.00	% Reading from file /tmp/Prover9_5559_n027.cluster.edu
0.70/1.00	
0.70/1.00	set(prolog_style_variables).
0.70/1.00	set(auto2).
0.70/1.00	    % set(auto2) -> set(auto).
0.70/1.00	    % set(auto) -> set(auto_inference).
0.70/1.00	    % set(auto) -> set(auto_setup).
0.70/1.00	    % set(auto_setup) -> set(predicate_elim).
0.70/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.70/1.00	    % set(auto) -> set(auto_limits).
0.70/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.70/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.70/1.00	    % set(auto) -> set(auto_denials).
0.70/1.00	    % set(auto) -> set(auto_process).
0.70/1.00	    % set(auto2) -> assign(new_constants, 1).
0.70/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.70/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.70/1.00	    % set(auto2) -> assign(max_hours, 1).
0.70/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.70/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.70/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.70/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.70/1.00	    % set(auto2) -> set(sort_initial_sos).
0.70/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.70/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.70/1.00	    % set(auto2) -> assign(max_megs, 400).
0.70/1.00	    % set(auto2) -> assign(stats, some).
0.70/1.00	    % set(auto2) -> clear(echo_input).
0.70/1.00	    % set(auto2) -> set(quiet).
0.70/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.70/1.00	    % set(auto2) -> clear(print_given).
0.70/1.00	assign(lrs_ticks,-1).
0.70/1.00	assign(sos_limit,10000).
0.70/1.00	assign(order,kbo).
0.70/1.00	set(lex_order_vars).
0.70/1.00	clear(print_given).
0.70/1.00	
0.70/1.00	% formulas(sos).  % not echoed (10 formulas)
0.70/1.00	
0.70/1.00	============================== end of input ==========================
0.70/1.00	
0.70/1.00	% From the command line: assign(max_seconds, 1440).
0.70/1.00	
0.70/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.70/1.00	
0.70/1.00	% Formulas that are not ordinary clauses:
0.70/1.00	1 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	2 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	3 (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.70/1.00	4 (all B all C intersection(C,B) = intersection(B,C)) # label(commutativity_of_intersection) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	5 (all B all C all D (member(D,B) | member(D,C) <-> member(D,union(B,C)))) # label(union_defn) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	6 (all B all C (C = B <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	7 (all B all C all D (member(D,intersection(B,C)) <-> member(D,B) & member(D,C))) # label(intersection_defn) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	8 (all B all C (C = B <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	9 (all B all C union(C,B) = union(B,C)) # label(commutativity_of_union) # label(axiom) # label(non_clause).  [assumption].
0.70/1.00	10 -(all B all C union(intersection(B,C),difference(B,C)) = B) # label(prove_union_intersection_difference) # label(negated_conjecture) # label(non_clause).  [assumption].
0.70/1.00	
0.70/1.00	============================== end of process non-clausal formulas ===
0.70/1.00	
0.70/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.70/1.00	
0.70/1.00	============================== PREDICATE ELIMINATION =================
0.70/1.00	
0.70/1.00	============================== end predicate elimination =============
0.70/1.00	
0.70/1.00	Auto_denials:  (non-Horn, no changes).
0.70/1.00	
0.70/1.00	Term ordering decisions:
0.70/1.00	Function symbol KB weights:  c1=1. c2=1. intersection=1. union=1. difference=1. f1=1. f2=1.
0.70/1.00	
0.70/1.00	============================== end of process initial clauses ========
0.70/1.00	
0.70/1.00	==========================Alarm clock 
179.72/180.07	Prover9 interrupted
179.72/180.07	EOF