0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n024.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% DateTime   : Thu Jul  2 10:44:19 EDT 2020
0.11/0.33	% CPUTime    : 
0.78/1.20	============================== Prover9 ===============================
0.78/1.20	Prover9 (32) version 2009-11A, November 2009.
0.78/1.20	Process 19631 was started by sandbox2 on n024.cluster.edu,
0.78/1.20	Thu Jul  2 10:44:20 2020
0.78/1.20	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19478_n024.cluster.edu".
0.78/1.20	============================== end of head ===========================
0.78/1.20	
0.78/1.20	============================== INPUT =================================
0.78/1.20	
0.78/1.20	% Reading from file /tmp/Prover9_19478_n024.cluster.edu
0.78/1.20	
0.78/1.20	set(prolog_style_variables).
0.78/1.20	set(auto2).
0.78/1.20	    % set(auto2) -> set(auto).
0.78/1.20	    % set(auto) -> set(auto_inference).
0.78/1.20	    % set(auto) -> set(auto_setup).
0.78/1.20	    % set(auto_setup) -> set(predicate_elim).
0.78/1.20	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.20	    % set(auto) -> set(auto_limits).
0.78/1.20	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.20	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.20	    % set(auto) -> set(auto_denials).
0.78/1.20	    % set(auto) -> set(auto_process).
0.78/1.20	    % set(auto2) -> assign(new_constants, 1).
0.78/1.20	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.20	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.20	    % set(auto2) -> assign(max_hours, 1).
0.78/1.20	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.20	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.20	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.20	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.20	    % set(auto2) -> set(sort_initial_sos).
0.78/1.20	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.20	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.20	    % set(auto2) -> assign(max_megs, 400).
0.78/1.20	    % set(auto2) -> assign(stats, some).
0.78/1.20	    % set(auto2) -> clear(echo_input).
0.78/1.20	    % set(auto2) -> set(quiet).
0.78/1.20	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.20	    % set(auto2) -> clear(print_given).
0.78/1.20	assign(lrs_ticks,-1).
0.78/1.20	assign(sos_limit,10000).
0.78/1.20	assign(order,kbo).
0.78/1.20	set(lex_order_vars).
0.78/1.20	clear(print_given).
0.78/1.20	
0.78/1.20	% formulas(sos).  % not echoed (43 formulas)
0.78/1.20	
0.78/1.20	============================== end of input ==========================
0.78/1.20	
0.78/1.20	% From the command line: assign(max_seconds, 960).
0.78/1.20	
0.78/1.20	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.20	
0.78/1.20	% Formulas that are not ordinary clauses:
0.78/1.20	1 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (all W2 (W2 = sdtpldt1(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> (exists W4 exists W5 (aElementOf0(W4,W0) & aElementOf0(W5,W1) & sdtpldt0(W4,W5) = W3)))))))) # label(mDefSSum) # label(definition) # label(non_clause).  [assumption].
0.78/1.20	2 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (all W2 (W2 = sdtasasdt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElementOf0(W3,W0) & aElementOf0(W3,W1))))))) # label(mDefSInt) # label(definition) # label(non_clause).  [assumption].
0.78/1.20	3 (all W0 (aIdeal0(W0) <-> aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> (all W2 (aElementOf0(W2,W0) -> aElementOf0(sdtpldt0(W1,W2),W0))) & (all W2 (aElement0(W2) -> aElementOf0(sdtasdt0(W2,W1),W0))))))) # label(mDefIdeal) # label(definition) # label(non_clause).  [assumption].
0.78/1.20	4 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aIdeal0(W2) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) <-> aElementOf0(sdtpldt0(W0,smndt0(W1)),W2)))) # label(mDefMod) # label(definition) # label(non_clause).  [assumption].
0.78/1.20	5 (all W0 (aElement0(W0) -> W0 = sdtasdt0(W0,sz10) & sdtasdt0(sz10,W0) = W0)) # label(mMulUnit) # label(axiom) # label(non_clause).  [assumption].
0.78/1.20	6 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> aElement0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause).  [assumption].
0.78/1.20	7 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause).  [assumption].
0.78/1.20	8 (all W0 (aElement0(W0) -> sz00 = sdtasdt0(W0,sz00) & sz00 = sdtasdt0(sz00,W0))) # label(mMulZero) # label(axiom) # label(non_clause).  [assumption].
0.78/1.20	9 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> sdtpldt0(W1,W0) = sdtpldt0(W0,W1))) # label(mAddComm) # label(axiom) # label(non_clause).  [assumption].
0.78/1.20	10 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W2) & aElement0(W1) -> sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) = sdtasdt0(sdtpldt0(W1,W2),W0) & sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) = sdtasdt0(W0,sdtpldt0(W1,W2)))) # label(mAMDistr) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	11 (all W0 all W1 all W2 (aElement0(W2) & aElement0(W1) & aElement0(W0) -> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2))) # label(mMulAsso) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	12 (all W0 all W1 (aIdeal0(W1) & aIdeal0(W0) -> aIdeal0(sdtpldt1(W0,W1)))) # label(mIdeSum) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	13 (all W0 (aElement0(W0) -> sdtpldt0(W0,sz00) = W0 & sdtpldt0(sz00,W0) = W0)) # label(mAddZero) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	14 (all W0 (aElement0(W0) -> aElementOf0(W0,sdtpldt1(xI,xJ)) & (exists W1 exists W2 (aElementOf0(W1,xI) & aElementOf0(W2,xJ) & sdtpldt0(W1,W2) = W0)))) # label(m__1205_03) # label(hypothesis) # label(non_clause).  [assumption].
0.83/1.21	15 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	16 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	17 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	18 (all W0 (aElement0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddInvr) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	19 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> aElement0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	20 (all W0 all W1 all W2 (aElement0(W1) & aElement0(W2) & aElement0(W0) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	21 (all W0 all W1 (aElement0(W1) & aElement0(W0) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	22 (all W0 (aElement0(W0) -> sdtasdt0(W0,smndt0(sz10)) = smndt0(W0) & smndt0(W0) = sdtasdt0(smndt0(sz10),W0))) # label(mMulMnOne) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	23 (all W0 (aElementOf0(W0,xI) -> (all W1 (aElement0(W1) -> aElementOf0(sdtasdt0(W1,W0),xI))) & (all W1 (aElementOf0(W1,xI) -> aElementOf0(sdtpldt0(W0,W1),xI))))) # label(m__1205_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.83/1.21	24 (all W0 (aElementOf0(W0,xJ) -> (all W1 (aElement0(W1) -> aElementOf0(sdtasdt0(W1,W0),xJ))) & (all W1 (aElementOf0(W1,xJ) -> aElementOf0(sdtpldt0(W0,W1),xJ))))) # label(m__1205_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.83/1.21	25 (all W0 all W1 (aIdeal0(W1) & aIdeal0(W0) -> aIdeal0(sdtasasdt0(W0,W1)))) # label(mIdeInt) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	26 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> (sdtasdt0(W0,W1) = sz00 -> sz00 = W0 | W1 = sz00))) # label(mCancel) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	27 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> ((all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))) & (all W2 (aElementOf0(W2,W0) -> aElementOf0(W2,W1))) -> W1 = W0))) # label(mSetEq) # label(axiom) # label(non_clause).  [assumption].
0.83/1.21	28 -(exists W0 (aElement0(W0) & (aElementOf0(sdtpldt0(W0,smndt0(xx)),xI) | sdteqdtlpzmzozddtrp0(W0,xx,xI)) & (sdteqdtlpzmzozddtrp0(W0,xy,xJ) | aElementOf0(sdtpldt0(W0,smndt0(xy)),xJ)))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
0.83/1.21	
0.83/1.21	============================== end of process non-clausal formulas ===
0.83/1.21	
0.83/1.21	============================== PROCESS INITIAL CLAUSES ===============
0.83/1.21	
0.83/1.21	============================== PREDICATE ELIMINATION =================
0.83/1.21	
0.83/1.21	============================== end predicate elimination =============
0.83/1.21	
0.83/1.21	Auto_denials:  (non-Horn, no changes).
0.83/1.21	
0.83/1.21	Term ordering decisions:
0.83/1.21	Function symbol KB weights:  sz00=1. xI=1. xJ=1. sz10=1. xa=1. xb=1. xw=1. xx=1. xy=1. sdtpldt0=1. sdtasdt0=1. sdtpldt1=1. sdtasasdt0=1. f12=1. f13=1. smndt0=1. f7=1. f8=1. f9=1. f10=1. f11=1. f3=1. f4=1. f5=1. f6=1. f1=1. f2=1.
0.83/1.21	
0.83/1.21	============================== end of process initial clauses ========
0.83/1.21	
0.83/1.21	============================== CLAUSES FOR SEARCH ====================
0.83/1.21	
0.83/1.21	==================Alarm clock 
119.23/120.03	Prover9 interrupted
119.23/120.03	EOF