0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n009.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 16:18:42 EDT 2019
0.12/0.33	% CPUTime    : 
4.30/4.47	============================== Prover9 ===============================
4.30/4.47	Prover9 (32) version 2009-11A, November 2009.
4.30/4.47	Process 2915 was started by sandbox on n009.cluster.edu,
4.30/4.47	Thu Aug 29 16:18:45 2019
4.30/4.47	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_2762_n009.cluster.edu".
4.30/4.47	============================== end of head ===========================
4.30/4.47	
4.30/4.47	============================== INPUT =================================
4.30/4.47	
4.30/4.47	% Reading from file /tmp/Prover9_2762_n009.cluster.edu
4.30/4.47	
4.30/4.47	set(prolog_style_variables).
4.30/4.47	set(auto2).
4.30/4.47	    % set(auto2) -> set(auto).
4.30/4.47	    % set(auto) -> set(auto_inference).
4.30/4.47	    % set(auto) -> set(auto_setup).
4.30/4.47	    % set(auto_setup) -> set(predicate_elim).
4.30/4.47	    % set(auto_setup) -> assign(eq_defs, unfold).
4.30/4.47	    % set(auto) -> set(auto_limits).
4.30/4.47	    % set(auto_limits) -> assign(max_weight, "100.000").
4.30/4.47	    % set(auto_limits) -> assign(sos_limit, 20000).
4.30/4.47	    % set(auto) -> set(auto_denials).
4.30/4.47	    % set(auto) -> set(auto_process).
4.30/4.47	    % set(auto2) -> assign(new_constants, 1).
4.30/4.47	    % set(auto2) -> assign(fold_denial_max, 3).
4.30/4.47	    % set(auto2) -> assign(max_weight, "200.000").
4.30/4.47	    % set(auto2) -> assign(max_hours, 1).
4.30/4.47	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
4.30/4.47	    % set(auto2) -> assign(max_seconds, 0).
4.30/4.47	    % set(auto2) -> assign(max_minutes, 5).
4.30/4.47	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
4.30/4.47	    % set(auto2) -> set(sort_initial_sos).
4.30/4.47	    % set(auto2) -> assign(sos_limit, -1).
4.30/4.47	    % set(auto2) -> assign(lrs_ticks, 3000).
4.30/4.47	    % set(auto2) -> assign(max_megs, 400).
4.30/4.47	    % set(auto2) -> assign(stats, some).
4.30/4.47	    % set(auto2) -> clear(echo_input).
4.30/4.47	    % set(auto2) -> set(quiet).
4.30/4.47	    % set(auto2) -> clear(print_initial_clauses).
4.30/4.47	    % set(auto2) -> clear(print_given).
4.30/4.47	assign(lrs_ticks,-1).
4.30/4.47	assign(sos_limit,10000).
4.30/4.47	assign(order,kbo).
4.30/4.47	set(lex_order_vars).
4.30/4.47	clear(print_given).
4.30/4.47	
4.30/4.47	% formulas(sos).  % not echoed (7447 formulas)
4.30/4.47	
4.30/4.47	============================== end of input ==========================
4.30/4.47	
4.30/4.47	% From the command line: assign(max_seconds, 180).
4.30/4.47	
4.30/4.47	============================== PROCESS NON-CLAUSAL FORMULAS ==========
4.30/4.47	
4.30/4.47	% Formulas that are not ordinary clauses:
4.30/4.47	1 (all X p__d__subclass(X,X)) # label(predefinitionsA7) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	2 (all X all Y all Z (p__d__subclass(X,Y) & p__d__subclass(Y,Z) -> p__d__subclass(X,Z))) # label(predefinitionsA8) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	3 (all X all Y (p__d__subclass(X,Y) & p__d__subclass(Y,X) -> X = Y)) # label(predefinitionsA9) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	4 (all X all Y all Z (p__d__instance(X,Y) & p__d__subclass(Y,Z) -> p__d__instance(X,Z))) # label(predefinitionsA12) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	5 (all CLASS1 all CLASS2 (p__d__disjoint(CLASS1,CLASS2) <-> (all INST (-p__d__instance(INST,CLASS1) | -p__d__instance(INST,CLASS2))))) # label(predefinitionsA15) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	6 (all CLASS all ROW1 all ROW2 (p__d__partition3(CLASS,ROW1,ROW2) <-> p__d__exhaustiveDecomposition3(CLASS,ROW1,ROW2) & p__d__disjointDecomposition3(CLASS,ROW1,ROW2))) # label(predefinitionsA18_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	7 (all CLASS all ROW1 all ROW2 all ROW3 (p__d__partition4(CLASS,ROW1,ROW2,ROW3) <-> p__d__exhaustiveDecomposition4(CLASS,ROW1,ROW2,ROW3) & p__d__disjointDecomposition4(CLASS,ROW1,ROW2,ROW3))) # label(predefinitionsA18_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	8 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 (p__d__partition5(CLASS,ROW1,ROW2,ROW3,ROW4) <-> p__d__exhaustiveDecomposition5(CLASS,ROW1,ROW2,ROW3,ROW4) & p__d__disjointDecomposition5(CLASS,ROW1,ROW2,ROW3,ROW4))) # label(predefinitionsA18_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	9 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 (p__d__partition6(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5) <-> p__d__exhaustiveDecomposition6(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5) & p__d__disjointDecomposition6(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5))) # label(predefinitionsA18_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	10 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 all ROW6 (p__d__partition7(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5,ROW6) <-> p__d__exhaustiveDecomposition7(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5,ROW6) & p__d__disjointDecomposition7(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5,ROW6))) # label(predefinitionsA18_AndRHS_AndRHS_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	11 (all CLASS all ROW1 all ROW2 (p__d__exhaustiveDecomposition3(CLASS,ROW1,ROW2) <-> (all X (p__d__instance(X,CLASS) -> p__d__instance(X,ROW1) | p__d__instance(X,ROW2))))) # label(predefinitionsA21_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	12 (all CLASS all ROW1 all ROW2 all ROW3 (p__d__exhaustiveDecomposition4(CLASS,ROW1,ROW2,ROW3) <-> (all X (p__d__instance(X,CLASS) -> p__d__instance(X,ROW1) | p__d__instance(X,ROW2) | p__d__instance(X,ROW3))))) # label(predefinitionsA21_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	13 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 (p__d__exhaustiveDecomposition5(CLASS,ROW1,ROW2,ROW3,ROW4) <-> (all X (p__d__instance(X,CLASS) -> p__d__instance(X,ROW1) | p__d__instance(X,ROW2) | p__d__instance(X,ROW3) | p__d__instance(X,ROW4))))) # label(predefinitionsA21_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	14 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 (p__d__exhaustiveDecomposition6(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5) <-> (all X (p__d__instance(X,CLASS) -> p__d__instance(X,ROW1) | p__d__instance(X,ROW2) | p__d__instance(X,ROW3) | p__d__instance(X,ROW4) | p__d__instance(X,ROW5))))) # label(predefinitionsA21_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	15 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 all ROW6 (p__d__exhaustiveDecomposition7(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5,ROW6) <-> (all X (p__d__instance(X,CLASS) -> p__d__instance(X,ROW1) | p__d__instance(X,ROW2) | p__d__instance(X,ROW3) | p__d__instance(X,ROW4) | p__d__instance(X,ROW5) | p__d__instance(X,ROW6))))) # label(predefinitionsA21_AndRHS_AndRHS_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	16 (all CLASS all ROW1 all ROW2 (p__d__disjointDecomposition3(CLASS,ROW1,ROW2) <-> p__d__disjoint(ROW1,ROW2))) # label(predefinitionsA24_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	17 (all CLASS all ROW1 all ROW2 all ROW3 (p__d__disjointDecomposition4(CLASS,ROW1,ROW2,ROW3) <-> p__d__disjoint(ROW1,ROW2) & p__d__disjoint(ROW1,ROW3) & p__d__disjoint(ROW2,ROW3))) # label(predefinitionsA24_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	18 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 (p__d__disjointDecomposition5(CLASS,ROW1,ROW2,ROW3,ROW4) <-> p__d__disjoint(ROW1,ROW2) & p__d__disjoint(ROW1,ROW3) & p__d__disjoint(ROW1,ROW4) & p__d__disjoint(ROW2,ROW3) & p__d__disjoint(ROW2,ROW4) & p__d__disjoint(ROW3,ROW4))) # label(predefinitionsA24_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	19 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 (p__d__disjointDecomposition6(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5) <-> p__d__disjoint(ROW1,ROW2) & p__d__disjoint(ROW1,ROW3) & p__d__disjoint(ROW1,ROW4) & p__d__disjoint(ROW1,ROW5) & p__d__disjoint(ROW2,ROW3) & p__d__disjoint(ROW2,ROW4) & p__d__disjoint(ROW2,ROW5) & p__d__disjoint(ROW3,ROW4) & p__d__disjoint(ROW3,ROW5) & p__d__disjoint(ROW4,ROW5))) # label(predefinitionsA24_AndRHS_AndRHS_AndRHS_AndLHS) # label(axiom) # label(non_clause).  [assumption].
4.30/4.47	20 (all CLASS all ROW1 all ROW2 all ROW3 all ROW4 all ROW5 all ROW6 (p__d__disjointDecomposition7(CLASS,ROW1,ROW2,ROW3,ROW4,ROW5,ROW6) <-> p__d__disjoint(ROW1,ROW2) & p__d__disjoint(ROW1,ROW3) & p__d__disjoint(ROW1,ROW4) & p__d__disjoint(ROW1,ROW5) & p__d__disjoint(ROW1,ROW6) & p__d__disjoint(ROW2,ROW3) & p__d__disjoint(ROW2,ROW4) & p__d__disjoint(ROW2,ROW5) & p__d__disjoint(ROW2,ROW6) & p__d__disjoint(ROW3,ROW4) & p__d__disjoint(ROW3,ROW5) & p__d__disjoint(ROW3,ROW6) & p__d__disjoint(ROW4,ROW5) & p__d__disjoint(ROW4,ROW6) & p__d__disjoint(ROW5,ROW6))) # label(predefinitionsA24_AndRHS_AndRHS_AndRHS_AndRHS) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	21 (all CLASS all ENTITY (p__d__instance(CLASS,c__SetOrClass) & p__immediateInstance(ENTITY,CLASS) -> (all SUBCLASS (-p__d__instance(SUBCLASS,c__SetOrClass) | -p__subclass(SUBCLASS,CLASS) | SUBCLASS = CLASS | -p__instance(ENTITY,SUBCLASS))))) # label(mergeA7) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	22 (all REL1 all REL2 all INST1 all INST2 (p__d__instance(REL2,c__BinaryRelation) & p__d__instance(REL1,c__BinaryRelation) & p__inverse(REL1,REL2) -> (p__d__holds3(REL1,INST1,INST2) <-> p__d__holds3(REL2,INST2,INST1)))) # label(mergeA14) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	23 (all X all Z all Y (p__d__instance(Y,c__SetOrClass) & p__d__instance(X,c__SetOrClass) & p__subclass(X,Y) & p__instance(Z,X) -> p__instance(Z,Y))) # label(mergeA20) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	24 (all CLASS2 all CLASS1 (p__d__instance(CLASS2,c__SetOrClass) & p__d__instance(CLASS1,c__SetOrClass) & p__immediateSubclass(CLASS1,CLASS2) -> (all CLASS3 (-p__d__instance(CLASS3,c__SetOrClass) | -p__subclass(CLASS3,CLASS2) | -p__subclass(CLASS1,CLASS3) | CLASS2 = CLASS3 | CLASS1 = CLASS3)))) # label(mergeA24) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	25 (all PRED1 all PRED2 all NUMBER (p__d__instance(PRED2,c__Relation) & p__d__instance(PRED1,c__Relation) & p__d__instance(NUMBER,c__PositiveInteger) & p__subrelation(PRED1,PRED2) & p__valence(PRED1,NUMBER) -> p__valence(PRED2,NUMBER))) # label(mergeA29) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	26 (all REL1 all REL2 (p__subrelation(REL1,REL2) & p__d__instance(REL2,c__BinaryRelation) -> p__d__instance(REL1,c__BinaryRelation) & (all INST1 all INST2 (p__d__holds3(REL1,INST1,INST2) -> p__d__holds3(REL2,INST1,INST2))))) # label(mergeA30) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	27 (all REL1 all REL2 (p__subrelation(REL1,REL2) & p__d__instance(REL2,c__TernaryRelation) -> p__d__instance(REL1,c__TernaryRelation) & (all INST1 all INST2 all INST3 (p__d__holds4(REL1,INST1,INST2,INST3) -> p__d__holds4(REL2,INST1,INST2,INST3))))) # label(mergeA31) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	28 (all REL1 all REL2 (p__subrelation(REL1,REL2) & p__d__instance(REL2,c__QuaternaryRelation) -> p__d__instance(REL1,c__QuaternaryRelation) & (all INST1 all INST2 all INST3 all INST4 (p__d__holds5(REL1,INST1,INST2,INST3,INST4) -> p__d__holds5(REL2,INST1,INST2,INST3,INST4))))) # label(mergeA32) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	29 (all REL1 all REL2 (p__subrelation(REL1,REL2) & p__d__instance(REL2,c__QuintaryRelation) -> p__d__instance(REL1,c__QuintaryRelation) & (all INST1 all INST2 all INST3 all INST4 all INST5 (p__d__holds6(REL1,INST1,INST2,INST3,INST4,INST5) -> p__d__holds6(REL2,INST1,INST2,INST3,INST4,INST5))))) # label(mergeA33) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	30 (all CLASS all PRED1 all PRED2 (p__subrelation(PRED1,PRED2) & p__d__instance(PRED2,CLASS) & p__d__instance(CLASS,c__InheritableRelation) -> p__d__instance(PRED1,CLASS))) # label(mergeA34) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	31 (all CLASS1 all CLASS2 (p__d__instance(CLASS2,c__SetOrClass) & p__d__instance(CLASS1,c__SetOrClass) -> (p__disjoint(CLASS1,CLASS2) <-> (all INST (-p__instance(INST,CLASS1) | -p__instance(INST,CLASS2)))))) # label(mergeA77) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	32 (all INST1 all INST2 all REL1 all REL2 (p__d__instance(REL1,c__BinaryRelation) & p__d__instance(REL2,c__BinaryRelation) & p__disjointRelation(REL1,REL2) -> -p__d__holds3(REL1,INST1,INST2) | -p__d__holds3(REL2,INST1,INST2))) # label(mergeA83) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	33 (all INST1 all INST2 all INST3 all REL1 all REL2 (p__d__instance(REL1,c__TernaryRelation) & p__d__instance(REL2,c__TernaryRelation) & p__disjointRelation(REL1,REL2) -> -p__d__holds4(REL1,INST1,INST2,INST3) | -p__d__holds4(REL2,INST1,INST2,INST3))) # label(mergeA84) # label(axiom) # label(non_clause).  [assumption].
4.39/4.47	34 (all INST1 all INST2 all INST3 all INST4 all REL1 all REL2 (p__d__instance(RELCputime limit exceeded (core dumped)
180.08/180.16	EOF