0.05/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.08/0.29	% Computer   : n025.cluster.edu
0.08/0.29	% Model      : x86_64 x86_64
0.08/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.29	% Memory     : 8042.1875MB
0.08/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.29	% CPULimit   : 1200
0.08/0.29	% DateTime   : Tue Jul 13 12:05:57 EDT 2021
0.08/0.29	% CPUTime    : 
0.69/0.99	============================== Prover9 ===============================
0.69/0.99	Prover9 (32) version 2009-11A, November 2009.
0.69/0.99	Process 10836 was started by sandbox2 on n025.cluster.edu,
0.69/0.99	Tue Jul 13 12:05:57 2021
0.69/0.99	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_10683_n025.cluster.edu".
0.69/0.99	============================== end of head ===========================
0.69/0.99	
0.69/0.99	============================== INPUT =================================
0.69/0.99	
0.69/0.99	% Reading from file /tmp/Prover9_10683_n025.cluster.edu
0.69/0.99	
0.69/0.99	set(prolog_style_variables).
0.69/0.99	set(auto2).
0.69/0.99	    % set(auto2) -> set(auto).
0.69/0.99	    % set(auto) -> set(auto_inference).
0.69/0.99	    % set(auto) -> set(auto_setup).
0.69/0.99	    % set(auto_setup) -> set(predicate_elim).
0.69/0.99	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/0.99	    % set(auto) -> set(auto_limits).
0.69/0.99	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/0.99	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/0.99	    % set(auto) -> set(auto_denials).
0.69/0.99	    % set(auto) -> set(auto_process).
0.69/0.99	    % set(auto2) -> assign(new_constants, 1).
0.69/0.99	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/0.99	    % set(auto2) -> assign(max_weight, "200.000").
0.69/0.99	    % set(auto2) -> assign(max_hours, 1).
0.69/0.99	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/0.99	    % set(auto2) -> assign(max_seconds, 0).
0.69/0.99	    % set(auto2) -> assign(max_minutes, 5).
0.69/0.99	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/0.99	    % set(auto2) -> set(sort_initial_sos).
0.69/0.99	    % set(auto2) -> assign(sos_limit, -1).
0.69/0.99	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/0.99	    % set(auto2) -> assign(max_megs, 400).
0.69/0.99	    % set(auto2) -> assign(stats, some).
0.69/0.99	    % set(auto2) -> clear(echo_input).
0.69/0.99	    % set(auto2) -> set(quiet).
0.69/0.99	    % set(auto2) -> clear(print_initial_clauses).
0.69/0.99	    % set(auto2) -> clear(print_given).
0.69/0.99	assign(lrs_ticks,-1).
0.69/0.99	assign(sos_limit,10000).
0.69/0.99	assign(order,kbo).
0.69/0.99	set(lex_order_vars).
0.69/0.99	clear(print_given).
0.69/0.99	
0.69/0.99	% formulas(sos).  % not echoed (9 formulas)
0.69/0.99	
0.69/0.99	============================== end of input ==========================
0.69/0.99	
0.69/0.99	% From the command line: assign(max_seconds, 1200).
0.69/0.99	
0.69/0.99	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/0.99	
0.69/0.99	% Formulas that are not ordinary clauses:
0.69/0.99	1 (all X_2 all X_1 (-g_true(X_2,X_1) & g_false(X_2,X_1) <-> g_false_only(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	2 (all X_2 all X_1 (-g_false(X_2,X_1) & g_true(X_2,X_1) <-> g_true_only(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	3 (all X_2 all X_1 (h_true(X_2,X_1) & -h_false(X_2,X_1) <-> h_true_only(X_2,X_1))) # label(true_only_h) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	4 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_false_only(X_2,X_1) | g_both(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	5 (all X_2 all X_1 (h_false_only(X_2,X_1) | h_both(X_2,X_1) | h_true_only(X_2,X_1))) # label(exhaustion_h) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	6 (all X_2 all X_1 (h_both(X_2,X_1) <-> h_false(X_2,X_1) & h_true(X_2,X_1))) # label(both_h) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	7 (all X_2 all X_1 (h_false(X_2,X_1) & -h_true(X_2,X_1) <-> h_false_only(X_2,X_1))) # label(false_only_h) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	8 (all X_2 all X_1 (g_both(X_2,X_1) <-> g_true(X_2,X_1) & g_false(X_2,X_1))) # label(both_g) # label(axiom) # label(non_clause).  [assumption].
0.69/0.99	9 -((exists A exists B all C (g_both(A,B) & h_false_only(A,C) | (h_false_only(A,C) | h_both(A,C)) & g_true_only(A,B))) & (exists A ((exists B g_both(A,B)) & -(exists B g_true_only(A,B)) & (all B h_false_only(A,B)) | ((all B h_false_only(A,B)) | -(exists B h_true_only(A,B)) & (exists B h_both(A,B))) & (exists B g_true_only(A,B)))) | -(exists A ((exists B g_true_only(A,B)) & ((all B h_false_only(A,B)) | -(exists B h_true_only(A,B)) & (exists B h_both(A,B))) | (exists B g_both(A,B)) & (all B h_false_only(A,B)) & -(exists B g_true_only(A,B)))) & -(exists A exists B all C (h_false_only(A,C) & g_both(A,B) | g_true_only(A,B) & (h_both(A,C) | h_false_only(A,C)))) & (exists A ((exists B (-(exists C (h_true_only(A,C) | g_false_onlyAlarm clock 
119.47/120.14	Prover9 interrupted
119.47/120.14	EOF