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