0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n009.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 11:04:56 EDT 2023
0.13/0.34	% CPUTime  : 
0.46/1.04	============================== Prover9 ===============================
0.46/1.04	Prover9 (32) version 2009-11A, November 2009.
0.46/1.04	Process 30715 was started by sandbox2 on n009.cluster.edu,
0.46/1.04	Mon Jul  3 11:04:57 2023
0.46/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_30560_n009.cluster.edu".
0.46/1.04	============================== end of head ===========================
0.46/1.04	
0.46/1.04	============================== INPUT =================================
0.46/1.04	
0.46/1.04	% Reading from file /tmp/Prover9_30560_n009.cluster.edu
0.46/1.04	
0.46/1.04	set(prolog_style_variables).
0.46/1.04	set(auto2).
0.46/1.04	    % set(auto2) -> set(auto).
0.46/1.04	    % set(auto) -> set(auto_inference).
0.46/1.04	    % set(auto) -> set(auto_setup).
0.46/1.04	    % set(auto_setup) -> set(predicate_elim).
0.46/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.46/1.04	    % set(auto) -> set(auto_limits).
0.46/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.46/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.46/1.04	    % set(auto) -> set(auto_denials).
0.46/1.04	    % set(auto) -> set(auto_process).
0.46/1.04	    % set(auto2) -> assign(new_constants, 1).
0.46/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.46/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.46/1.04	    % set(auto2) -> assign(max_hours, 1).
0.46/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.46/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.46/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.46/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.46/1.04	    % set(auto2) -> set(sort_initial_sos).
0.46/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.46/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.46/1.04	    % set(auto2) -> assign(max_megs, 400).
0.46/1.04	    % set(auto2) -> assign(stats, some).
0.46/1.04	    % set(auto2) -> clear(echo_input).
0.46/1.04	    % set(auto2) -> set(quiet).
0.46/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.46/1.04	    % set(auto2) -> clear(print_given).
0.46/1.04	assign(lrs_ticks,-1).
0.46/1.04	assign(sos_limit,10000).
0.46/1.04	assign(order,kbo).
0.46/1.04	set(lex_order_vars).
0.46/1.04	clear(print_given).
0.46/1.04	
0.46/1.04	% formulas(sos).  % not echoed (49 formulas)
0.46/1.04	
0.46/1.04	============================== end of input ==========================
0.46/1.04	
0.46/1.04	% From the command line: assign(max_seconds, 1440).
0.46/1.04	
0.46/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.46/1.04	
0.46/1.04	% Formulas that are not ordinary clauses:
0.46/1.04	1 (all X (bool(X) <-> true = prop(X))) # label(prop_true) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	2 (all B (bool(B) -> false = and1(false,B))) # label(and1_axiom3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	3 (all P all R exists X (f5(P,R) = phi(f4(P,X,R)) & -(exists X1 forallprefers(f4(P,X1,R),f4(P,X,R))))) # label(def_f5) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	4 (all P all Q exists R (phi(f1(P,Q,R)) = and2(P,Q) & -(exists R1 forallprefers(f1(P,Q,R1),f1(P,Q,R))))) # label(def_and2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	5 (all X (-d(X) & err = phi(X) | d(X) & X = phi(X))) # label(def_phi) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	6 (all B lazy_impl(true,B) = phi(B)) # label(lazy_impl_axiom3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	7 (all B (bool(B) -> and1(true,B) = B)) # label(and1_axiom4) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	8 (all B lazy_and1(true,B) = phi(B)) # label(lazy_and1_axiom3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	9 (all P all Q exists R (-(exists R1 forallprefers(f2(P,Q,R1),f2(P,Q,R))) & lazy_and2(P,Q) = phi(f2(P,Q,R)))) # label(def_lazy_and2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	10 (all A all B (-bool(A) -> phi(A) = lazy_and1(A,B))) # label(lazy_and1_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	11 (all X all Y (-bool(X) & bool(Y) & d(Y) & d(X) | true = X & false = Y | -d(X) & d(Y) <-> existsprefers(X,Y))) # label(def_existsprefers) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	12 (all A all B (bool(A) & -bool(B) -> impl(A,B) = phi(B))) # label(impl_axiom2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	13 (all A all B (-bool(A) -> or1(A,B) = phi(A))) # label(or1_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	14 (all B (bool(B) -> true = or1(true,B))) # label(or1_axiom3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	15 (all P all X all R impl(apply(P,X),R) = f4(P,X,R)) # label(def_f4) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	16 (all A all B (-bool(A) -> lazy_impl(A,B) = phi(A))) # label(lazy_impl_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	17 (all B (bool(B) -> true = impl(false,B))) # label(impl_axiom3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	18 (all P all Q all R f2(P,Q,R) = lazy_impl(prop(R),impl(lazy_impl(P,impl(Q,R)),R))) # label(def_f2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	19 (all P all Q exists R (phi(f3(P,Q,R)) = or2(P,Q) & -(exists R1 forallprefers(f3(P,Q,R1),f3(P,Q,R))))) # label(def_or2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	20 (all P impl(P,false2) = not2(P)) # label(def_not2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	21 (all B true = lazy_impl(false,B)) # label(lazy_impl_axiom2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	22 (all P all Q all R lazy_impl(prop(R),impl(impl(P,R),impl(impl(Q,R),R))) = f3(P,Q,R)) # label(def_f3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	23 (all B (bool(B) -> impl(true,B) = B)) # label(impl_axiom4) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	24 (all A all B (bool(A) & -bool(B) -> phi(B) = or1(A,B))) # label(or1_axiom2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	25 (all A all B (-bool(A) -> impl(A,B) = phi(A))) # label(impl_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	26 (all X (X = true | X = false <-> bool(X))) # label(def_bool) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	27 (all P all R lazy_impl(prop(R),impl(f5(P,R),R)) = f6(P,R)) # label(def_f6) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	28 (all P f7(P) = lazy_impl(prop(P),P)) # label(def_f7) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	29 (all A all B (-bool(B) & bool(A) -> and1(A,B) = phi(B))) # label(and1_axiom2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	30 (exists P (false2 = phi(f7(P)) & -(exists P1 forallprefers(f7(P1),f7(P))))) # label(def_false2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	31 (all B (bool(B) -> or1(false,B) = B)) # label(or1_axiom4) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	32 (all P exists R (phi(f6(P,R)) = exists2(P) & -(exists R1 forallprefers(f6(P,R1),f6(P,R))))) # label(def_exists2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	33 (all B lazy_and1(false,B) = false) # label(lazy_and1_axiom2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	34 (all P all Q all R lazy_impl(prop(R),impl(impl(P,impl(Q,R)),R)) = f1(P,Q,R)) # label(def_f1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	35 (all A all B (-bool(A) -> phi(A) = and1(A,B))) # label(and1_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	36 (all X all Y (-d(X) & d(Y) | false = X & Y = true | d(X) & d(Y) & -bool(X) & bool(Y) <-> forallprefers(X,Y))) # label(def_forallprefers) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	37 (all P exists X (-(exists X1 existsprefers(apply(P,X1),apply(P,X))) & phi(apply(P,X)) = exists1(P))) # label(exists1_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	38 (all A (-bool(A) -> phi(A) = not1(A))) # label(not1_axiom1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	39 (all X (prop(X) = false <-> -bool(X))) # label(prop_false) # label(axiom) # label(non_clause).  [assumption].
0.46/1.04	40 -(all P ((all X1 all X2 (-bool(apply(P,X2)) & -bool(apply(P,X1)) -> apply(P,X1) = apply(P,X2))) -> exists1(P) = exists2(P))) # label(exists1_exists2) # label(negated_conjecture) # label(non_clause).  [assumption].
0.46/1.04	
0.46/1.04	============================== end of process non-clausal formulas ===
0.46/1.04	
0.46/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.46/1.04	
0.46/1.04	============================== PREDICATE ELIMINATION =================
0.46/1.04	
0.46/1.04	============================== end predicate elimination =============
0.46/1.04	
0.46/1.04	Auto_denials:  (non-Horn, no changes).
0.46/1.04	
0.46/1.04	Term ordering decisions:
0.46/1.04	Function symbol KB weights:  true=1. false=1. err=1. false2=1. false1=1. c1=1. c2=1. impl=1. lazy_impl=1. apply=1. and1=1. or1=1. lazy_and1=1. f5=1. f6=1. and2=1. lazy_and2=1. or2=1. f1=1. f2=1. f3=1. f4=1. phi=1. prop=1. not1=1. f7=1. exists1=1. existAlarm clock 
179.77/180.04	Prover9 interrupted
179.77/180.04	EOF