0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.33	% Computer   : n004.cluster.edu
0.11/0.33	% Model      : x86_64 x86_64
0.11/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory     : 8042.1875MB
0.11/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 960
0.11/0.33	% DateTime   : Thu Jul  2 15:11:28 EDT 2020
0.11/0.33	% CPUTime    : 
0.79/0.98	============================== Prover9 ===============================
0.79/0.98	Prover9 (32) version 2009-11A, November 2009.
0.79/0.98	Process 11903 was started by sandbox on n004.cluster.edu,
0.79/0.98	Thu Jul  2 15:11:29 2020
0.79/0.98	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_11750_n004.cluster.edu".
0.79/0.98	============================== end of head ===========================
0.79/0.98	
0.79/0.98	============================== INPUT =================================
0.79/0.98	
0.79/0.98	% Reading from file /tmp/Prover9_11750_n004.cluster.edu
0.79/0.98	
0.79/0.98	set(prolog_style_variables).
0.79/0.98	set(auto2).
0.79/0.98	    % set(auto2) -> set(auto).
0.79/0.98	    % set(auto) -> set(auto_inference).
0.79/0.98	    % set(auto) -> set(auto_setup).
0.79/0.98	    % set(auto_setup) -> set(predicate_elim).
0.79/0.98	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/0.98	    % set(auto) -> set(auto_limits).
0.79/0.98	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/0.98	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/0.98	    % set(auto) -> set(auto_denials).
0.79/0.98	    % set(auto) -> set(auto_process).
0.79/0.98	    % set(auto2) -> assign(new_constants, 1).
0.79/0.98	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/0.98	    % set(auto2) -> assign(max_weight, "200.000").
0.79/0.98	    % set(auto2) -> assign(max_hours, 1).
0.79/0.98	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/0.98	    % set(auto2) -> assign(max_seconds, 0).
0.79/0.98	    % set(auto2) -> assign(max_minutes, 5).
0.79/0.98	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/0.98	    % set(auto2) -> set(sort_initial_sos).
0.79/0.98	    % set(auto2) -> assign(sos_limit, -1).
0.79/0.98	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/0.98	    % set(auto2) -> assign(max_megs, 400).
0.79/0.98	    % set(auto2) -> assign(stats, some).
0.79/0.98	    % set(auto2) -> clear(echo_input).
0.79/0.98	    % set(auto2) -> set(quiet).
0.79/0.98	    % set(auto2) -> clear(print_initial_clauses).
0.79/0.98	    % set(auto2) -> clear(print_given).
0.79/0.98	assign(lrs_ticks,-1).
0.79/0.98	assign(sos_limit,10000).
0.79/0.98	assign(order,kbo).
0.79/0.98	set(lex_order_vars).
0.79/0.98	clear(print_given).
0.79/0.98	
0.79/0.98	% formulas(sos).  % not echoed (43 formulas)
0.79/0.98	
0.79/0.98	============================== end of input ==========================
0.79/0.98	
0.79/0.98	% From the command line: assign(max_seconds, 960).
0.79/0.98	
0.79/0.98	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/0.98	
0.79/0.98	% Formulas that are not ordinary clauses:
0.79/0.98	1 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) <-> equivalence_1 # label(equivalence_1) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	2 (all X all Y is_a_theorem(implies(Y,or(X,Y)))) <-> or_2 # label(or_2) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	3 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	4 (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) <-> and_3 # label(and_3) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	5 or_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) # label(or_3) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	6 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	7 (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) <-> modus_tollens # label(modus_tollens) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	8 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	9 cn2 <-> (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) # label(cn2) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	10 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	11 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	12 (all X all Y (is_a_theorem(equiv(X,Y)) -> X = Y)) <-> substitution_of_equivalents # label(substitution_of_equivalents) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	13 (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) <-> equivalence_3 # label(equivalence_3) # label(axiom) # label(non_clause).  [assumption].
0.79/0.98	14 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	15 (all P all Q is_a_theorem(implies(Q,or(P,Q)))) <-> r2 # label(r2) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	16 implies_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) # label(implies_3) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	17 (all X all Y is_a_theorem(implies(X,or(X,Y)))) <-> or_1 # label(or_1) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	18 (all P is_a_theorem(implies(implies(not(P),P),P))) <-> cn3 # label(cn3) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	19 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	20 (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) <-> cn1 # label(cn1) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	21 (all X all Y is_a_theorem(implies(and(X,Y),X))) <-> and_1 # label(and_1) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	22 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) <-> equivalence_2 # label(equivalence_2) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	23 (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) <-> r4 # label(r4) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	24 (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) <-> modus_ponens # label(modus_ponens) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	25 implies_2 <-> (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) # label(implies_2) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	26 (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) <-> r5 # label(r5) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	27 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	28 op_equiv -> (all X all Y and(implies(X,Y),implies(Y,X)) = equiv(X,Y)) # label(op_equiv) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	29 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	30 op_implies_and -> (all X all Y not(and(X,not(Y))) = implies(X,Y)) # label(op_implies_and) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	31 op_implies_or -> (all X all Y or(not(X),Y) = implies(X,Y)) # label(op_implies_or) # label(axiom) # label(non_clause).  [assumption].
1.45/1.68	
1.45/1.68	============================== end of process non-clausal formulas ===
1.45/1.68	
1.45/1.68	============================== PROCESS INITIAL CLAUSES ===============
1.45/1.68	
1.45/1.68	============================== PREDICATE ELIMINATION =================
1.45/1.68	
1.45/1.68	============================== end predicate elimination =============
1.45/1.68	
1.45/1.68	Auto_denials:  (non-Horn, no changes).
1.45/1.68	
1.45/1.68	Term ordering decisions:
1.45/1.68	
1.45/1.68	% Assigning unary symbol not kb_weight 0 and highest precedence (94).
1.45/1.68	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. c40=1. c41=1. c42=1. c43=1. c44=1. c45=1. c46=1. c47=1. c48=1. c49=1. c50=1. c51=1. c52=1. c53=1. c54=1. c55=1. implies=1. or=1. and=1. equiv=1. not=0.
1.45/1.68	
1.45/1.68	============================== end of process initial clauses ========
1.45/1.68	
1.45/1.68	============================== CLAUSES FOR SEARCH ====================
1.45/1.68	
1.45/1.68	============================== end of clauses for search =============
1.45/1.68	
1.45/1.68	============================== SEARCH ================================
1.45/1.68	
1.45/1.68	% Starting search at 0.02 seconds.
1.45/1.68	
1.45/1.68	Low Water (keep): wt=47.000, iters=3363
1.45/1.68	
1.45/1.68	Low Water (keep): wt=42.000, iters=3357
1.45/1.68	
1.45/1.68	Low Water (keep): wt=40.000, iters=3335
1.45/1.68	
1.45/1.68	Low Water (keep): wt=39.000, iters=3373
1.45/1.68	
1.45/1.68	Low Water (keep): wt=38.000, iters=3375
1.45/1.68	
1.45/1.68	Low Water (keep): wt=37.000, iters=3378
1.45/1.68	
1.45/1.68	Low Water (keep): wt=36.000, iters=3342
1.45/1.68	
1.45/1.68	Low Water (keep): wt=33.000, iters=3444
1.45/1.68	
1.45/1.68	Low Water (keep): wt=27.000, iters=3402
1.45/1.68	
1.45/1.68	Low Water (keep): wt=26.000, iters=3373
1.45/1.68	
119.74/120.04	Alarm clock 
119.74/120.04	Prover9 interrupted
119.74/120.04	EOF