0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.24	% Computer   : n006.star.cs.uiowa.edu
0.03/0.24	% Model      : x86_64 x86_64
0.03/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.24	% Memory     : 32218.625MB
0.03/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.24	% CPULimit   : 300
0.03/0.24	% DateTime   : Sat Jul 14 06:17:40 CDT 2018
0.03/0.24	% CPUTime    : 
0.07/0.44	============================== Prover9 ===============================
0.07/0.44	Prover9 (32) version 2009-11A, November 2009.
0.07/0.44	Process 31000 was started by sandbox2 on n006.star.cs.uiowa.edu,
0.07/0.44	Sat Jul 14 06:17:40 2018
0.07/0.44	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30968_n006.star.cs.uiowa.edu".
0.07/0.44	============================== end of head ===========================
0.07/0.44	
0.07/0.44	============================== INPUT =================================
0.07/0.44	
0.07/0.44	% Reading from file /tmp/Prover9_30968_n006.star.cs.uiowa.edu
0.07/0.44	
0.07/0.44	set(prolog_style_variables).
0.07/0.44	set(auto2).
0.07/0.44	    % set(auto2) -> set(auto).
0.07/0.44	    % set(auto) -> set(auto_inference).
0.07/0.44	    % set(auto) -> set(auto_setup).
0.07/0.44	    % set(auto_setup) -> set(predicate_elim).
0.07/0.44	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.44	    % set(auto) -> set(auto_limits).
0.07/0.44	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.44	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.44	    % set(auto) -> set(auto_denials).
0.07/0.44	    % set(auto) -> set(auto_process).
0.07/0.44	    % set(auto2) -> assign(new_constants, 1).
0.07/0.44	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.44	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.44	    % set(auto2) -> assign(max_hours, 1).
0.07/0.44	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.44	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.44	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.44	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.44	    % set(auto2) -> set(sort_initial_sos).
0.07/0.44	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.44	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.44	    % set(auto2) -> assign(max_megs, 400).
0.07/0.44	    % set(auto2) -> assign(stats, some).
0.07/0.44	    % set(auto2) -> clear(echo_input).
0.07/0.44	    % set(auto2) -> set(quiet).
0.07/0.44	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.44	    % set(auto2) -> clear(print_given).
0.07/0.44	assign(lrs_ticks,-1).
0.07/0.44	assign(sos_limit,10000).
0.07/0.44	assign(order,kbo).
0.07/0.44	set(lex_order_vars).
0.07/0.44	clear(print_given).
0.07/0.44	
0.07/0.44	% formulas(sos).  % not echoed (27 formulas)
0.07/0.44	
0.07/0.44	============================== end of input ==========================
0.07/0.44	
0.07/0.44	% From the command line: assign(max_seconds, 300).
0.07/0.44	
0.07/0.44	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.44	
0.07/0.44	% Formulas that are not ordinary clauses:
0.07/0.44	1 (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.07/0.44	2 (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.07/0.44	3 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	4 (all A A = multiplication(one,A)) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	5 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	6 (all A zero = multiplication(zero,A)) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	7 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	8 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	9 (all A all B all C multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C))) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	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.07/0.44	11 (all A all B (leq(A,B) <-> B = addition(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	12 (all A A = addition(A,A)) # label(additive_idempotence) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	13 (all X0 all X1 addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) = coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) # label(codomain2) # label(axiom) # label(non_clause).  [assumption].
0.07/0.44	14 (all X0 one = addition(coantidomain(coantidomain(X0)),coantidomain(X0))) # label(codomain3) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	15 (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].
5.10/5.29	16 (all X0 multiplication(X0,coantidomain(X0)) = zero) # label(codomain1) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	17 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	18 (all X0 zero = multiplication(antidomain(X0),X0)) # label(domain1) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	19 (all X0 one = addition(antidomain(antidomain(X0)),antidomain(X0))) # label(domain3) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	20 (all X0 domain(X0) = antidomain(antidomain(X0))) # label(domain4) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	21 (all X0 all X1 codomain(multiplication(codomain(X1),X0)) = backward_diamond(X0,X1)) # label(backward_diamond) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	22 (all X0 all X1 forward_box(X0,X1) = c(forward_diamond(X0,c(X1)))) # label(forward_box) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	23 (all X0 all X1 c(backward_diamond(X0,c(X1))) = backward_box(X0,X1)) # label(backward_box) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	24 (all X0 all X1 forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1)))) # label(forward_diamond) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	25 (all X0 all X1 domain_difference(X0,X1) = multiplication(domain(X0),antidomain(X1))) # label(domain_difference) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	26 (all X0 antidomain(domain(X0)) = c(X0)) # label(complement) # label(axiom) # label(non_clause).  [assumption].
5.10/5.29	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) -> addition(backward_diamond(multiplication(X3,X4),domain(X0)),domain(X2)) = domain(X2))) # label(goals) # label(negated_conjecture) # label(non_clause).  [assumption].
5.10/5.29	
5.10/5.29	============================== end of process non-clausal formulas ===
5.10/5.29	
5.10/5.29	============================== PROCESS INITIAL CLAUSES ===============
5.10/5.29	
5.10/5.29	============================== PREDICATE ELIMINATION =================
5.10/5.29	28 leq(A,B) | addition(A,B) != B # label(order) # label(axiom).  [clausify(11)].
5.10/5.29	29 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom).  [clausify(11)].
5.10/5.29	
5.10/5.29	============================== end predicate elimination =============
5.10/5.29	
5.10/5.29	Auto_denials:
5.10/5.29	  % copying label goals to answer in negative clause
5.10/5.29	
5.10/5.29	Term ordering decisions:
5.10/5.29	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.
5.10/5.29	
5.10/5.29	============================== end of process initial clauses ========
5.10/5.29	
5.10/5.29	============================== CLAUSES FOR SEARCH ====================
5.10/5.29	
5.10/5.29	============================== end of clauses for search =============
5.10/5.29	
5.10/5.29	============================== SEARCH ================================
5.10/5.29	
5.10/5.29	% Starting search at 0.01 seconds.
5.10/5.29	
5.10/5.29	Low Water (keep): wt=40.000, iters=3363
5.10/5.29	
5.10/5.29	Low Water (keep): wt=36.000, iters=3342
5.10/5.29	
5.10/5.29	Low Water (keep): wt=33.000, iters=3343
5.10/5.29	
5.10/5.29	Low Water (keep): wt=31.000, iters=3368
5.10/5.29	
5.10/5.29	Low Water (keep): wt=30.000, iters=3337
5.10/5.29	
5.10/5.29	Low Water (keep): wt=29.000, iters=3368
5.10/5.29	
5.10/5.29	Low Water (keep): wt=27.000, iters=3361
5.10/5.29	
5.10/5.29	Low Water (keep): wt=26.000, iters=3351
5.10/5.29	
5.10/5.29	Low Water (keep): wt=25.000, iters=3445
5.10/5.29	
5.10/5.29	Low Water (keep): wt=24.000, iters=3386
5.10/5.29	
5.10/5.29	Low Water (keep): wt=23.000, iters=3351
5.10/5.29	
5.10/5.29	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 22 (0.00 of 2.32 sec).
5.10/5.29	
5.10/5.29	Low Water (keep): wt=22.000, iters=3346
5.10/5.29	
5.10/5.29	Low Water (keep): wt=21.000, iters=3348
5.10/5.29	
5.10/5.29	Low Water (keep): wt=20.000, iters=3334
5.10/5.29	
5.10/5.29	Low Water (displace): id=6809, wt=49.000
5.10/5.29	
5.10/5.29	Low Water (diCputime limit exceeded (core dumped)
300.02/300.28	EOF