0.04/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.08	% Command    : tptp2X_and_run_prover9 %d %s
0.08/0.27	% Computer   : n003.cluster.edu
0.08/0.27	% Model      : x86_64 x86_64
0.08/0.27	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.27	% Memory     : 8042.1875MB
0.08/0.27	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.27	% CPULimit   : 960
0.08/0.27	% DateTime   : Thu Jul  2 14:31:12 EDT 2020
0.08/0.27	% CPUTime    : 
0.56/0.87	============================== Prover9 ===============================
0.56/0.87	Prover9 (32) version 2009-11A, November 2009.
0.56/0.87	Process 12529 was started by sandbox2 on n003.cluster.edu,
0.56/0.87	Thu Jul  2 14:31:12 2020
0.56/0.87	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_12373_n003.cluster.edu".
0.56/0.87	============================== end of head ===========================
0.56/0.87	
0.56/0.87	============================== INPUT =================================
0.56/0.87	
0.56/0.87	% Reading from file /tmp/Prover9_12373_n003.cluster.edu
0.56/0.87	
0.56/0.87	set(prolog_style_variables).
0.56/0.87	set(auto2).
0.56/0.87	    % set(auto2) -> set(auto).
0.56/0.87	    % set(auto) -> set(auto_inference).
0.56/0.87	    % set(auto) -> set(auto_setup).
0.56/0.87	    % set(auto_setup) -> set(predicate_elim).
0.56/0.87	    % set(auto_setup) -> assign(eq_defs, unfold).
0.56/0.87	    % set(auto) -> set(auto_limits).
0.56/0.87	    % set(auto_limits) -> assign(max_weight, "100.000").
0.56/0.87	    % set(auto_limits) -> assign(sos_limit, 20000).
0.56/0.87	    % set(auto) -> set(auto_denials).
0.56/0.87	    % set(auto) -> set(auto_process).
0.56/0.87	    % set(auto2) -> assign(new_constants, 1).
0.56/0.87	    % set(auto2) -> assign(fold_denial_max, 3).
0.56/0.87	    % set(auto2) -> assign(max_weight, "200.000").
0.56/0.87	    % set(auto2) -> assign(max_hours, 1).
0.56/0.87	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.56/0.87	    % set(auto2) -> assign(max_seconds, 0).
0.56/0.87	    % set(auto2) -> assign(max_minutes, 5).
0.56/0.87	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.56/0.87	    % set(auto2) -> set(sort_initial_sos).
0.56/0.87	    % set(auto2) -> assign(sos_limit, -1).
0.56/0.87	    % set(auto2) -> assign(lrs_ticks, 3000).
0.56/0.87	    % set(auto2) -> assign(max_megs, 400).
0.56/0.87	    % set(auto2) -> assign(stats, some).
0.56/0.87	    % set(auto2) -> clear(echo_input).
0.56/0.87	    % set(auto2) -> set(quiet).
0.56/0.87	    % set(auto2) -> clear(print_initial_clauses).
0.56/0.87	    % set(auto2) -> clear(print_given).
0.56/0.87	assign(lrs_ticks,-1).
0.56/0.87	assign(sos_limit,10000).
0.56/0.87	assign(order,kbo).
0.56/0.87	set(lex_order_vars).
0.56/0.87	clear(print_given).
0.56/0.87	
0.56/0.87	% formulas(sos).  % not echoed (27 formulas)
0.56/0.87	
0.56/0.87	============================== end of input ==========================
0.56/0.87	
0.56/0.87	% From the command line: assign(max_seconds, 960).
0.56/0.87	
0.56/0.87	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.56/0.87	
0.56/0.87	% Formulas that are not ordinary clauses:
0.56/0.87	1 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(left_distributivity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	2 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	3 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	4 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	5 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(right_distributivity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	6 (all A A = addition(A,A)) # label(additive_idempotence) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	7 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	8 (all A all B (leq(A,B) <-> B = addition(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	9 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	10 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	11 (all A zero = multiplication(zero,A)) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	12 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	13 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	14 (all X0 addition(antidomain(antidomain(X0)),antidomain(X0)) = one) # label(domain3) # label(axiom) # label(non_clause).  [assumption].
0.56/0.87	15 (all X0 all X1 coantidomain(multiplication(coantidomain(coantidomain(X0)),X1)) = addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1)))) # label(codomain2) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	16 (all X0 zero = multiplication(X0,coantidomain(X0))) # label(codomain1) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	17 (all X0 zero = multiplication(antidomain(X0),X0)) # label(domain1) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	18 (all X0 all X1 antidomain(multiplication(X0,antidomain(antidomain(X1)))) = addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1)))))) # label(domain2) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	19 (all X0 addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one) # label(codomain3) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	20 (all X0 antidomain(antidomain(X0)) = domain(X0)) # label(domain4) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	21 (all X0 all X1 domain(multiplication(X0,domain(X1))) = forward_diamond(X0,X1)) # label(forward_diamond) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	22 (all X0 all X1 multiplication(domain(X0),antidomain(X1)) = domain_difference(X0,X1)) # label(domain_difference) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	23 (all X0 all X1 c(backward_diamond(X0,c(X1))) = backward_box(X0,X1)) # label(backward_box) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	24 (all X0 all X1 forward_box(X0,X1) = c(forward_diamond(X0,c(X1)))) # label(forward_box) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	25 (all X0 c(X0) = antidomain(domain(X0))) # label(complement) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	26 (all X0 all X1 backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0))) # label(backward_diamond) # label(axiom) # label(non_clause).  [assumption].
3.08/3.40	27 -(all X0 all X1 all X2 all X3 all X4 (addition(backward_diamond(X4,domain(X1)),domain(X2)) = domain(X2) & addition(backward_diamond(X3,domain(X0)),domain(X1)) = domain(X1) -> domain(X2) = addition(backward_diamond(multiplication(X3,X4),domain(X0)),domain(X2)))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
3.08/3.40	
3.08/3.40	============================== end of process non-clausal formulas ===
3.08/3.40	
3.08/3.40	============================== PROCESS INITIAL CLAUSES ===============
3.08/3.40	
3.08/3.40	============================== PREDICATE ELIMINATION =================
3.08/3.40	28 leq(A,B) | addition(A,B) != B # label(order) # label(axiom).  [clausify(8)].
3.08/3.40	29 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom).  [clausify(8)].
3.08/3.40	
3.08/3.40	============================== end predicate elimination =============
3.08/3.40	
3.08/3.40	Auto_denials:
3.08/3.40	  % copying label goals to answer in negative clause
3.08/3.40	
3.08/3.40	Term ordering decisions:
3.08/3.40	Function symbol KB weights:  zero=1. one=1. c1=1. c2=1. c3=1. c4=1. c5=1. multiplication=1. addition=1. backward_diamond=1. forward_diamond=1. backward_box=1. domain_difference=1. forward_box=1. antidomain=1. coantidomain=1. domain=1. c=1. codomain=1.
3.08/3.40	
3.08/3.40	============================== end of process initial clauses ========
3.08/3.40	
3.08/3.40	============================== CLAUSES FOR SEARCH ====================
3.08/3.40	
3.08/3.40	============================== end of clauses for search =============
3.08/3.40	
3.08/3.40	============================== SEARCH ================================
3.08/3.40	
3.08/3.40	% Starting search at 0.02 seconds.
3.08/3.40	
3.08/3.40	Low Water (keep): wt=38.000, iters=3340
3.08/3.40	
3.08/3.40	Low Water (keep): wt=36.000, iters=3365
3.08/3.40	
3.08/3.40	Low Water (keep): wt=35.000, iters=3346
3.08/3.40	
3.08/3.40	Low Water (keep): wt=34.000, iters=3393
3.08/3.40	
3.08/3.40	Low Water (keep): wt=33.000, iters=3382
3.08/3.40	
3.08/3.40	Low Water (keep): wt=32.000, iters=3387
3.08/3.40	
3.08/3.40	Low Water (keep): wt=31.000, iters=3352
3.08/3.40	
3.08/3.40	Low Water (keep): wt=30.000, iters=3366
3.08/3.40	
3.08/3.40	Low Water (keep): wt=29.000, iters=3348
3.08/3.40	
3.08/3.40	Low Water (keep): wt=28.000, iters=3366
3.08/3.40	
3.08/3.40	Low Water (keep): wt=27.000, iters=3342
3.08/3.40	
3.08/3.40	Low Water (keep): wt=26.000, iters=3430
3.08/3.40	
3.08/3.40	Low Water (keep): wt=25.000, iters=3337
3.08/3.40	
3.08/3.40	Low Water (keep): wt=24.000, iters=3338
3.08/3.40	
3.08/3.40	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 21 (0.00 of 1.76 sec).
3.08/3.40	
3.08/3.40	Low Water (keep): wt=23.000, iters=3335
3.08/3.40	
3.08/3.40	Low Water (keep): wt=22.000, itersAlarm clock 
119.61/120.06	Prover9 interrupted
119.61/120.06	EOF