0.03/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.15/0.36	% Computer   : n025.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 180
0.15/0.36	% DateTime   : Thu Aug 29 12:25:00 EDT 2019
0.15/0.36	% CPUTime    : 
0.49/1.07	============================== Prover9 ===============================
0.49/1.07	Prover9 (32) version 2009-11A, November 2009.
0.49/1.07	Process 27708 was started by sandbox on n025.cluster.edu,
0.49/1.07	Thu Aug 29 12:25:01 2019
0.49/1.07	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_27554_n025.cluster.edu".
0.49/1.07	============================== end of head ===========================
0.49/1.07	
0.49/1.07	============================== INPUT =================================
0.49/1.07	
0.49/1.07	% Reading from file /tmp/Prover9_27554_n025.cluster.edu
0.49/1.07	
0.49/1.07	set(prolog_style_variables).
0.49/1.07	set(auto2).
0.49/1.07	    % set(auto2) -> set(auto).
0.49/1.07	    % set(auto) -> set(auto_inference).
0.49/1.07	    % set(auto) -> set(auto_setup).
0.49/1.07	    % set(auto_setup) -> set(predicate_elim).
0.49/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.49/1.07	    % set(auto) -> set(auto_limits).
0.49/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.49/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.49/1.07	    % set(auto) -> set(auto_denials).
0.49/1.07	    % set(auto) -> set(auto_process).
0.49/1.07	    % set(auto2) -> assign(new_constants, 1).
0.49/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.49/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.49/1.07	    % set(auto2) -> assign(max_hours, 1).
0.49/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.49/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.49/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.49/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.49/1.07	    % set(auto2) -> set(sort_initial_sos).
0.49/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.49/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.49/1.07	    % set(auto2) -> assign(max_megs, 400).
0.49/1.07	    % set(auto2) -> assign(stats, some).
0.49/1.07	    % set(auto2) -> clear(echo_input).
0.49/1.07	    % set(auto2) -> set(quiet).
0.49/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.49/1.07	    % set(auto2) -> clear(print_given).
0.49/1.07	assign(lrs_ticks,-1).
0.49/1.07	assign(sos_limit,10000).
0.49/1.07	assign(order,kbo).
0.49/1.07	set(lex_order_vars).
0.49/1.07	clear(print_given).
0.49/1.07	
0.49/1.07	% formulas(sos).  % not echoed (20 formulas)
0.49/1.07	
0.49/1.07	============================== end of input ==========================
0.49/1.07	
0.49/1.07	% From the command line: assign(max_seconds, 180).
0.49/1.07	
0.49/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.49/1.07	
0.49/1.07	% Formulas that are not ordinary clauses:
0.49/1.07	1 less_than(v,p) -> goal # label(goal_ax) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	2 (all A all B exists C meet(A,B,C)) # label(do_lattice) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	3 (all A all B all C (join(A,B,C) -> less_than(A,C) & less_than(B,C))) # label(upper_bound_join) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	4 (all A all B all C all D (join(A,B,C) & less_than(B,D) & less_than(A,D) -> less_than(C,D))) # label(least_upper_bound_join) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	5 (all A all B (less_than(A,B) -> join(A,B,B) & meet(A,B,A))) # label(less_than_meet_join) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	6 (all A all B all C (meet(A,B,C) -> meet(B,A,C))) # label(commutitivity_meet) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	7 (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.49/1.07	8 (all A less_than(A,A)) # label(less_than_reflexive) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	9 (all A all B all C (less_than(B,C) & less_than(A,B) -> less_than(A,C))) # label(less_than_transitive) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	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.49/1.07	11 (all A all B all C (join(A,B,C) -> join(B,A,C))) # label(commutitivity_join) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	12 (all A all B all C all D (less_than(D,A) & less_than(D,B) & meet(A,B,C) -> less_than(D,C))) # label(greatest_lower_bound_meet) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	13 (all A all B all C all D all E all F all G all H (join(B,C,H) & meet(A,H,D) & meet(A,B,E) & join(E,F,G) & meet(A,C,F) -> less_than(D,G))) # label(lo_le_distr) # label(axiom) # label(non_clause).  [assumption].
0.49/1.07	14 (all A all B all C all D all E all F (meet(A,B,D) &Cputime limit exceeded (core dumped)
180.03/180.30	EOF