0.06/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.11/0.33	% Computer : n016.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit : 960
0.11/0.33	% WCLimit  : 120
0.11/0.33	% DateTime : Tue Aug  9 04:16:12 EDT 2022
0.11/0.33	% CPUTime  : 
0.68/0.95	============================== Prover9 ===============================
0.68/0.95	Prover9 (32) version 2009-11A, November 2009.
0.68/0.95	Process 27735 was started by sandbox on n016.cluster.edu,
0.68/0.95	Tue Aug  9 04:16:12 2022
0.68/0.95	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_27573_n016.cluster.edu".
0.68/0.95	============================== end of head ===========================
0.68/0.95	
0.68/0.95	============================== INPUT =================================
0.68/0.95	
0.68/0.95	% Reading from file /tmp/Prover9_27573_n016.cluster.edu
0.68/0.95	
0.68/0.95	set(prolog_style_variables).
0.68/0.95	set(auto2).
0.68/0.95	    % set(auto2) -> set(auto).
0.68/0.95	    % set(auto) -> set(auto_inference).
0.68/0.95	    % set(auto) -> set(auto_setup).
0.68/0.95	    % set(auto_setup) -> set(predicate_elim).
0.68/0.95	    % set(auto_setup) -> assign(eq_defs, unfold).
0.68/0.95	    % set(auto) -> set(auto_limits).
0.68/0.95	    % set(auto_limits) -> assign(max_weight, "100.000").
0.68/0.95	    % set(auto_limits) -> assign(sos_limit, 20000).
0.68/0.95	    % set(auto) -> set(auto_denials).
0.68/0.95	    % set(auto) -> set(auto_process).
0.68/0.95	    % set(auto2) -> assign(new_constants, 1).
0.68/0.95	    % set(auto2) -> assign(fold_denial_max, 3).
0.68/0.95	    % set(auto2) -> assign(max_weight, "200.000").
0.68/0.95	    % set(auto2) -> assign(max_hours, 1).
0.68/0.95	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.68/0.95	    % set(auto2) -> assign(max_seconds, 0).
0.68/0.95	    % set(auto2) -> assign(max_minutes, 5).
0.68/0.95	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.68/0.95	    % set(auto2) -> set(sort_initial_sos).
0.68/0.95	    % set(auto2) -> assign(sos_limit, -1).
0.68/0.95	    % set(auto2) -> assign(lrs_ticks, 3000).
0.68/0.95	    % set(auto2) -> assign(max_megs, 400).
0.68/0.95	    % set(auto2) -> assign(stats, some).
0.68/0.95	    % set(auto2) -> clear(echo_input).
0.68/0.95	    % set(auto2) -> set(quiet).
0.68/0.95	    % set(auto2) -> clear(print_initial_clauses).
0.68/0.95	    % set(auto2) -> clear(print_given).
0.68/0.95	assign(lrs_ticks,-1).
0.68/0.95	assign(sos_limit,10000).
0.68/0.95	assign(order,kbo).
0.68/0.95	set(lex_order_vars).
0.68/0.95	clear(print_given).
0.68/0.95	
0.68/0.95	% formulas(sos).  % not echoed (20 formulas)
0.68/0.95	
0.68/0.95	============================== end of input ==========================
0.68/0.95	
0.68/0.95	% From the command line: assign(max_seconds, 960).
0.68/0.95	
0.68/0.95	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.68/0.95	
0.68/0.95	% Formulas that are not ordinary clauses:
0.68/0.95	1 (all A all B all C (less_than(A,B) & less_than(B,C) -> less_than(A,C))) # label(less_than_transitive) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	2 (all A all B (less_than(A,B) -> meet(A,B,A) & join(A,B,B))) # label(less_than_meet_join) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	3 (all A all B all C (meet(A,B,C) -> meet(B,A,C))) # label(commutitivity_meet) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	4 (all A less_than(A,A)) # label(less_than_reflexive) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	5 (all A all B all C all D (less_than(B,D) & less_than(A,D) & join(A,B,C) -> less_than(C,D))) # label(least_upper_bound_join) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	6 (all A all B all C (meet(A,B,C) -> less_than(C,B) & less_than(C,A))) # label(lower_bound_meet) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	7 (all A all B all C all D (less_than(D,B) & less_than(D,A) & meet(A,B,C) -> less_than(D,C))) # label(greatest_lower_bound_meet) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	8 (all A all B all C all D all E all F (meet(B,C,F) & meet(D,C,E) & meet(A,B,D) -> meet(A,F,E))) # label(associativity_meet) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	9 (all A all B exists C meet(A,B,C)) # label(do_lattice) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	10 (all A all B all C all D all E all F (join(A,B,D) & join(B,C,F) & join(D,C,E) -> join(A,F,E))) # label(associativity_join) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	11 (all A all B all C (join(A,B,C) -> less_than(B,C) & less_than(A,C))) # label(upper_bound_join) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	12 (all A all B all C all D all E all F all G all H (join(B,C,H) & meet(A,B,E) & meet(A,C,F) & join(E,F,G) & meet(A,H,D) -> less_than(D,G))) # label(lo_le_distr) # label(axiom) # label(non_clause).  [assumption].
0.68/0.95	13 (all A all B all C (join(A,B,C) -> join(B,A,C))) # label(commutitivity_join) # label(axiom) # labelAlarm clock 
119.79/120.06	Prover9 interrupted
119.79/120.07	EOF