0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n026.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	% DateTime   : Thu Jul  2 07:48:54 EDT 2020
0.13/0.34	% CPUTime    : 
0.44/1.02	============================== Prover9 ===============================
0.44/1.02	Prover9 (32) version 2009-11A, November 2009.
0.44/1.02	Process 26866 was started by sandbox2 on n026.cluster.edu,
0.44/1.02	Thu Jul  2 07:48:55 2020
0.44/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_26713_n026.cluster.edu".
0.44/1.02	============================== end of head ===========================
0.44/1.02	
0.44/1.02	============================== INPUT =================================
0.44/1.02	
0.44/1.02	% Reading from file /tmp/Prover9_26713_n026.cluster.edu
0.44/1.02	
0.44/1.02	set(prolog_style_variables).
0.44/1.02	set(auto2).
0.44/1.02	    % set(auto2) -> set(auto).
0.44/1.02	    % set(auto) -> set(auto_inference).
0.44/1.02	    % set(auto) -> set(auto_setup).
0.44/1.02	    % set(auto_setup) -> set(predicate_elim).
0.44/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.02	    % set(auto) -> set(auto_limits).
0.44/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.02	    % set(auto) -> set(auto_denials).
0.44/1.02	    % set(auto) -> set(auto_process).
0.44/1.02	    % set(auto2) -> assign(new_constants, 1).
0.44/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.02	    % set(auto2) -> assign(max_hours, 1).
0.44/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.02	    % set(auto2) -> set(sort_initial_sos).
0.44/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.02	    % set(auto2) -> assign(max_megs, 400).
0.44/1.02	    % set(auto2) -> assign(stats, some).
0.44/1.02	    % set(auto2) -> clear(echo_input).
0.44/1.02	    % set(auto2) -> set(quiet).
0.44/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.02	    % set(auto2) -> clear(print_given).
0.44/1.02	assign(lrs_ticks,-1).
0.44/1.02	assign(sos_limit,10000).
0.44/1.02	assign(order,kbo).
0.44/1.02	set(lex_order_vars).
0.44/1.02	clear(print_given).
0.44/1.02	
0.44/1.02	% formulas(sos).  % not echoed (10 formulas)
0.44/1.02	
0.44/1.02	============================== end of input ==========================
0.44/1.02	
0.44/1.02	% From the command line: assign(max_seconds, 960).
0.44/1.02	
0.44/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.02	
0.44/1.02	% Formulas that are not ordinary clauses:
0.44/1.02	1 (all I all J (le(s(n0),I) & le(s(I),J) & le(J,n) & (le(s(I),J) <-> le(s(perm(J)),perm(I))) & le(I,n) -> minus(q(J),J) != minus(q(I),I) & plus(q(I),I) != plus(q(J),J) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	2 (all I (le(s(n0),I) & le(I,n) -> le(perm(I),n) & le(s(n0),perm(I)))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	3 queens_p -> (all I all J (le(I,n) & le(J,n) & le(s(I),J) & le(s(n0),I) -> plus(p(I),I) != plus(p(J),J) & minus(p(I),I) != minus(p(J),J) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	4 (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.44/1.02	5 (all I all J all K all L (minus(I,K) = minus(L,J) <-> plus(I,J) = plus(K,L))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	6 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	7 (all I perm(I) = minus(s(n),I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	8 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	9 (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.44/1.02	10 -(queens_p & (all I q(I) = p(perm(I))) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.02	
0.44/1.02	============================== end of process non-clausal formulas ===
0.44/1.02	
0.44/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.02	
0.44/1.02	============================== PREDICATE ELIMINATION =================
0.44/1.02	
0.44/1.02	============================== end predicate elimination =============
0.44/1.02	
0.44/1.02	Auto_denials:  (non-Horn, no changes).
0.44/1.02	
0.44/1.02	Term ordering decisions:
0.44/1.02	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.12/1.45	
1.12/1.45	============================== end of process initial clauses ========
1.12/1.45	
1.12/1.45	============================== CLAUSES FOR SEARCH ====================
1.12/1.45	
1.12/1.45	============================== end of clauses for search =============
1.12/1.45	
1.12/1.45	============================== SEARCH ================================
1.12/1.45	
1.12/1.45	% Starting search at 0.02 seconds.
1.12/1.45	
1.12/1.45	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 43 (0.00 of 0.18 sec).
1.12/1.45	
1.12/1.45	============================== PROOF =================================
1.12/1.45	% SZS status Theorem
1.12/1.45	% SZS output start Refutation
1.12/1.45	
1.12/1.45	% Proof 1 at 0.44 (+ 0.01) seconds.
1.12/1.45	% Length of proof is 70.
1.12/1.45	% Level of proof is 10.
1.12/1.45	% Maximum clause weight is 42.000.
1.12/1.45	% Given clauses 997.
1.12/1.45	
1.12/1.45	1 (all I all J (le(s(n0),I) & le(s(I),J) & le(J,n) & (le(s(I),J) <-> le(s(perm(J)),perm(I))) & le(I,n) -> minus(q(J),J) != minus(q(I),I) & plus(q(I),I) != plus(q(J),J) & q(I) != q(J))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	2 (all I (le(s(n0),I) & le(I,n) -> le(perm(I),n) & le(s(n0),perm(I)))) # label(permutation_range) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	3 queens_p -> (all I all J (le(I,n) & le(J,n) & le(s(I),J) & le(s(n0),I) -> plus(p(I),I) != plus(p(J),J) & minus(p(I),I) != minus(p(J),J) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	4 (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.12/1.45	5 (all I all J all K all L (minus(I,K) = minus(L,J) <-> plus(I,J) = plus(K,L))) # label(plus1) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	6 (all J all I minus(perm(J),perm(I)) = minus(I,J)) # label(permutation_another_one) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	7 (all I perm(I) = minus(s(n),I)) # label(permutation) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	8 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause).  [assumption].
1.12/1.45	9 (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.12/1.45	10 -(queens_p & (all I q(I) = p(perm(I))) -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause).  [assumption].
1.12/1.45	11 queens_p # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.12/1.45	12 le(c2,n) | queens_q # label(queens_q) # label(axiom).  [clausify(1)].
1.12/1.45	13 le(c1,n) | queens_q # label(queens_q) # label(axiom).  [clausify(1)].
1.12/1.45	14 le(A,s(A)) # label(succ_le) # label(axiom).  [clausify(8)].
1.12/1.45	15 le(s(n0),c1) | queens_q # label(queens_q) # label(axiom).  [clausify(1)].
1.12/1.45	16 le(s(c1),c2) | queens_q # label(queens_q) # label(axiom).  [clausify(1)].
1.12/1.45	17 p(perm(A)) = q(A) # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.12/1.45	18 q(A) = p(perm(A)).  [copy(17),flip(a)].
1.12/1.45	19 minus(s(n),A) = perm(A) # label(permutation) # label(axiom).  [clausify(7)].
1.12/1.45	20 perm(A) = minus(s(n),A).  [copy(19),flip(a)].
1.12/1.45	21 minus(perm(A),perm(B)) = minus(B,A) # label(permutation_another_one) # label(axiom).  [clausify(6)].
1.12/1.45	22 minus(minus(s(n),A),minus(s(n),B)) = minus(B,A).  [copy(21),rewrite([20(1),20(4)])].
1.12/1.45	23 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(1)].
1.12/1.45	24 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(23),rewrite([18(2),20(2),18(9),20(9),18(17),20(17),18(24),20(24),18(32),20(32),18(37),20(37)])].
1.12/1.45	25 -queens_q # label(queens_sym) # label(negated_conjecture).  [clausify(10)].
1.12/1.45	26 -queens_p | -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | p(B) != p(A) # label(queens_p) # label(axiom).  [clausify(3)].
1.12/1.45	27 -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | p(B) != p(A).  [copy(26),unit_del(a,11)].
1.12/1.45	28 -queens_p | -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | plus(p(B),B) != plus(p(A),A) # label(queens_p) # label(axiom).  [clausify(3)].
1.12/1.45	29 -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | plus(p(B),B) != plus(p(A),A).  [copy(28),unit_del(a,11)].
1.12/1.45	30 -queens_p | -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | minus(p(B),B) != minus(p(A),A) # label(queens_p) # label(axiom).  [clausify(3)].
1.12/1.45	31 -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | minus(p(B),B) != minus(p(A),A).  [copy(30),unit_del(a,11)].
1.12/1.45	32 -le(A,B) | -le(B,C) | le(A,C) # label(le_trans) # label(axiom).  [clausify(4)].
1.12/1.45	33 -le(s(c1),c2) | le(s(perm(c2)),perm(c1)) | queens_q # label(queens_q) # label(axiom).  [clausify(1)].
1.12/1.45	34 -le(s(c1),c2) | le(s(minus(s(n),c2)),minus(s(n),c1)).  [copy(33),rewrite([20(6),20(11)]),unit_del(c,25)].
1.12/1.45	35 -le(s(n0),A) | -le(A,n) | le(perm(A),n) # label(permutation_range) # label(axiom).  [clausify(2)].
1.12/1.45	36 -le(s(n0),A) | -le(A,n) | le(minus(s(n),A),n).  [copy(35),rewrite([20(6)])].
1.12/1.45	37 -le(s(n0),A) | -le(A,n) | le(s(n0),perm(A)) # label(permutation_range) # label(axiom).  [clausify(2)].
1.12/1.45	38 -le(s(n0),A) | -le(A,n) | le(s(n0),minus(s(n),A)).  [copy(37),rewrite([20(8)])].
1.12/1.45	39 minus(A,B) != minus(C,D) | plus(D,A) = plus(C,B) # label(plus1) # label(axiom).  [clausify(5)].
1.12/1.45	40 minus(A,B) = minus(C,D) | plus(D,A) != plus(C,B) # label(plus1) # label(axiom).  [clausify(5)].
1.12/1.45	41 minus(A,B) != minus(C,D) | minus(D,B) = minus(C,A) # label(minus1) # label(axiom).  [clausify(9)].
1.12/1.45	43 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(24),unit_del(d,25)].
1.12/1.45	44 le(s(c1),c2).  [back_unit_del(16),unit_del(b,25)].
1.12/1.45	45 le(s(n0),c1).  [back_unit_del(15),unit_del(b,25)].
1.12/1.45	46 le(c1,n).  [back_unit_del(13),unit_del(b,25)].
1.12/1.45	47 le(c2,n).  [back_unit_del(12),unit_del(b,25)].
1.12/1.45	53 le(s(minus(s(n),c2)),minus(s(n),c1)).  [back_unit_del(34),unit_del(a,44)].
1.12/1.45	61 -le(s(A),B) | le(A,B).  [resolve(32,a,14,a)].
1.12/1.45	67 plus(A,B) = plus(B,A).  [xx_res(39,a)].
1.12/1.45	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(43),rewrite([67(22),67(29)])].
1.12/1.45	75 minus(A,B) = minus(C,D) | plus(A,D) != plus(B,C).  [back_rewrite(40),rewrite([67(4),67(5)])].
1.12/1.45	76 minus(A,B) != minus(C,D) | plus(A,D) = plus(B,C).  [back_rewrite(39),rewrite([67(4),67(5)])].
1.12/1.45	77 -le(A,n) | -le(B,n) | -le(s(A),B) | -le(s(n0),A) | plus(B,p(B)) != plus(A,p(A)).  [back_rewrite(29),rewrite([67(11),67(13)])].
1.12/1.45	81 minus(A,B) != minus(C,D) | minus(D,minus(s(n),A)) = minus(C,minus(s(n),B)).  [para(22(a,1),41(a,1))].
1.12/1.45	88 le(minus(s(n),c1),n).  [resolve(45,a,36,a),unit_del(a,46)].
1.12/1.45	100 -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(53,a,31,c),flip(d),unit_del(b,88)].
1.12/1.45	101 -le(minus(s(n),c2),n) | -le(s(n0),minus(s(n),c2)) | p(minus(s(n),c2)) != p(minus(s(n),c1)).  [resolve(53,a,27,c),flip(d),unit_del(b,88)].
1.12/1.45	148 le(c1,c2).  [resolve(61,a,44,a)].
1.12/1.45	160 -le(A,c1) | le(A,c2).  [resolve(148,a,32,b)].
1.12/1.45	277 le(s(n0),c2).  [resolve(160,a,45,a)].
1.12/1.45	280 le(s(n0),minus(s(n),c2)).  [resolve(277,a,38,a),unit_del(a,47)].
1.12/1.45	281 le(minus(s(n),c2),n).  [resolve(277,a,36,a),unit_del(a,47)].
1.12/1.45	286 p(minus(s(n),c2)) != p(minus(s(n),c1)).  [back_unit_del(101),unit_del(a,281),unit_del(b,280)].
1.12/1.45	287 minus(p(minus(s(n),c2)),minus(s(n),c2)) != minus(p(minus(s(n),c1)),minus(s(n),c1)).  [back_unit_del(100),unit_del(a,281),unit_del(b,280)].
1.12/1.45	288 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,286)].
1.12/1.45	450 plus(minus(s(n),c2),p(minus(s(n),c2))) != plus(minus(s(n),c1),p(minus(s(n),c1))).  [resolve(77,c,53,a),flip(d),unit_del(a,281),unit_del(b,88),unit_del(c,280)].
1.12/1.45	1330 minus(p(minus(s(n),c1)),p(minus(s(n),c2))) != minus(c2,c1).  [ur(81,b,287,a),flip(a)].
1.12/1.45	1353 minus(p(minus(s(n),c2)),c2) = minus(p(minus(s(n),c1)),c1).  [resolve(288,b,75,b),flip(b),unit_del(b,1330)].
1.12/1.45	2657 minus(p(minus(s(n),c1)),p(minus(s(n),c2))) != minus(c1,c2).  [ur(76,b,450,a),rewrite([22(9)]),flip(a)].
1.12/1.45	2679 $F.  [ur(41,b,2657,a(flip)),rewrite([1353(7)]),xx(a)].
1.12/1.45	
1.12/1.45	% SZS output end Refutation
1.12/1.45	============================== end of proof ==========================
1.12/1.45	
1.12/1.45	============================== STATISTICS ============================
1.12/1.45	
1.12/1.45	Given=997. Generated=12141. Kept=2658. proofs=1.
1.12/1.45	Usable=984. Sos=1579. Demods=19. Limbo=2, Disabled=115. Hints=0.
1.12/1.45	Megabytes=2.64.
1.12/1.45	User_CPU=0.44, System_CPU=0.01, Wall_clock=0.
1.12/1.45	
1.12/1.45	============================== end of statistics =====================
1.12/1.45	
1.12/1.45	============================== end of search =========================
1.12/1.45	
1.12/1.45	THEOREM PROVED
1.12/1.45	% SZS status Theorem
1.12/1.45	
1.12/1.45	Exiting with 1 proof.
1.12/1.45	
1.12/1.45	Process 26866 exit (max_proofs) Thu Jul  2 07:48:55 2020
1.12/1.45	Prover9 interrupted
1.12/1.46	EOF