0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.31	% Computer   : n018.cluster.edu
0.11/0.31	% Model      : x86_64 x86_64
0.11/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory     : 8042.1875MB
0.11/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 1200
0.11/0.31	% DateTime   : Tue Jul 13 16:28:38 EDT 2021
0.16/0.32	% CPUTime    : 
0.74/1.05	============================== Prover9 ===============================
0.74/1.05	Prover9 (32) version 2009-11A, November 2009.
0.74/1.05	Process 26388 was started by sandbox2 on n018.cluster.edu,
0.74/1.05	Tue Jul 13 16:28:39 2021
0.74/1.05	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_26231_n018.cluster.edu".
0.74/1.05	============================== end of head ===========================
0.74/1.05	
0.74/1.05	============================== INPUT =================================
0.74/1.05	
0.74/1.05	% Reading from file /tmp/Prover9_26231_n018.cluster.edu
0.74/1.05	
0.74/1.05	set(prolog_style_variables).
0.74/1.05	set(auto2).
0.74/1.05	    % set(auto2) -> set(auto).
0.74/1.05	    % set(auto) -> set(auto_inference).
0.74/1.05	    % set(auto) -> set(auto_setup).
0.74/1.05	    % set(auto_setup) -> set(predicate_elim).
0.74/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.05	    % set(auto) -> set(auto_limits).
0.74/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.05	    % set(auto) -> set(auto_denials).
0.74/1.05	    % set(auto) -> set(auto_process).
0.74/1.05	    % set(auto2) -> assign(new_constants, 1).
0.74/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.05	    % set(auto2) -> assign(max_hours, 1).
0.74/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.05	    % set(auto2) -> set(sort_initial_sos).
0.74/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.05	    % set(auto2) -> assign(max_megs, 400).
0.74/1.05	    % set(auto2) -> assign(stats, some).
0.74/1.05	    % set(auto2) -> clear(echo_input).
0.74/1.05	    % set(auto2) -> set(quiet).
0.74/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.05	    % set(auto2) -> clear(print_given).
0.74/1.05	assign(lrs_ticks,-1).
0.74/1.05	assign(sos_limit,10000).
0.74/1.05	assign(order,kbo).
0.74/1.05	set(lex_order_vars).
0.74/1.05	clear(print_given).
0.74/1.05	
0.74/1.05	% formulas(sos).  % not echoed (43 formulas)
0.74/1.05	
0.74/1.05	============================== end of input ==========================
0.74/1.05	
0.74/1.05	% From the command line: assign(max_seconds, 1200).
0.74/1.05	
0.74/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.05	
0.74/1.05	% Formulas that are not ordinary clauses:
0.74/1.05	1 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].
0.74/1.05	2 (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].
0.74/1.05	3 (all X all Y is_a_theorem(implies(and(X,Y),X))) <-> and_1 # label(and_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	4 (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) <-> implies_2 # label(implies_2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	5 (all X all Y (is_a_theorem(implies(X,Y)) & is_a_theorem(X) -> is_a_theorem(Y))) <-> modus_ponens # label(modus_ponens) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	6 (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) <-> cn2 # label(cn2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	7 (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].
0.74/1.05	8 equivalence_3 <-> (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) # label(equivalence_3) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	9 equivalence_1 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) # label(equivalence_1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	10 (all P is_a_theorem(implies(or(P,P),P))) <-> r1 # label(r1) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	11 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	12 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	13 and_3 <-> (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) # label(and_3) # label(axiom) # label(non_clause).  [assumption].
0.74/1.05	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.32/1.67	15 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	16 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	17 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	18 (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.32/1.67	19 r4 <-> (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) # label(r4) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	20 (all P all Q is_a_theorem(implies(and(P,Q),P))) <-> kn2 # label(kn2) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	21 (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].
1.32/1.67	22 (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) <-> or_3 # label(or_3) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	23 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	24 r2 <-> (all P all Q is_a_theorem(implies(Q,or(P,Q)))) # label(r2) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	25 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	26 (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].
1.32/1.67	27 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	28 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	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.32/1.67	30 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.32/1.67	31 op_and -> (all X all Y not(or(not(X),not(Y))) = and(X,Y)) # label(op_and) # label(axiom) # label(non_clause).  [assumption].
1.32/1.67	
1.32/1.67	============================== end of process non-clausal formulas ===
1.32/1.67	
1.32/1.67	============================== PROCESS INITIAL CLAUSES ===============
1.32/1.67	
1.32/1.67	============================== PREDICATE ELIMINATION =================
1.32/1.67	
1.32/1.67	============================== end predicate elimination =============
1.32/1.67	
1.32/1.67	Auto_denials:  (non-Horn, no changes).
1.32/1.67	
1.32/1.67	Term ordering decisions:
1.32/1.67	
1.32/1.67	% Assigning unary symbol not kb_weight 0 and highest precedence (94).
1.32/1.67	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.32/1.67	
1.32/1.67	============================== end of process initial clauses ========
1.32/1.67	
1.32/1.67	============================== CLAUSES FOR SEARCH ====================
1.32/1.67	
1.32/1.67	============================== end of clauses for search =============
1.32/1.67	
1.32/1.67	============================== SEARCH ================================
1.32/1.67	
1.32/1.67	% Starting search at 0.01 seconds.
1.32/1.67	
1.32/1.67	Low Water (keep): wt=43.000, iters=3363
1.32/1.67	
1.32/1.67	Low Water (keep): wt=40.000, iters=3461
1.32/1.67	
1.32/1.67	Low Water (keep): wt=36.000, iters=3339
1.32/1.67	
1.32/1.67	Low Water (keep): wt=33.000, iters=3370
1.32/1.67	
1.32/1.67	Low Water (keep): wt=32.000, iters=3369
1.32/1.67	
1.32/1.67	Low Water (keep): wt=30.000, iters=3333
1.32/1.67	
1.32/1.67	Low Water (keep): wt=29.000, iters=3488
1.32/1.67	
1.32/1.67	Low Water (keep): wt=27.000, iters=3407
1.32/1.67	
1.32/1.67	Low Water (keep): wt=25.000, iters=3391
1.32/1.67	
1.32/1.67	Low Water (keep): wt=24.000, iters=34Alarm clock 
119.27/120.07	Prover9 interrupted
119.27/120.08	EOF