0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n014.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 960
0.13/0.34	% WCLimit  : 120
0.13/0.34	% DateTime : Tue Aug  9 04:21:01 EDT 2022
0.13/0.34	% CPUTime  : 
0.75/1.01	============================== Prover9 ===============================
0.75/1.01	Prover9 (32) version 2009-11A, November 2009.
0.75/1.01	Process 31862 was started by sandbox on n014.cluster.edu,
0.75/1.01	Tue Aug  9 04:21:01 2022
0.75/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_31635_n014.cluster.edu".
0.75/1.01	============================== end of head ===========================
0.75/1.01	
0.75/1.01	============================== INPUT =================================
0.75/1.01	
0.75/1.01	% Reading from file /tmp/Prover9_31635_n014.cluster.edu
0.75/1.01	
0.75/1.01	set(prolog_style_variables).
0.75/1.01	set(auto2).
0.75/1.01	    % set(auto2) -> set(auto).
0.75/1.01	    % set(auto) -> set(auto_inference).
0.75/1.01	    % set(auto) -> set(auto_setup).
0.75/1.01	    % set(auto_setup) -> set(predicate_elim).
0.75/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.01	    % set(auto) -> set(auto_limits).
0.75/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.01	    % set(auto) -> set(auto_denials).
0.75/1.01	    % set(auto) -> set(auto_process).
0.75/1.01	    % set(auto2) -> assign(new_constants, 1).
0.75/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.01	    % set(auto2) -> assign(max_hours, 1).
0.75/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.01	    % set(auto2) -> set(sort_initial_sos).
0.75/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.01	    % set(auto2) -> assign(max_megs, 400).
0.75/1.01	    % set(auto2) -> assign(stats, some).
0.75/1.01	    % set(auto2) -> clear(echo_input).
0.75/1.01	    % set(auto2) -> set(quiet).
0.75/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.01	    % set(auto2) -> clear(print_given).
0.75/1.01	assign(lrs_ticks,-1).
0.75/1.01	assign(sos_limit,10000).
0.75/1.01	assign(order,kbo).
0.75/1.01	set(lex_order_vars).
0.75/1.01	clear(print_given).
0.75/1.01	
0.75/1.01	% formulas(sos).  % not echoed (10 formulas)
0.75/1.01	
0.75/1.01	============================== end of input ==========================
0.75/1.01	
0.75/1.01	% From the command line: assign(max_seconds, 960).
0.75/1.01	
0.75/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.01	
0.75/1.01	% Formulas that are not ordinary clauses:
0.75/1.01	1 queens_p -> (all I all J (le(I,n) & le(s(I),J) & le(J,n) & le(s(n0),I) -> p(J) != p(I) & minus(p(J),J) != minus(p(I),I) & plus(p(J),J) != plus(p(I),I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	2 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	3 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	4 (all X all Y all Z (le(Y,Z) & le(X,Y) -> le(X,Z))) # label(le_trans) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	5 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	6 (all I all J all K all L (minus(K,L) = minus(I,J) <-> minus(J,L) = minus(I,K))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	7 (all I all J all K all L (minus(L,J) = minus(I,K) <-> plus(K,L) = plus(I,J))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	8 (all I all J (le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(s(I),J) & le(I,n) & le(s(n0),I) -> q(J) != q(I) & plus(q(I),I) != plus(q(J),J) & minus(q(I),I) != minus(q(J),J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	9 (all I (le(s(n0),I) & le(I,n) -> le(s(n0),perm(I)) & le(perm(I),n))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
0.75/1.01	10 -(queens_p & (all I p(perm(I)) = q(I)) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
0.75/1.01	
0.75/1.01	============================== end of process non-clausal formulas ===
0.75/1.01	
0.75/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.75/1.01	
0.75/1.01	============================== PREDICATE ELIMINATION =================
0.75/1.01	
0.75/1.01	============================== end predicate elimination =============
0.75/1.01	
0.75/1.01	Auto_denials:  (non-Horn, no changes).
0.75/1.01	
0.75/1.01	Term ordering decisions:
0.75/1.01	Function symbol KB weights:  n=1. n0=1. c1=1. c2=1. minus=1. plus=1. s=1. perm=1. q=1. p=1.
1.20/1.47	
1.20/1.47	============================== end of process initial clauses ========
1.20/1.47	
1.20/1.47	============================== CLAUSES FOR SEARCH ====================
1.20/1.47	
1.20/1.47	============================== end of clauses for search =============
1.20/1.47	
1.20/1.47	============================== SEARCH ================================
1.20/1.47	
1.20/1.47	% Starting search at 0.01 seconds.
1.20/1.47	
1.20/1.47	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 249 (0.00 of 0.17 sec).
1.20/1.47	
1.20/1.47	============================== PROOF =================================
1.20/1.47	% SZS status Theorem
1.20/1.47	% SZS output start Refutation
1.20/1.47	
1.20/1.47	% Proof 1 at 0.46 (+ 0.01) seconds.
1.20/1.47	% Length of proof is 75.
1.20/1.47	% Level of proof is 10.
1.20/1.47	% Maximum clause weight is 42.000.
1.20/1.47	% Given clauses 1132.
1.20/1.47	
1.20/1.47	1 queens_p -> (all I all J (le(I,n) & le(s(I),J) & le(J,n) & le(s(n0),I) -> p(J) != p(I) & minus(p(J),J) != minus(p(I),I) & plus(p(J),J) != plus(p(I),I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	2 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	3 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	4 (all X all Y all Z (le(Y,Z) & le(X,Y) -> le(X,Z))) # label(le_trans) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	5 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	6 (all I all J all K all L (minus(K,L) = minus(I,J) <-> minus(J,L) = minus(I,K))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	7 (all I all J all K all L (minus(L,J) = minus(I,K) <-> plus(K,L) = plus(I,J))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	8 (all I all J (le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(s(I),J) & le(I,n) & le(s(n0),I) -> q(J) != q(I) & plus(q(I),I) != plus(q(J),J) & minus(q(I),I) != minus(q(J),J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	9 (all I (le(s(n0),I) & le(I,n) -> le(s(n0),perm(I)) & le(perm(I),n))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
1.20/1.47	10 -(queens_p & (all I p(perm(I)) = q(I)) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
1.20/1.47	11 queens_p # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.20/1.47	12 le(A,s(A)) # label(succ_le) # label(axiom).  [clausify(3)].
1.20/1.47	13 le(c2,n) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	14 le(c1,n) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	15 le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	16 le(s(n0),c1) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	17 q(A) = p(perm(A)) # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.20/1.47	18 perm(A) = minus(s(n),A) # label(permutation) # label(axiom).  [clausify(5)].
1.20/1.47	19 minus(perm(A),perm(B)) = minus(B,A) # label(permutation_another_one) # label(axiom).  [clausify(2)].
1.20/1.47	20 minus(minus(s(n),A),minus(s(n),B)) = minus(B,A).  [copy(19),rewrite([18(1),18(4)])].
1.20/1.47	21 q(c2) = q(c1) | plus(q(c2),c2) = plus(q(c1),c1) | minus(q(c2),c2) = minus(q(c1),c1) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	22 p(minus(s(n),c2)) = p(minus(s(n),c1)) | 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) | queens_q.  [copy(21),rewrite([17(2),18(2),17(7),18(7),17(13),18(13),17(20),18(20),17(28),18(28),17(35),18(35)])].
1.20/1.47	23 -queens_q # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.20/1.47	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)].
1.20/1.47	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)].
1.20/1.47	26 -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)].
1.20/1.47	27 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | minus(p(B),B) != minus(p(A),A).  [copy(26),unit_del(a,11)].
1.20/1.47	28 -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)].
1.20/1.47	29 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | plus(p(B),B) != plus(p(A),A).  [copy(28),unit_del(a,11)].
1.20/1.47	30 -le(A,B) | -le(C,A) | le(C,B) # label(le_trans) # label(axiom).  [clausify(4)].
1.20/1.47	31 le(s(perm(c2)),perm(c1)) | -le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(8)].
1.20/1.47	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)].
1.20/1.47	33 -le(s(n0),A) | -le(A,n) | le(perm(A),n) # label(permutation_range) # label(axiom).  [clausify(9)].
1.20/1.47	34 -le(s(n0),A) | -le(A,n) | le(minus(s(n),A),n).  [copy(33),rewrite([18(6)])].
1.20/1.47	35 -le(s(n0),A) | -le(A,n) | le(s(n0),perm(A)) # label(permutation_range) # label(axiom).  [clausify(9)].
1.20/1.47	36 -le(s(n0),A) | -le(A,n) | le(s(n0),minus(s(n),A)).  [copy(35),rewrite([18(8)])].
1.20/1.47	37 minus(A,B) != minus(C,D) | minus(D,B) = minus(C,A) # label(minus1) # label(axiom).  [clausify(6)].
1.20/1.47	38 minus(A,B) != minus(C,D) | plus(D,A) = plus(C,B) # label(plus1) # label(axiom).  [clausify(7)].
1.20/1.47	39 minus(A,B) = minus(C,D) | plus(D,A) != plus(C,B) # label(plus1) # label(axiom).  [clausify(7)].
1.20/1.47	41 p(minus(s(n),c2)) = p(minus(s(n),c1)) | 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).  [back_unit_del(22),unit_del(d,23)].
1.20/1.47	42 le(s(n0),c1).  [back_unit_del(16),unit_del(b,23)].
1.20/1.47	43 le(s(c1),c2).  [back_unit_del(15),unit_del(b,23)].
1.20/1.47	44 le(c1,n).  [back_unit_del(14),unit_del(b,23)].
1.20/1.47	45 le(c2,n).  [back_unit_del(13),unit_del(b,23)].
1.20/1.47	51 le(s(minus(s(n),c2)),minus(s(n),c1)).  [back_unit_del(32),unit_del(b,43)].
1.20/1.47	60 -le(s(A),B) | le(A,B).  [resolve(30,b,12,a)].
1.20/1.47	63 minus(A,minus(s(n),B)) = minus(B,minus(s(n),A)).  [resolve(37,a,20,a)].
1.20/1.47	65 minus(A,A) = minus(B,B).  [xx_res(37,a)].
1.20/1.47	66 minus(A,B) != minus(C,D) | minus(D,minus(s(n),A)) = minus(C,minus(s(n),B)).  [para(20(a,1),37(a,1))].
1.20/1.47	68 minus(A,A) = c_0.  [new_symbol(65)].
1.20/1.47	71 plus(A,B) = plus(B,A).  [xx_res(38,a)].
1.20/1.47	77 p(minus(s(n),c2)) = p(minus(s(n),c1)) | 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_rewrite(41),rewrite([71(18),71(25)])].
1.20/1.47	78 minus(A,B) = minus(C,D) | plus(A,D) != plus(B,C).  [back_rewrite(39),rewrite([71(4),71(5)])].
1.20/1.47	79 minus(A,B) != minus(C,D) | plus(A,D) = plus(B,C).  [back_rewrite(38),rewrite([71(4),71(5)])].
1.20/1.47	80 -le(A,n) | -le(s(A),B) | -le(B,n) | -le(s(n0),A) | plus(B,p(B)) != plus(A,p(A)).  [back_rewrite(29),rewrite([71(11),71(13)])].
1.20/1.47	82 le(minus(s(n),c1),n).  [resolve(42,a,34,a),unit_del(a,44)].
1.20/1.47	98 -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,27,b),flip(d),unit_del(b,82)].
1.20/1.47	99 -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,82)].
1.20/1.47	229 le(c1,c2).  [resolve(60,a,43,a)].
1.20/1.47	240 -le(A,c1) | le(A,c2).  [resolve(229,a,30,a)].
1.20/1.47	285 minus(s(n),minus(s(n),A)) = minus(A,c_0).  [para(63(a,1),18(a,2)),rewrite([18(4),68(11)])].
1.20/1.47	288 minus(A,minus(B,c_0)) = minus(A,B).  [para(63(a,1),20(a,1)),rewrite([285(6)])].
1.20/1.47	289 minus(A,minus(s(n),B)) != minus(C,D) | minus(D,minus(s(n),A)) = minus(C,B).  [para(63(a,1),37(a,1))].
1.20/1.47	335 le(s(n0),c2).  [resolve(240,a,42,a)].
1.20/1.47	341 le(s(n0),minus(s(n),c2)).  [resolve(335,a,36,a),unit_del(a,45)].
1.20/1.47	342 le(minus(s(n),c2),n).  [resolve(335,a,34,a),unit_del(a,45)].
1.20/1.47	347 p(minus(s(n),c2)) != p(minus(s(n),c1)).  [back_unit_del(99),unit_del(a,342),unit_del(b,341)].
1.20/1.47	348 minus(p(minus(s(n),c2)),minus(s(n),c2)) != minus(p(minus(s(n),c1)),minus(s(n),c1)).  [back_unit_del(98),unit_del(a,342),unit_del(b,341)].
1.20/1.47	349 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(77),unit_del(a,347)].
1.20/1.47	350 minus(A,B) != minus(C,D) | minus(A,C) = minus(B,D).  [para(20(a,1),66(a,2)),rewrite([20(10),20(11)])].
1.20/1.47	532 plus(minus(s(n),c2),p(minus(s(n),c2))) != plus(minus(s(n),c1),p(minus(s(n),c1))).  [resolve(80,b,51,a),flip(d),unit_del(a,342),unit_del(b,82),unit_del(c,341)].
1.20/1.47	1720 minus(p(minus(s(n),c1)),p(minus(s(n),c2))) != minus(c2,c1).  [ur(289,b,348,a),rewrite([285(8),288(5)]),flip(a)].
1.20/1.47	1745 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1).  [resolve(349,a,78,b),flip(b),unit_del(b,1720)].
1.20/1.47	2710 minus(p(minus(s(n),c1)),p(minus(s(n),c2))) != minus(c1,c2).  [ur(79,b,532,a),rewrite([20(9)]),flip(a)].
1.20/1.47	2712 $F.  [ur(350,b,2710,a),rewrite([1745(14)]),xx(a)].
1.20/1.47	
1.20/1.47	% SZS output end Refutation
1.20/1.47	============================== end of proof ==========================
1.20/1.47	
1.20/1.47	============================== STATISTICS ============================
1.20/1.47	
1.20/1.47	Given=1132. Generated=12951. Kept=2693. proofs=1.
1.20/1.47	Usable=1124. Sos=1514. Demods=15. Limbo=0, Disabled=77. Hints=0.
1.20/1.47	Megabytes=2.74.
1.20/1.47	User_CPU=0.46, System_CPU=0.01, Wall_clock=1.
1.20/1.47	
1.20/1.47	============================== end of statistics =====================
1.20/1.47	
1.20/1.47	============================== end of search =========================
1.20/1.47	
1.20/1.47	THEOREM PROVED
1.20/1.47	% SZS status Theorem
1.20/1.47	
1.20/1.47	Exiting with 1 proof.
1.20/1.47	
1.20/1.47	Process 31862 exit (max_proofs) Tue Aug  9 04:21:02 2022
1.20/1.47	Prover9 interrupted
1.20/1.48	EOF