0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n010.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 17:26:51 EDT 2019
0.12/0.33	% CPUTime    : 
0.41/1.01	============================== Prover9 ===============================
0.41/1.01	Prover9 (32) version 2009-11A, November 2009.
0.41/1.01	Process 19866 was started by sandbox on n010.cluster.edu,
0.41/1.01	Thu Aug 29 17:26:52 2019
0.41/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_19713_n010.cluster.edu".
0.41/1.01	============================== end of head ===========================
0.41/1.01	
0.41/1.01	============================== INPUT =================================
0.41/1.01	
0.41/1.01	% Reading from file /tmp/Prover9_19713_n010.cluster.edu
0.41/1.01	
0.41/1.01	set(prolog_style_variables).
0.41/1.01	set(auto2).
0.41/1.01	    % set(auto2) -> set(auto).
0.41/1.01	    % set(auto) -> set(auto_inference).
0.41/1.01	    % set(auto) -> set(auto_setup).
0.41/1.01	    % set(auto_setup) -> set(predicate_elim).
0.41/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/1.01	    % set(auto) -> set(auto_limits).
0.41/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/1.01	    % set(auto) -> set(auto_denials).
0.41/1.01	    % set(auto) -> set(auto_process).
0.41/1.01	    % set(auto2) -> assign(new_constants, 1).
0.41/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.41/1.01	    % set(auto2) -> assign(max_hours, 1).
0.41/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.41/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.41/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/1.01	    % set(auto2) -> set(sort_initial_sos).
0.41/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.41/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/1.01	    % set(auto2) -> assign(max_megs, 400).
0.41/1.01	    % set(auto2) -> assign(stats, some).
0.41/1.01	    % set(auto2) -> clear(echo_input).
0.41/1.01	    % set(auto2) -> set(quiet).
0.41/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.41/1.01	    % set(auto2) -> clear(print_given).
0.41/1.01	assign(lrs_ticks,-1).
0.41/1.01	assign(sos_limit,10000).
0.41/1.01	assign(order,kbo).
0.41/1.01	set(lex_order_vars).
0.41/1.01	clear(print_given).
0.41/1.01	
0.41/1.01	% formulas(sos).  % not echoed (52 formulas)
0.41/1.01	
0.41/1.01	============================== end of input ==========================
0.41/1.01	
0.41/1.01	% From the command line: assign(max_seconds, 180).
0.41/1.01	
0.41/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/1.01	
0.41/1.01	% Formulas that are not ordinary clauses:
0.41/1.01	1 op_and -> (all X all Y not(or(not(X),not(Y))) = and(X,Y)) # label(op_and) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	2 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	3 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	4 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	5 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].
0.41/1.01	6 (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) <-> axiom_m5 # label(axiom_m5) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	7 (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),P))) <-> axiom_m7 # label(axiom_m7) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	8 adjunction <-> (all X all Y (is_a_theorem(X) & is_a_theorem(Y) -> is_a_theorem(and(X,Y)))) # label(adjunction) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	9 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	10 (all X is_a_theorem(strict_implies(X,possibly(X)))) <-> axiom_m6 # label(axiom_m6) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	11 (all X is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))) <-> axiom_s4 # label(axiom_s4) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	12 axiom_m1 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),and(Y,X)))) # label(axiom_m1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	13 (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) <-> substitution_strict_equiv # label(substitution_strict_equiv) # label(axiom) # label(non_clause).  [assumption].
0.41/1.01	14 axiom_m8 <-> (all P all Q is_a_theorem(strict_implies(strict_implies(P,Q),strict_implies(possibly(P),possibly(Q))))) # label(axiom_m8) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	15 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	16 (all X all Y is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))) <-> axiom_K # label(axiom_K) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	17 axiom_s1 <-> (all X all Y all Z is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))) # label(axiom_s1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	18 (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) <-> axiom_4 # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	19 axiom_s2 <-> (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),and(possibly(P),possibly(Q))))) # label(axiom_s2) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	20 (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))) <-> axiom_m10 # label(axiom_m10) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	21 modus_ponens_strict_implies <-> (all X all Y (is_a_theorem(X) & is_a_theorem(strict_implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens_strict_implies) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	22 (all X is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))) <-> axiom_m9 # label(axiom_m9) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	23 (all X is_a_theorem(strict_implies(X,and(X,X)))) <-> axiom_m4 # label(axiom_m4) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	24 (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) <-> axiom_5 # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	25 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	26 axiom_m2 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),X))) # label(axiom_m2) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	27 axiom_s3 <-> (all X all Y is_a_theorem(strict_implies(strict_implies(X,Y),strict_implies(not(possibly(Y)),not(possibly(X)))))) # label(axiom_s3) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	28 axiom_m3 <-> (all X all Y all Z is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z))))) # label(axiom_m3) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	29 op_necessarily -> (all X necessarily(X) = not(possibly(not(X)))) # label(op_necessarily) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	30 op_strict_equiv -> (all X all Y and(strict_implies(X,Y),strict_implies(Y,X)) = strict_equiv(X,Y)) # label(op_strict_equiv) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	31 op_strict_implies -> (all X all Y necessarily(implies(X,Y)) = strict_implies(X,Y)) # label(op_strict_implies) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	32 op_possibly -> (all X not(necessarily(not(X))) = possibly(X)) # label(op_possibly) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	
0.73/1.02	============================== end of process non-clausal formulas ===
0.73/1.02	
0.73/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.02	
0.73/1.02	============================== PREDICATE ELIMINATION =================
0.73/1.02	
0.73/1.02	============================== end predicate elimination =============
0.73/1.02	
0.73/1.02	Auto_denials:  (non-Horn, no changes).
0.73/1.02	
0.73/1.02	Term ordering decisions:
0.73/1.02	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. strict_implies=1. and=1. implies=1. or=1. strict_equiv=1. equiv=1. necessarily=1. possibly=1. not=1.
0.73/1.02	
0.73/1.02	============================== end of process initial clauses ========
0.73/1.02	
0.73/1.02	============================== CLAUSES FOR SEARCH ====================
0.73/1.02	
0.73/1.02	============================== end of clauses for search =============
0.73/1.02	
180.05/180.32	Cputime limit exceeded (core dumped)
180.05/180.32	EOF