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.02/0.24	% Computer   : n066.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 05:00:24 CDT 2018
0.02/0.24	% CPUTime    : 
0.07/0.45	============================== Prover9 ===============================
0.07/0.45	Prover9 (32) version 2009-11A, November 2009.
0.07/0.45	Process 35838 was started by sandbox on n066.star.cs.uiowa.edu,
0.07/0.45	Sat Jul 14 05:00:25 2018
0.07/0.45	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_35806_n066.star.cs.uiowa.edu".
0.07/0.45	============================== end of head ===========================
0.07/0.45	
0.07/0.45	============================== INPUT =================================
0.07/0.45	
0.07/0.45	% Reading from file /tmp/Prover9_35806_n066.star.cs.uiowa.edu
0.07/0.45	
0.07/0.45	set(prolog_style_variables).
0.07/0.45	set(auto2).
0.07/0.45	    % set(auto2) -> set(auto).
0.07/0.45	    % set(auto) -> set(auto_inference).
0.07/0.45	    % set(auto) -> set(auto_setup).
0.07/0.45	    % set(auto_setup) -> set(predicate_elim).
0.07/0.45	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.45	    % set(auto) -> set(auto_limits).
0.07/0.45	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.45	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.45	    % set(auto) -> set(auto_denials).
0.07/0.45	    % set(auto) -> set(auto_process).
0.07/0.45	    % set(auto2) -> assign(new_constants, 1).
0.07/0.45	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.45	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.45	    % set(auto2) -> assign(max_hours, 1).
0.07/0.45	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.45	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.45	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.45	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.45	    % set(auto2) -> set(sort_initial_sos).
0.07/0.45	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.45	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.45	    % set(auto2) -> assign(max_megs, 400).
0.07/0.45	    % set(auto2) -> assign(stats, some).
0.07/0.45	    % set(auto2) -> clear(echo_input).
0.07/0.45	    % set(auto2) -> set(quiet).
0.07/0.45	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.45	    % set(auto2) -> clear(print_given).
0.07/0.45	assign(lrs_ticks,-1).
0.07/0.45	assign(sos_limit,10000).
0.07/0.45	assign(order,kbo).
0.07/0.45	set(lex_order_vars).
0.07/0.45	clear(print_given).
0.07/0.45	
0.07/0.45	% formulas(sos).  % not echoed (10 formulas)
0.07/0.45	
0.07/0.45	============================== end of input ==========================
0.07/0.45	
0.07/0.45	% From the command line: assign(max_seconds, 300).
0.07/0.45	
0.07/0.45	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.45	
0.07/0.45	% Formulas that are not ordinary clauses:
0.07/0.45	1 queens_p -> (all I all J (le(I,n) & le(s(I),J) & le(J,n) & le(s(n0),I) -> plus(p(J),J) != plus(p(I),I) & minus(p(I),I) != minus(p(J),J) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	2 (all I all J ((le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> plus(q(J),J) != plus(q(I),I) & minus(q(J),J) != minus(q(I),I) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	3 (all I (le(I,n) & le(s(n0),I) -> le(perm(I),n) & le(s(n0),perm(I)))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	4 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	5 (all I all J all K all L (plus(I,J) = plus(K,L) <-> minus(L,J) = minus(I,K))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	6 (all X all Y all Z (le(X,Y) & le(Y,Z) -> le(X,Z))) # label(le_trans) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	7 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	8 (all I all J all K all L (minus(I,K) = minus(J,L) <-> minus(K,L) = minus(I,J))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	9 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	10 -((all I q(I) = p(perm(I))) & queens_p -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.45	
0.07/0.45	============================== end of process non-clausal formulas ===
0.07/0.45	
0.07/0.45	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.45	
0.07/0.45	============================== PREDICATE ELIMINATION =================
0.07/0.45	
0.07/0.45	============================== end predicate elimination =============
0.07/0.45	
0.07/0.45	Auto_denials:  (non-Horn, no changes).
0.07/0.45	
0.07/0.45	Term ordering decisions:
0.07/0.45	Function symbol KB weights:  n=1. n0=1. c1=1. c2=1. minus=1. plus=1. s=1. perm=1. q=1. p=1.
0.51/0.75	
0.51/0.75	============================== end of process initial clauses ========
0.51/0.75	
0.51/0.75	============================== CLAUSES FOR SEARCH ====================
0.51/0.75	
0.51/0.75	============================== end of clauses for search =============
0.51/0.75	
0.51/0.75	============================== SEARCH ================================
0.51/0.75	
0.51/0.75	% Starting search at 0.01 seconds.
0.51/0.75	
0.51/0.75	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 413 (0.00 of 0.12 sec).
0.51/0.75	
0.51/0.75	============================== PROOF =================================
0.51/0.75	% SZS status Theorem
0.51/0.75	% SZS output start Refutation
0.51/0.75	
0.51/0.75	% Proof 1 at 0.30 (+ 0.01) seconds.
0.51/0.75	% Length of proof is 66.
0.51/0.75	% Level of proof is 10.
0.51/0.75	% Maximum clause weight is 42.000.
0.51/0.75	% Given clauses 971.
0.51/0.75	
0.51/0.75	1 queens_p -> (all I all J (le(I,n) & le(s(I),J) & le(J,n) & le(s(n0),I) -> plus(p(J),J) != plus(p(I),I) & minus(p(I),I) != minus(p(J),J) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	2 (all I all J ((le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> plus(q(J),J) != plus(q(I),I) & minus(q(J),J) != minus(q(I),I) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	3 (all I (le(I,n) & le(s(n0),I) -> le(perm(I),n) & le(s(n0),perm(I)))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	4 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	5 (all I all J all K all L (plus(I,J) = plus(K,L) <-> minus(L,J) = minus(I,K))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	6 (all X all Y all Z (le(X,Y) & le(Y,Z) -> le(X,Z))) # label(le_trans) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	7 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	8 (all I all J all K all L (minus(I,K) = minus(J,L) <-> minus(K,L) = minus(I,J))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	9 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
0.51/0.75	10 -((all I q(I) = p(perm(I))) & queens_p -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
0.51/0.75	11 queens_p # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
0.51/0.75	12 le(c2,n) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	13 le(c1,n) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	14 le(A,s(A)) # label(succ_le) # label(axiom).  [clausify(9)].
0.51/0.75	15 le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	16 le(s(n0),c1) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	17 q(A) = p(perm(A)) # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
0.51/0.75	18 perm(A) = minus(s(n),A) # label(permutation) # label(axiom).  [clausify(4)].
0.51/0.75	19 minus(perm(A),perm(B)) = minus(B,A) # label(permutation_another_one) # label(axiom).  [clausify(7)].
0.51/0.75	20 minus(minus(s(n),A),minus(s(n),B)) = minus(B,A).  [copy(19),rewrite([18(1),18(4)])].
0.51/0.75	21 plus(q(c2),c2) = plus(q(c1),c1) | minus(q(c2),c2) = minus(q(c1),c1) | q(c2) = q(c1) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	22 plus(p(minus(s(n),c2)),c2) = plus(p(minus(s(n),c1)),c1) | minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | p(minus(s(n),c2)) = p(minus(s(n),c1)) | queens_q.  [copy(21),rewrite([17(2),18(2),17(9),18(9),17(17),18(17),17(24),18(24),17(32),18(32),17(37),18(37)])].
0.51/0.75	23 -queens_q # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
0.51/0.75	24 -queens_p | -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | p(B) != p(A) # label(queens_p) # label(axiom).  [clausify(1)].
0.51/0.75	25 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | p(B) != p(A).  [copy(24),unit_del(a,11)].
0.51/0.75	26 -queens_p | -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | plus(p(B),B) != plus(p(A),A) # label(queens_p) # label(axiom).  [clausify(1)].
0.51/0.75	27 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | plus(p(B),B) != plus(p(A),A).  [copy(26),unit_del(a,11)].
0.51/0.75	28 -queens_p | -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | minus(p(B),B) != minus(p(A),A) # label(queens_p) # label(axiom).  [clausify(1)].
0.51/0.75	29 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | minus(p(B),B) != minus(p(A),A).  [copy(28),unit_del(a,11)].
0.51/0.75	30 -le(A,B) | -le(B,C) | le(A,C) # label(le_trans) # label(axiom).  [clausify(6)].
0.51/0.75	31 le(s(perm(c2)),perm(c1)) | -le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(2)].
0.51/0.75	32 le(s(minus(s(n),c2)),minus(s(n),c1)) | -le(s(c1),c2).  [copy(31),rewrite([18(2),18(7)]),unit_del(c,23)].
0.51/0.75	33 -le(A,n) | -le(s(n0),A) | le(perm(A),n) # label(permutation_range) # label(axiom).  [clausify(3)].
0.51/0.75	34 -le(A,n) | -le(s(n0),A) | le(minus(s(n),A),n).  [copy(33),rewrite([18(6)])].
0.51/0.75	35 -le(A,n) | -le(s(n0),A) | le(s(n0),perm(A)) # label(permutation_range) # label(axiom).  [clausify(3)].
0.51/0.75	36 -le(A,n) | -le(s(n0),A) | le(s(n0),minus(s(n),A)).  [copy(35),rewrite([18(8)])].
0.51/0.75	37 plus(A,B) != plus(C,D) | minus(B,D) = minus(C,A) # label(plus1) # label(axiom).  [clausify(5)].
0.51/0.75	38 plus(A,B) = plus(C,D) | minus(B,D) != minus(C,A) # label(plus1) # label(axiom).  [clausify(5)].
0.51/0.75	39 minus(A,B) != minus(C,D) | minus(D,B) = minus(C,A) # label(minus1) # label(axiom).  [clausify(8)].
0.51/0.75	41 plus(p(minus(s(n),c2)),c2) = plus(p(minus(s(n),c1)),c1) | minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | p(minus(s(n),c2)) = p(minus(s(n),c1)).  [back_unit_del(22),unit_del(d,23)].
0.51/0.75	42 le(s(n0),c1).  [back_unit_del(16),unit_del(b,23)].
0.51/0.75	43 le(s(c1),c2).  [back_unit_del(15),unit_del(b,23)].
0.51/0.75	44 le(c1,n).  [back_unit_del(13),unit_del(b,23)].
0.51/0.75	45 le(c2,n).  [back_unit_del(12),unit_del(b,23)].
0.51/0.75	51 le(s(minus(s(n),c2)),minus(s(n),c1)).  [back_unit_del(32),unit_del(b,43)].
0.51/0.75	59 -le(s(A),B) | le(A,B).  [resolve(30,a,14,a)].
0.51/0.75	67 plus(A,B) = plus(B,A).  [xx_res(38,b)].
0.51/0.75	73 plus(c2,p(minus(s(n),c2))) = plus(c1,p(minus(s(n),c1))) | minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | p(minus(s(n),c2)) = p(minus(s(n),c1)).  [back_rewrite(41),rewrite([67(7),67(14)])].
0.51/0.75	74 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | plus(B,p(B)) != plus(A,p(A)).  [back_rewrite(27),rewrite([67(11),67(13)])].
0.51/0.75	77 minus(A,B) != minus(C,D) | minus(D,minus(s(n),A)) = minus(C,minus(s(n),B)).  [para(20(a,1),39(a,1))].
0.51/0.75	80 le(minus(s(n),c1),n).  [resolve(42,a,34,b),unit_del(a,44)].
0.51/0.75	96 -le(minus(s(n),c2),n) | -le(s(n0),minus(s(n),c2)) | minus(p(minus(s(n),c2)),minus(s(n),c2)) != minus(p(minus(s(n),c1)),minus(s(n),c1)).  [resolve(51,a,29,b),flip(d),unit_del(b,80)].
0.51/0.75	97 -le(minus(s(n),c2),n) | -le(s(n0),minus(s(n),c2)) | p(minus(s(n),c2)) != p(minus(s(n),c1)).  [resolve(51,a,25,b),flip(d),unit_del(b,80)].
0.51/0.75	149 le(c1,c2).  [resolve(59,a,43,a)].
0.51/0.75	160 -le(A,c1) | le(A,c2).  [resolve(149,a,30,b)].
0.51/0.75	265 le(s(n0),c2).  [resolve(160,a,42,a)].
0.51/0.75	271 le(s(n0),minus(s(n),c2)).  [resolve(265,a,36,b),unit_del(a,45)].
0.51/0.75	272 le(minus(s(n),c2),n).  [resolve(265,a,34,b),unit_del(a,45)].
0.51/0.75	277 p(minus(s(n),c2)) != p(minus(s(n),c1)).  [back_unit_del(97),unit_del(a,272),unit_del(b,271)].
0.51/0.75	278 minus(p(minus(s(n),c2)),minus(s(n),c2)) != minus(p(minus(s(n),c1)),minus(s(n),c1)).  [back_unit_del(96),unit_del(a,272),unit_del(b,271)].
0.51/0.75	279 plus(c2,p(minus(s(n),c2))) = plus(c1,p(minus(s(n),c1))) | minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1).  [back_unit_del(73),unit_del(c,277)].
0.51/0.75	439 plus(minus(s(n),c2),p(minus(s(n),c2))) != plus(minus(s(n),c1),p(minus(s(n),c1))).  [resolve(74,b,51,a),flip(d),unit_del(a,272),unit_del(b,80),unit_del(c,271)].
0.51/0.75	1296 minus(p(minus(s(n),c2)),p(minus(s(n),c1))) != minus(c1,c2).  [ur(77,b,278,a(flip)),flip(a)].
0.51/0.75	1303 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1).  [resolve(279,a,37,a),unit_del(b,1296)].
0.51/0.75	2215 minus(p(minus(s(n),c2)),p(minus(s(n),c1))) != minus(c2,c1).  [ur(38,a,439,a),rewrite([20(20)])].
0.51/0.75	2219 $F.  [ur(39,b,2215,a(flip)),rewrite([1303(14)]),xx(a)].
0.51/0.75	
0.51/0.75	% SZS output end Refutation
0.51/0.75	============================== end of proof ==========================
0.51/0.75	
0.51/0.75	============================== STATISTICS ============================
0.51/0.75	
0.51/0.75	Given=971. Generated=10040. Kept=2200. proofs=1.
0.51/0.75	Usable=965. Sos=1190. Demods=15. Limbo=2, Disabled=65. Hints=0.
0.51/0.75	Megabytes=2.15.
0.51/0.75	User_CPU=0.30, System_CPU=0.01, Wall_clock=0.
0.51/0.75	
0.51/0.75	============================== end of statistics =====================
0.51/0.75	
0.51/0.75	============================== end of search =========================
0.51/0.75	
0.51/0.75	THEOREM PROVED
0.51/0.75	% SZS status Theorem
0.51/0.75	
0.51/0.75	Exiting with 1 proof.
0.51/0.75	
0.51/0.75	Process 35838 exit (max_proofs) Sat Jul 14 05:00:25 2018
0.51/0.75	Prover9 interrupted
0.51/0.75	EOF