0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n010.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 14:03:36 EDT 2019
0.12/0.35	% CPUTime    : 
0.43/1.02	============================== Prover9 ===============================
0.43/1.02	Prover9 (32) version 2009-11A, November 2009.
0.43/1.02	Process 4339 was started by sandbox on n010.cluster.edu,
0.43/1.02	Thu Aug 29 14:03:37 2019
0.43/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_4186_n010.cluster.edu".
0.43/1.02	============================== end of head ===========================
0.43/1.02	
0.43/1.02	============================== INPUT =================================
0.43/1.02	
0.43/1.02	% Reading from file /tmp/Prover9_4186_n010.cluster.edu
0.43/1.02	
0.43/1.02	set(prolog_style_variables).
0.43/1.02	set(auto2).
0.43/1.02	    % set(auto2) -> set(auto).
0.43/1.02	    % set(auto) -> set(auto_inference).
0.43/1.02	    % set(auto) -> set(auto_setup).
0.43/1.02	    % set(auto_setup) -> set(predicate_elim).
0.43/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.02	    % set(auto) -> set(auto_limits).
0.43/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.02	    % set(auto) -> set(auto_denials).
0.43/1.02	    % set(auto) -> set(auto_process).
0.43/1.02	    % set(auto2) -> assign(new_constants, 1).
0.43/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.02	    % set(auto2) -> assign(max_hours, 1).
0.43/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.02	    % set(auto2) -> set(sort_initial_sos).
0.43/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.02	    % set(auto2) -> assign(max_megs, 400).
0.43/1.02	    % set(auto2) -> assign(stats, some).
0.43/1.02	    % set(auto2) -> clear(echo_input).
0.43/1.02	    % set(auto2) -> set(quiet).
0.43/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.02	    % set(auto2) -> clear(print_given).
0.43/1.02	assign(lrs_ticks,-1).
0.43/1.02	assign(sos_limit,10000).
0.43/1.02	assign(order,kbo).
0.43/1.02	set(lex_order_vars).
0.43/1.02	clear(print_given).
0.43/1.02	
0.43/1.02	% formulas(sos).  % not echoed (12 formulas)
0.43/1.02	
0.43/1.02	============================== end of input ==========================
0.43/1.02	
0.43/1.02	% From the command line: assign(max_seconds, 180).
0.43/1.02	
0.43/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.02	
0.43/1.02	% Formulas that are not ordinary clauses:
0.43/1.02	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y4 = Y5)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	2 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	3 (all X6 ((exists Y1 exists Y11 (X6 = Y11 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	5 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | X12 = Y21 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	6 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | -r3(X13,X14,X15) & X15 != Y22)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	7 (all X3 all X10 (X3 = X10 | (all Y12 ((all Y13 (Y13 != Y12 | -r2(X3,Y13))) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	9 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	10 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.02	12 -(exists Y1 ((exists Y6 ((exists Y9 (r4(Y9,Y6,Y1) & (exists Y12 (r2(Y12,Y9) & (exists Y15 (r2(Y15,Y12) & r1(Y15))))))) & (exists Y8 ((exists Cputime limit exceeded (core dumped)
180.01/180.28	EOF