0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n024.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   : 1200
0.12/0.33	% DateTime   : Wed Jul 14 15:22:17 EDT 2021
0.12/0.33	% CPUTime    : 
1.48/1.79	============================== Prover9 ===============================
1.48/1.79	Prover9 (32) version 2009-11A, November 2009.
1.48/1.79	Process 3987 was started by sandbox on n024.cluster.edu,
1.48/1.79	Wed Jul 14 15:22:19 2021
1.48/1.79	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_3834_n024.cluster.edu".
1.48/1.79	============================== end of head ===========================
1.48/1.79	
1.48/1.79	============================== INPUT =================================
1.48/1.79	
1.48/1.79	% Reading from file /tmp/Prover9_3834_n024.cluster.edu
1.48/1.79	
1.48/1.79	set(prolog_style_variables).
1.48/1.79	set(auto2).
1.48/1.79	    % set(auto2) -> set(auto).
1.48/1.79	    % set(auto) -> set(auto_inference).
1.48/1.79	    % set(auto) -> set(auto_setup).
1.48/1.79	    % set(auto_setup) -> set(predicate_elim).
1.48/1.79	    % set(auto_setup) -> assign(eq_defs, unfold).
1.48/1.79	    % set(auto) -> set(auto_limits).
1.48/1.79	    % set(auto_limits) -> assign(max_weight, "100.000").
1.48/1.79	    % set(auto_limits) -> assign(sos_limit, 20000).
1.48/1.79	    % set(auto) -> set(auto_denials).
1.48/1.79	    % set(auto) -> set(auto_process).
1.48/1.79	    % set(auto2) -> assign(new_constants, 1).
1.48/1.79	    % set(auto2) -> assign(fold_denial_max, 3).
1.48/1.79	    % set(auto2) -> assign(max_weight, "200.000").
1.48/1.79	    % set(auto2) -> assign(max_hours, 1).
1.48/1.79	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
1.48/1.79	    % set(auto2) -> assign(max_seconds, 0).
1.48/1.79	    % set(auto2) -> assign(max_minutes, 5).
1.48/1.79	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
1.48/1.79	    % set(auto2) -> set(sort_initial_sos).
1.48/1.79	    % set(auto2) -> assign(sos_limit, -1).
1.48/1.79	    % set(auto2) -> assign(lrs_ticks, 3000).
1.48/1.79	    % set(auto2) -> assign(max_megs, 400).
1.48/1.79	    % set(auto2) -> assign(stats, some).
1.48/1.79	    % set(auto2) -> clear(echo_input).
1.48/1.79	    % set(auto2) -> set(quiet).
1.48/1.79	    % set(auto2) -> clear(print_initial_clauses).
1.48/1.79	    % set(auto2) -> clear(print_given).
1.48/1.79	assign(lrs_ticks,-1).
1.48/1.79	assign(sos_limit,10000).
1.48/1.79	assign(order,kbo).
1.48/1.79	set(lex_order_vars).
1.48/1.79	clear(print_given).
1.48/1.79	
1.48/1.79	% formulas(sos).  % not echoed (49 formulas)
1.48/1.79	
1.48/1.79	============================== end of input ==========================
1.48/1.79	
1.48/1.79	% From the command line: assign(max_seconds, 1200).
1.48/1.79	
1.48/1.79	============================== PROCESS NON-CLAUSAL FORMULAS ==========
1.48/1.79	
1.48/1.79	% Formulas that are not ordinary clauses:
1.48/1.79	1 (all P all Q all R lazy_impl(prop(R),impl(lazy_impl(P,impl(Q,R)),R)) = f2(P,Q,R)) # label(def_f2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	2 (all A all B (-bool(A) -> lazy_and1(A,B) = phi(A))) # label(lazy_and1_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	3 (all A all B (-bool(A) -> phi(A) = or1(A,B))) # label(or1_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	4 (all A (-bool(A) -> not1(A) = phi(A))) # label(not1_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	5 (all P all R exists X (-(exists X1 forallprefers(f4(P,X1,R),f4(P,X,R))) & phi(f4(P,X,R)) = f5(P,R))) # label(def_f5) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	6 (all X (false = prop(X) <-> -bool(X))) # label(prop_false) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	7 (all X all Y (existsprefers(X,Y) <-> bool(Y) & -bool(X) & d(Y) & d(X) | X = true & Y = false | -d(X) & d(Y))) # label(def_existsprefers) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	8 (all B lazy_impl(false,B) = true) # label(lazy_impl_axiom2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	9 (all A all B (-bool(B) & bool(A) -> phi(B) = impl(A,B))) # label(impl_axiom2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	10 (all A all B (-bool(B) & bool(A) -> phi(B) = or1(A,B))) # label(or1_axiom2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	11 (all P exists X (exists1(P) = phi(apply(P,X)) & -(exists X1 existsprefers(apply(P,X1),apply(P,X))))) # label(exists1_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	12 (all P all Q all R f1(P,Q,R) = lazy_impl(prop(R),impl(impl(P,impl(Q,R)),R))) # label(def_f1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	13 (all A all B (-bool(A) -> phi(A) = and1(A,B))) # label(and1_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	14 (all B (bool(B) -> B = and1(true,B))) # label(and1_axiom4) # label(axiom) # label(non_clause).  [assumption].
1.48/1.79	15 (all P exists R (exists2(P) = phi(f6(P,R)) & -(exists R1 forallprefers(f6(P,R1),f6(P,R))))) # label(def_exists2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	16 (all A all B (-bool(A) -> impl(A,B) = phi(A))) # label(impl_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	17 (all P all Q exists R (-(exists R1 forallprefers(f1(P,Q,R1),f1(P,Q,R))) & phi(f1(P,Q,R)) = and2(P,Q))) # label(def_and2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	18 (all X all Y (forallprefers(X,Y) <-> bool(Y) & -bool(X) & d(Y) & d(X) | true = Y & false = X | -d(X) & d(Y))) # label(def_forallprefers) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	19 (exists P (-(exists P1 forallprefers(f7(P1),f7(P))) & false2 = phi(f7(P)))) # label(def_false2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	20 (all P all Q all R f3(P,Q,R) = lazy_impl(prop(R),impl(impl(P,R),impl(impl(Q,R),R)))) # label(def_f3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	21 (all B (bool(B) -> B = impl(true,B))) # label(impl_axiom4) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	22 (all B lazy_and1(false,B) = false) # label(lazy_and1_axiom2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	23 (all B (bool(B) -> true = impl(false,B))) # label(impl_axiom3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	24 (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].
1.48/1.80	25 (all B lazy_and1(true,B) = phi(B)) # label(lazy_and1_axiom3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	26 (all B (bool(B) -> and1(false,B) = false)) # label(and1_axiom3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	27 (all A all B (-bool(B) & bool(A) -> and1(A,B) = phi(B))) # label(and1_axiom2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	28 (all P all Q exists R (phi(f2(P,Q,R)) = lazy_and2(P,Q) & -(exists R1 forallprefers(f2(P,Q,R1),f2(P,Q,R))))) # label(def_lazy_and2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	29 (all X (phi(X) = err & -d(X) | d(X) & X = phi(X))) # label(def_phi) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	30 (all B (bool(B) -> true = or1(true,B))) # label(or1_axiom3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	31 (all P all X all R f4(P,X,R) = impl(apply(P,X),R)) # label(def_f4) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	32 (all B (bool(B) -> or1(false,B) = B)) # label(or1_axiom4) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	33 (all P impl(P,false2) = not2(P)) # label(def_not2) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	34 (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].
1.48/1.80	35 (all P lazy_impl(prop(P),P) = f7(P)) # label(def_f7) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	36 (all A all B (-bool(A) -> lazy_impl(A,B) = phi(A))) # label(lazy_impl_axiom1) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	37 (all B lazy_impl(true,B) = phi(B)) # label(lazy_impl_axiom3) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	38 (all X (bool(X) <-> true = prop(X))) # label(prop_true) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	39 (all X (false = X | true = X <-> bool(X))) # label(def_bool) # label(axiom) # label(non_clause).  [assumption].
1.48/1.80	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].
1.48/1.80	
1.48/1.80	============================== end of process non-clausal formulas ===
1.48/1.80	
1.48/1.80	============================== PROCESS INITIAL CLAUSES ===============
1.48/1.80	
1.48/1.80	============================== PREDICATE ELIMINATION =================
1.48/1.80	
1.48/1.80	============================== end predicate elimination =============
1.48/1.80	
1.48/1.80	Auto_denials:  (non-Horn, no changes).
1.48/1.80	
1.48/1.80	Term ordering decisions:
1.48/1.80	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. f4=1. f7=1. f8=1. phi=1. prop=1. not1=1. f7=1. exists1=1. exists2=1.Alarm clock 
119.78/120.05	Prover9 interrupted
119.78/120.05	EOF