0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.14/0.34	% Computer : n003.cluster.edu
0.14/0.34	% Model    : x86_64 x86_64
0.14/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory   : 8042.1875MB
0.14/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit : 960
0.14/0.34	% WCLimit  : 120
0.14/0.34	% DateTime : Tue Aug  9 01:58:36 EDT 2022
0.14/0.34	% CPUTime  : 
0.47/1.14	============================== Prover9 ===============================
0.47/1.14	Prover9 (32) version 2009-11A, November 2009.
0.47/1.14	Process 8428 was started by sandbox2 on n003.cluster.edu,
0.47/1.14	Tue Aug  9 01:58:36 2022
0.47/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_8217_n003.cluster.edu".
0.47/1.14	============================== end of head ===========================
0.47/1.14	
0.47/1.14	============================== INPUT =================================
0.47/1.14	
0.47/1.14	% Reading from file /tmp/Prover9_8217_n003.cluster.edu
0.47/1.14	
0.47/1.14	set(prolog_style_variables).
0.47/1.14	set(auto2).
0.47/1.14	    % set(auto2) -> set(auto).
0.47/1.14	    % set(auto) -> set(auto_inference).
0.47/1.14	    % set(auto) -> set(auto_setup).
0.47/1.14	    % set(auto_setup) -> set(predicate_elim).
0.47/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.14	    % set(auto) -> set(auto_limits).
0.47/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.14	    % set(auto) -> set(auto_denials).
0.47/1.14	    % set(auto) -> set(auto_process).
0.47/1.14	    % set(auto2) -> assign(new_constants, 1).
0.47/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.14	    % set(auto2) -> assign(max_hours, 1).
0.47/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.14	    % set(auto2) -> set(sort_initial_sos).
0.47/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.14	    % set(auto2) -> assign(max_megs, 400).
0.47/1.14	    % set(auto2) -> assign(stats, some).
0.47/1.14	    % set(auto2) -> clear(echo_input).
0.47/1.14	    % set(auto2) -> set(quiet).
0.47/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.14	    % set(auto2) -> clear(print_given).
0.47/1.14	assign(lrs_ticks,-1).
0.47/1.14	assign(sos_limit,10000).
0.47/1.14	assign(order,kbo).
0.47/1.14	set(lex_order_vars).
0.47/1.14	clear(print_given).
0.47/1.14	
0.47/1.14	% formulas(sos).  % not echoed (9 formulas)
0.47/1.14	
0.47/1.14	============================== end of input ==========================
0.47/1.14	
0.47/1.14	% From the command line: assign(max_seconds, 960).
0.47/1.14	
0.47/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.14	
0.47/1.14	% Formulas that are not ordinary clauses:
0.47/1.14	1 (all X_2 all X_1 (-h_false(X_2,X_1) & h_true(X_2,X_1) <-> h_true_only(X_2,X_1))) # label(true_only_h) # label(axiom) # label(non_clause).  [assumption].
0.47/1.14	2 (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.47/1.14	3 (all X_2 all X_1 (h_true_only(X_2,X_1) | h_false_only(X_2,X_1) | h_both(X_2,X_1))) # label(exhaustion_h) # label(axiom) # label(non_clause).  [assumption].
0.47/1.14	4 (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.47/1.14	5 (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.47/1.14	6 (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.47/1.14	7 (all X_2 all X_1 (h_both(X_2,X_1) <-> h_true(X_2,X_1) & h_false(X_2,X_1))) # label(both_h) # label(axiom) # label(non_clause).  [assumption].
0.47/1.14	8 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> g_false(X_2,X_1) & -g_true(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause).  [assumption].
0.47/1.14	9 -((all A all B exists C (h_true_only(A,C) | g_false_only(A,B))) & (all A ((all B g_false_only(A,B)) | (exists B h_true_only(A,B)))) | (exists A ((exists B g_both(A,B)) & (all B h_false_only(A,B)) & -(exists B g_true_only(A,B)) | (exists B g_true_only(A,B)) & (-(exists B h_true_only(A,B)) & (exists B h_both(A,B)) | (all B h_false_only(A,B))))) & (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 all C ((h_both(A,C) | h_false_only(A,C)) & g_true_only(A,B) | g_both(A,B) & h_false_only(A,C))) & (exists B ((exists C (g_both(A,B) & h_both(A,C))) & -(exists C (g_false_only(A,B) | h_true_only(A,C))))))) & -(exists A exists B all C (h_false_only(AAlarm clock 
119.73/120.08	Prover9 interrupted
119.73/120.08	EOF