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.12/0.35	% Computer : n027.cluster.edu
0.12/0.35	% Model    : x86_64 x86_64
0.12/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.35	% Memory   : 8042.1875MB
0.12/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.35	% CPULimit : 1440
0.12/0.35	% WCLimit  : 180
0.12/0.35	% DateTime : Mon Jul  3 06:33:31 EDT 2023
0.12/0.36	% CPUTime  : 
0.43/0.97	============================== Prover9 ===============================
0.43/0.97	Prover9 (32) version 2009-11A, November 2009.
0.43/0.97	Process 14209 was started by sandbox on n027.cluster.edu,
0.43/0.97	Mon Jul  3 06:33:32 2023
0.43/0.97	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_14055_n027.cluster.edu".
0.43/0.97	============================== end of head ===========================
0.43/0.97	
0.43/0.97	============================== INPUT =================================
0.43/0.97	
0.43/0.97	% Reading from file /tmp/Prover9_14055_n027.cluster.edu
0.43/0.97	
0.43/0.97	set(prolog_style_variables).
0.43/0.97	set(auto2).
0.43/0.97	    % set(auto2) -> set(auto).
0.43/0.97	    % set(auto) -> set(auto_inference).
0.43/0.97	    % set(auto) -> set(auto_setup).
0.43/0.97	    % set(auto_setup) -> set(predicate_elim).
0.43/0.97	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/0.97	    % set(auto) -> set(auto_limits).
0.43/0.97	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/0.97	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/0.97	    % set(auto) -> set(auto_denials).
0.43/0.97	    % set(auto) -> set(auto_process).
0.43/0.97	    % set(auto2) -> assign(new_constants, 1).
0.43/0.97	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/0.97	    % set(auto2) -> assign(max_weight, "200.000").
0.43/0.97	    % set(auto2) -> assign(max_hours, 1).
0.43/0.97	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/0.97	    % set(auto2) -> assign(max_seconds, 0).
0.43/0.97	    % set(auto2) -> assign(max_minutes, 5).
0.43/0.97	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/0.97	    % set(auto2) -> set(sort_initial_sos).
0.43/0.97	    % set(auto2) -> assign(sos_limit, -1).
0.43/0.97	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/0.97	    % set(auto2) -> assign(max_megs, 400).
0.43/0.97	    % set(auto2) -> assign(stats, some).
0.43/0.97	    % set(auto2) -> clear(echo_input).
0.43/0.97	    % set(auto2) -> set(quiet).
0.43/0.97	    % set(auto2) -> clear(print_initial_clauses).
0.43/0.97	    % set(auto2) -> clear(print_given).
0.43/0.97	assign(lrs_ticks,-1).
0.43/0.97	assign(sos_limit,10000).
0.43/0.97	assign(order,kbo).
0.43/0.97	set(lex_order_vars).
0.43/0.97	clear(print_given).
0.43/0.97	
0.43/0.97	% formulas(sos).  % not echoed (10 formulas)
0.43/0.97	
0.43/0.97	============================== end of input ==========================
0.43/0.97	
0.43/0.97	% From the command line: assign(max_seconds, 1440).
0.43/0.97	
0.43/0.97	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/0.97	
0.43/0.97	% Formulas that are not ordinary clauses:
0.43/0.97	1 (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.43/0.97	2 (all I all J all K all L (plus(K,L) = plus(I,J) <-> minus(I,K) = minus(L,J))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	3 queens_p -> (all I all J (le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> p(I) != p(J) & minus(p(I),I) != minus(p(J),J) & plus(p(J),J) != plus(p(I),I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	4 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	5 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	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.43/0.97	7 (all I all J all K all L (minus(J,L) = minus(I,K) <-> minus(K,L) = minus(I,J))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	8 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	9 (all I all J (le(s(n0),I) & le(I,n) & le(s(I),J) & le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) -> minus(q(I),I) != minus(q(J),J) & plus(q(J),J) != plus(q(I),I) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
0.43/0.97	10 -(queens_p & (all I p(perm(I)) = q(I)) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
0.43/0.97	
0.43/0.97	============================== end of process non-clausal formulas ===
0.43/0.97	
0.43/0.97	============================== PROCESS INITIAL CLAUSES ===============
0.43/0.97	
0.43/0.97	============================== PREDICATE ELIMINATION =================
0.43/0.97	
0.43/0.97	============================== end predicate elimination =============
0.43/0.97	
0.43/0.97	Auto_denials:  (non-Horn, no changes).
0.43/0.97	
0.43/0.97	Term ordering decisions:
0.43/0.97	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.03/1.34	
1.03/1.34	============================== end of process initial clauses ========
1.03/1.34	
1.03/1.34	============================== CLAUSES FOR SEARCH ====================
1.03/1.34	
1.03/1.34	============================== end of clauses for search =============
1.03/1.34	
1.03/1.34	============================== SEARCH ================================
1.03/1.34	
1.03/1.34	% Starting search at 0.01 seconds.
1.03/1.34	
1.03/1.34	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 412 (0.00 of 0.17 sec).
1.03/1.34	
1.03/1.34	============================== PROOF =================================
1.03/1.34	% SZS status Theorem
1.03/1.34	% SZS output start Refutation
1.03/1.34	
1.03/1.34	% Proof 1 at 0.38 (+ 0.01) seconds.
1.03/1.34	% Length of proof is 67.
1.03/1.34	% Level of proof is 10.
1.03/1.34	% Maximum clause weight is 42.000.
1.03/1.34	% Given clauses 980.
1.03/1.34	
1.03/1.34	1 (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.03/1.34	2 (all I all J all K all L (plus(K,L) = plus(I,J) <-> minus(I,K) = minus(L,J))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	3 queens_p -> (all I all J (le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> p(I) != p(J) & minus(p(I),I) != minus(p(J),J) & plus(p(J),J) != plus(p(I),I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	4 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	5 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	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].
1.03/1.34	7 (all I all J all K all L (minus(J,L) = minus(I,K) <-> minus(K,L) = minus(I,J))) # label(minus1) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	8 (all I minus(s(n),I) = perm(I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	9 (all I all J (le(s(n0),I) & le(I,n) & le(s(I),J) & le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) -> minus(q(I),I) != minus(q(J),J) & plus(q(J),J) != plus(q(I),I) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
1.03/1.34	10 -(queens_p & (all I p(perm(I)) = q(I)) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
1.03/1.34	11 queens_p # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.03/1.34	12 le(A,s(A)) # label(succ_le) # label(axiom).  [clausify(5)].
1.03/1.34	13 le(c1,n) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	14 le(c2,n) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	15 le(s(n0),c1) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	16 le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	17 q(A) = p(perm(A)) # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.03/1.34	18 minus(s(n),A) = perm(A) # label(permutation) # label(axiom).  [clausify(8)].
1.03/1.34	19 perm(A) = minus(s(n),A).  [copy(18),flip(a)].
1.03/1.34	20 minus(perm(A),perm(B)) = minus(B,A) # label(permutation_another_one) # label(axiom).  [clausify(4)].
1.03/1.34	21 minus(minus(s(n),A),minus(s(n),B)) = minus(B,A).  [copy(20),rewrite([19(1),19(4)])].
1.03/1.34	22 minus(q(c2),c2) = minus(q(c1),c1) | plus(q(c2),c2) = plus(q(c1),c1) | q(c2) = q(c1) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	23 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | plus(p(minus(s(n),c2)),c2) = plus(p(minus(s(n),c1)),c1) | p(minus(s(n),c2)) = p(minus(s(n),c1)) | queens_q.  [copy(22),rewrite([17(2),19(2),17(9),19(9),17(17),19(17),17(24),19(24),17(32),19(32),17(37),19(37)])].
1.03/1.34	24 -queens_q # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.03/1.34	25 -queens_p | -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | p(A) != p(B) # label(queens_p) # label(axiom).  [clausify(3)].
1.03/1.34	26 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | p(A) != p(B).  [copy(25),unit_del(a,11)].
1.03/1.34	27 -queens_p | -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | minus(p(A),A) != minus(p(B),B) # label(queens_p) # label(axiom).  [clausify(3)].
1.03/1.34	28 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | minus(p(A),A) != minus(p(B),B).  [copy(27),unit_del(a,11)].
1.03/1.34	29 -queens_p | -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | plus(p(A),A) != plus(p(B),B) # label(queens_p) # label(axiom).  [clausify(3)].
1.03/1.34	30 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | plus(p(A),A) != plus(p(B),B).  [copy(29),unit_del(a,11)].
1.03/1.34	31 -le(A,B) | -le(B,C) | le(A,C) # label(le_trans) # label(axiom).  [clausify(6)].
1.03/1.34	32 -le(s(n0),A) | -le(A,n) | le(perm(A),n) # label(permutation_range) # label(axiom).  [clausify(1)].
1.03/1.34	33 -le(s(n0),A) | -le(A,n) | le(minus(s(n),A),n).  [copy(32),rewrite([19(6)])].
1.03/1.34	34 le(s(perm(c2)),perm(c1)) | -le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(9)].
1.03/1.34	35 le(s(minus(s(n),c2)),minus(s(n),c1)) | -le(s(c1),c2).  [copy(34),rewrite([19(2),19(7)]),unit_del(c,24)].
1.03/1.34	36 -le(s(n0),A) | -le(A,n) | le(s(n0),perm(A)) # label(permutation_range) # label(axiom).  [clausify(1)].
1.03/1.34	37 -le(s(n0),A) | -le(A,n) | le(s(n0),minus(s(n),A)).  [copy(36),rewrite([19(8)])].
1.03/1.34	38 plus(A,B) != plus(C,D) | minus(B,D) = minus(C,A) # label(plus1) # label(axiom).  [clausify(2)].
1.03/1.34	39 plus(A,B) = plus(C,D) | minus(B,D) != minus(C,A) # label(plus1) # label(axiom).  [clausify(2)].
1.03/1.34	40 minus(A,B) != minus(C,D) | minus(D,B) = minus(C,A) # label(minus1) # label(axiom).  [clausify(7)].
1.03/1.34	42 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | plus(p(minus(s(n),c2)),c2) = plus(p(minus(s(n),c1)),c1) | p(minus(s(n),c2)) = p(minus(s(n),c1)).  [back_unit_del(23),unit_del(d,24)].
1.03/1.34	43 le(s(c1),c2).  [back_unit_del(16),unit_del(b,24)].
1.03/1.34	44 le(s(n0),c1).  [back_unit_del(15),unit_del(b,24)].
1.03/1.34	45 le(c2,n).  [back_unit_del(14),unit_del(b,24)].
1.03/1.34	46 le(c1,n).  [back_unit_del(13),unit_del(b,24)].
1.03/1.34	52 le(s(minus(s(n),c2)),minus(s(n),c1)).  [back_unit_del(35),unit_del(b,43)].
1.03/1.34	60 -le(s(A),B) | le(A,B).  [resolve(31,a,12,a)].
1.03/1.34	68 plus(A,B) = plus(B,A).  [xx_res(39,b)].
1.03/1.34	74 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | plus(c2,p(minus(s(n),c2))) = plus(c1,p(minus(s(n),c1))) | p(minus(s(n),c2)) = p(minus(s(n),c1)).  [back_rewrite(42),rewrite([68(22),68(29)])].
1.03/1.34	75 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | plus(A,p(A)) != plus(B,p(B)).  [back_rewrite(30),rewrite([68(11),68(13)])].
1.03/1.34	78 minus(A,B) != minus(C,D) | minus(D,minus(s(n),A)) = minus(C,minus(s(n),B)).  [para(21(a,1),40(a,1))].
1.03/1.34	85 le(minus(s(n),c1),n).  [resolve(44,a,33,a),unit_del(a,46)].
1.03/1.34	97 -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(52,a,28,b),flip(d),unit_del(a,85)].
1.03/1.34	98 -le(minus(s(n),c2),n) | -le(s(n0),minus(s(n),c2)) | p(minus(s(n),c2)) != p(minus(s(n),c1)).  [resolve(52,a,26,b),flip(d),unit_del(a,85)].
1.03/1.34	148 le(c1,c2).  [resolve(60,a,43,a)].
1.03/1.34	160 -le(A,c1) | le(A,c2).  [resolve(148,a,31,b)].
1.03/1.34	282 le(s(n0),c2).  [resolve(160,a,44,a)].
1.03/1.34	285 le(s(n0),minus(s(n),c2)).  [resolve(282,a,37,a),unit_del(a,45)].
1.03/1.34	286 le(minus(s(n),c2),n).  [resolve(282,a,33,a),unit_del(a,45)].
1.03/1.34	291 p(minus(s(n),c2)) != p(minus(s(n),c1)).  [back_unit_del(98),unit_del(a,286),unit_del(b,285)].
1.03/1.34	292 minus(p(minus(s(n),c2)),minus(s(n),c2)) != minus(p(minus(s(n),c1)),minus(s(n),c1)).  [back_unit_del(97),unit_del(a,286),unit_del(b,285)].
1.03/1.34	293 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1) | plus(c2,p(minus(s(n),c2))) = plus(c1,p(minus(s(n),c1))).  [back_unit_del(74),unit_del(c,291)].
1.03/1.34	434 plus(minus(s(n),c2),p(minus(s(n),c2))) != plus(minus(s(n),c1),p(minus(s(n),c1))).  [resolve(75,b,52,a),flip(d),unit_del(a,85),unit_del(b,286),unit_del(c,285)].
1.03/1.34	1379 minus(p(minus(s(n),c2)),p(minus(s(n),c1))) != minus(c1,c2).  [ur(78,b,292,a(flip)),flip(a)].
1.03/1.34	1407 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1).  [resolve(293,b,38,a),unit_del(b,1379)].
1.03/1.34	2218 minus(p(minus(s(n),c2)),p(minus(s(n),c1))) != minus(c2,c1).  [ur(39,a,434,a),rewrite([21(20)])].
1.03/1.34	2222 $F.  [ur(40,b,2218,a(flip)),rewrite([1407(14)]),xx(a)].
1.03/1.34	
1.03/1.34	% SZS output end Refutation
1.03/1.34	============================== end of proof ==========================
1.03/1.34	
1.03/1.34	============================== STATISTICS ============================
1.03/1.34	
1.03/1.34	Given=980. Generated=10131. Kept=2202. proofs=1.
1.03/1.34	Usable=974. Sos=1186. Demods=15. Limbo=2, Disabled=62. Hints=0.
1.03/1.34	Megabytes=2.18.
1.03/1.34	User_CPU=0.38, System_CPU=0.01, Wall_clock=0.
1.03/1.34	
1.03/1.34	============================== end of statistics =====================
1.03/1.34	
1.03/1.34	============================== end of search =========================
1.03/1.34	
1.03/1.34	THEOREM PROVED
1.03/1.34	% SZS status Theorem
1.03/1.34	
1.03/1.34	Exiting with 1 proof.
1.03/1.34	
1.03/1.34	Process 14209 exit (max_proofs) Mon Jul  3 06:33:32 2023
1.03/1.34	Prover9 interrupted
1.03/1.34	EOF