0.00/0.03 % 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.23 % Computer : n156.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 05:02:39 CDT 2018 0.03/0.23 % CPUTime : 0.06/0.43 ============================== Prover9 =============================== 0.06/0.43 Prover9 (32) version 2009-11A, November 2009. 0.06/0.43 Process 62041 was started by sandbox on n156.star.cs.uiowa.edu, 0.06/0.43 Sat Jul 14 05:02:40 2018 0.06/0.43 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_62009_n156.star.cs.uiowa.edu". 0.06/0.43 ============================== end of head =========================== 0.06/0.43 0.06/0.43 ============================== INPUT ================================= 0.06/0.43 0.06/0.43 % Reading from file /tmp/Prover9_62009_n156.star.cs.uiowa.edu 0.06/0.43 0.06/0.43 set(prolog_style_variables). 0.06/0.43 set(auto2). 0.06/0.43 % set(auto2) -> set(auto). 0.06/0.43 % set(auto) -> set(auto_inference). 0.06/0.43 % set(auto) -> set(auto_setup). 0.06/0.43 % set(auto_setup) -> set(predicate_elim). 0.06/0.43 % set(auto_setup) -> assign(eq_defs, unfold). 0.06/0.43 % set(auto) -> set(auto_limits). 0.06/0.43 % set(auto_limits) -> assign(max_weight, "100.000"). 0.06/0.43 % set(auto_limits) -> assign(sos_limit, 20000). 0.06/0.43 % set(auto) -> set(auto_denials). 0.06/0.43 % set(auto) -> set(auto_process). 0.06/0.43 % set(auto2) -> assign(new_constants, 1). 0.06/0.43 % set(auto2) -> assign(fold_denial_max, 3). 0.06/0.43 % set(auto2) -> assign(max_weight, "200.000"). 0.06/0.43 % set(auto2) -> assign(max_hours, 1). 0.06/0.43 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.06/0.43 % set(auto2) -> assign(max_seconds, 0). 0.06/0.43 % set(auto2) -> assign(max_minutes, 5). 0.06/0.43 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.06/0.43 % set(auto2) -> set(sort_initial_sos). 0.06/0.43 % set(auto2) -> assign(sos_limit, -1). 0.06/0.43 % set(auto2) -> assign(lrs_ticks, 3000). 0.06/0.43 % set(auto2) -> assign(max_megs, 400). 0.06/0.43 % set(auto2) -> assign(stats, some). 0.06/0.43 % set(auto2) -> clear(echo_input). 0.06/0.43 % set(auto2) -> set(quiet). 0.06/0.43 % set(auto2) -> clear(print_initial_clauses). 0.06/0.43 % set(auto2) -> clear(print_given). 0.06/0.43 assign(lrs_ticks,-1). 0.06/0.43 assign(sos_limit,10000). 0.06/0.43 assign(order,kbo). 0.06/0.43 set(lex_order_vars). 0.06/0.43 clear(print_given). 0.06/0.43 0.06/0.43 % formulas(sos). % not echoed (10 formulas) 0.06/0.43 0.06/0.43 ============================== end of input ========================== 0.06/0.43 0.06/0.43 % From the command line: assign(max_seconds, 300). 0.06/0.43 0.06/0.43 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.06/0.43 0.06/0.43 % Formulas that are not ordinary clauses: 0.06/0.43 1 (all I all J (le(s(I),J) & le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(I,n) & le(s(n0),I) -> minus(q(I),I) != minus(q(J),J) & plus(q(I),I) != plus(q(J),J) & q(J) != q(I))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 2 (all I (le(s(n0),I) & le(I,n) -> minus(s(n),I) = perm(I))) # label(permutation) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 3 queens_p -> (all I all J (le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> minus(p(J),J) != minus(p(I),I) & plus(p(J),J) != plus(p(I),I) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 4 (all J all I minus(I,J) = minus(perm(J),perm(I))) # label(permutation_another_one) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 5 (all I (le(I,n) & le(s(n0),I) -> le(s(n0),perm(I)) & le(perm(I),n))) # label(permutation_range) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 6 (all I all J all K all L (minus(I,K) = minus(L,J) <-> plus(K,L) = plus(I,J))) # label(plus1) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 7 (all I all J all K all L (minus(I,K) = minus(J,L) <-> minus(I,J) = minus(K,L))) # label(minus1) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 8 (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.06/0.43 9 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause). [assumption]. 0.06/0.43 10 -((all I p(perm(I)) = q(I)) & queens_p -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause). [assumption]. 0.06/0.43 0.06/0.43 ============================== end of process non-clausal formulas === 0.06/0.43 0.06/0.43 ============================== PROCESS INITIAL CLAUSES =============== 0.06/0.43 0.06/0.43 ============================== PREDICATE ELIMINATION ================= 0.06/0.43 0.06/0.43 ============================== end predicate elimination ============= 0.06/0.43 0.06/0.43 Auto_denials: (non-Horn, no changes). 0.06/0.43 0.06/0.43 Term ordering decisions: 0.06/0.43 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.40/0.62 0.40/0.62 ============================== end of process initial clauses ======== 0.40/0.62 0.40/0.62 ============================== CLAUSES FOR SEARCH ==================== 0.40/0.62 0.40/0.62 ============================== end of clauses for search ============= 0.40/0.62 0.40/0.62 ============================== SEARCH ================================ 0.40/0.62 0.40/0.62 % Starting search at 0.01 seconds. 0.40/0.62 0.40/0.62 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 234 (0.00 of 0.11 sec). 0.40/0.62 0.40/0.62 ============================== PROOF ================================= 0.40/0.62 % SZS status Theorem 0.40/0.62 % SZS output start Refutation 0.40/0.62 0.40/0.62 % Proof 1 at 0.19 (+ 0.01) seconds. 0.40/0.62 % Length of proof is 67. 0.40/0.62 % Level of proof is 11. 0.40/0.62 % Maximum clause weight is 30.000. 0.40/0.62 % Given clauses 754. 0.40/0.62 0.40/0.62 1 (all I all J (le(s(I),J) & le(J,n) & (le(s(perm(J)),perm(I)) <-> le(s(I),J)) & le(I,n) & le(s(n0),I) -> minus(q(I),I) != minus(q(J),J) & plus(q(I),I) != plus(q(J),J) & q(J) != q(I))) -> queens_q # label(queens_q) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 3 queens_p -> (all I all J (le(J,n) & le(s(I),J) & le(I,n) & le(s(n0),I) -> minus(p(J),J) != minus(p(I),I) & plus(p(J),J) != plus(p(I),I) & p(J) != p(I))) # label(queens_p) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 4 (all J all I minus(I,J) = minus(perm(J),perm(I))) # label(permutation_another_one) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 5 (all I (le(I,n) & le(s(n0),I) -> le(s(n0),perm(I)) & le(perm(I),n))) # label(permutation_range) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 6 (all I all J all K all L (minus(I,K) = minus(L,J) <-> plus(K,L) = plus(I,J))) # label(plus1) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 7 (all I all J all K all L (minus(I,K) = minus(J,L) <-> minus(I,J) = minus(K,L))) # label(minus1) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 8 (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.40/0.62 9 (all X le(X,s(X))) # label(succ_le) # label(axiom) # label(non_clause). [assumption]. 0.40/0.62 10 -((all I p(perm(I)) = q(I)) & queens_p -> queens_q) # label(queens_sym) # label(negated_conjecture) # label(non_clause). [assumption]. 0.40/0.62 11 queens_p # label(queens_sym) # label(negated_conjecture). [clausify(10)]. 0.40/0.62 12 le(c2,n) | queens_q # label(queens_q) # label(axiom). [clausify(1)]. 0.40/0.62 13 le(c1,n) | queens_q # label(queens_q) # label(axiom). [clausify(1)]. 0.40/0.62 14 le(A,s(A)) # label(succ_le) # label(axiom). [clausify(9)]. 0.40/0.62 15 le(s(c1),c2) | queens_q # label(queens_q) # label(axiom). [clausify(1)]. 0.40/0.62 16 le(s(n0),c1) | queens_q # label(queens_q) # label(axiom). [clausify(1)]. 0.40/0.62 17 p(perm(A)) = q(A) # label(queens_sym) # label(negated_conjecture). [clausify(10)]. 0.40/0.62 18 q(A) = p(perm(A)). [copy(17),flip(a)]. 0.40/0.62 19 minus(perm(A),perm(B)) = minus(B,A) # label(permutation_another_one) # label(axiom). [clausify(4)]. 0.40/0.62 20 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)]. 0.40/0.62 21 minus(p(perm(c2)),c2) = minus(p(perm(c1)),c1) | plus(p(perm(c2)),c2) = plus(p(perm(c1)),c1) | p(perm(c2)) = p(perm(c1)) | queens_q. [copy(20),rewrite([18(2),18(7),18(13),18(18),18(24),18(27)])]. 0.40/0.62 22 -queens_q # label(queens_sym) # label(negated_conjecture). [clausify(10)]. 0.40/0.62 23 -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)]. 0.40/0.62 24 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | p(A) != p(B). [copy(23),unit_del(a,11)]. 0.40/0.62 25 -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)]. 0.40/0.62 26 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | minus(p(A),A) != minus(p(B),B). [copy(25),unit_del(a,11)]. 0.40/0.62 27 -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)]. 0.40/0.62 28 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | plus(p(A),A) != plus(p(B),B). [copy(27),unit_del(a,11)]. 0.40/0.62 29 -le(A,B) | -le(C,A) | le(C,B) # label(le_trans) # label(axiom). [clausify(8)]. 0.40/0.62 30 le(s(perm(c2)),perm(c1)) | -le(s(c1),c2) | queens_q # label(queens_q) # label(axiom). [clausify(1)]. 0.40/0.62 31 le(s(perm(c2)),perm(c1)) | -le(s(c1),c2). [copy(30),unit_del(c,22)]. 0.40/0.62 32 -le(A,n) | -le(s(n0),A) | le(perm(A),n) # label(permutation_range) # label(axiom). [clausify(5)]. 0.40/0.62 33 -le(A,n) | -le(s(n0),A) | le(s(n0),perm(A)) # label(permutation_range) # label(axiom). [clausify(5)]. 0.40/0.62 35 minus(A,B) != minus(C,D) | plus(D,A) = plus(C,B) # label(plus1) # label(axiom). [clausify(6)]. 0.40/0.62 36 minus(A,B) = minus(C,D) | plus(D,A) != plus(C,B) # label(plus1) # label(axiom). [clausify(6)]. 0.40/0.62 37 minus(A,B) != minus(C,D) | minus(D,B) = minus(C,A) # label(minus1) # label(axiom). [clausify(7)]. 0.40/0.62 38 minus(p(perm(c2)),c2) = minus(p(perm(c1)),c1) | plus(p(perm(c2)),c2) = plus(p(perm(c1)),c1) | p(perm(c2)) = p(perm(c1)). [back_unit_del(21),unit_del(d,22)]. 0.40/0.62 39 le(s(n0),c1). [back_unit_del(16),unit_del(b,22)]. 0.40/0.62 40 le(s(c1),c2). [back_unit_del(15),unit_del(b,22)]. 0.40/0.62 41 le(c1,n). [back_unit_del(13),unit_del(b,22)]. 0.40/0.62 42 le(c2,n). [back_unit_del(12),unit_del(b,22)]. 0.40/0.62 48 le(s(perm(c2)),perm(c1)). [back_unit_del(31),unit_del(b,40)]. 0.40/0.62 57 -le(s(A),B) | le(A,B). [resolve(29,b,14,a)]. 0.40/0.62 63 plus(A,B) = plus(B,A). [xx_res(35,a)]. 0.40/0.62 70 minus(p(perm(c2)),c2) = minus(p(perm(c1)),c1) | plus(c2,p(perm(c2))) = plus(c1,p(perm(c1))) | p(perm(c2)) = p(perm(c1)). [back_rewrite(38),rewrite([63(16),63(21)])]. 0.40/0.62 71 minus(A,B) = minus(C,D) | plus(A,D) != plus(B,C). [back_rewrite(36),rewrite([63(4),63(5)])]. 0.40/0.62 72 minus(A,B) != minus(C,D) | plus(A,D) = plus(B,C). [back_rewrite(35),rewrite([63(4),63(5)])]. 0.40/0.62 73 -le(A,n) | -le(s(B),A) | -le(B,n) | -le(s(n0),B) | plus(A,p(A)) != plus(B,p(B)). [back_rewrite(28),rewrite([63(11),63(13)])]. 0.40/0.62 74 minus(A,perm(B)) = minus(B,perm(A)). [resolve(37,a,19,a)]. 0.40/0.62 77 minus(A,B) != minus(C,D) | minus(A,perm(D)) = minus(B,perm(C)). [para(19(a,1),37(a,1)),rewrite([74(5),74(7)])]. 0.40/0.62 79 minus(A,perm(perm(B))) = minus(A,B). [back_rewrite(19),rewrite([74(3)])]. 0.40/0.62 82 le(perm(c1),n). [resolve(39,a,32,b),unit_del(a,41)]. 0.40/0.62 98 -le(perm(c2),n) | -le(s(n0),perm(c2)) | minus(c2,perm(p(perm(c2)))) != minus(c1,perm(p(perm(c1)))). [resolve(48,a,26,b),rewrite([74(19),74(25)]),flip(d),unit_del(a,82)]. 0.40/0.62 99 -le(perm(c2),n) | -le(s(n0),perm(c2)) | p(perm(c2)) != p(perm(c1)). [resolve(48,a,24,b),flip(d),unit_del(a,82)]. 0.40/0.62 213 le(c1,c2). [resolve(57,a,40,a)]. 0.40/0.62 225 -le(A,c1) | le(A,c2). [resolve(213,a,29,a)]. 0.40/0.62 368 le(s(n0),c2). [resolve(225,a,39,a)]. 0.40/0.62 381 le(s(n0),perm(c2)). [resolve(368,a,33,b),unit_del(a,42)]. 0.40/0.62 382 le(perm(c2),n). [resolve(368,a,32,b),unit_del(a,42)]. 0.40/0.62 387 p(perm(c2)) != p(perm(c1)). [back_unit_del(99),unit_del(a,382),unit_del(b,381)]. 0.40/0.62 388 minus(c2,perm(p(perm(c2)))) != minus(c1,perm(p(perm(c1)))). [back_unit_del(98),unit_del(a,382),unit_del(b,381)]. 0.40/0.62 389 minus(p(perm(c2)),c2) = minus(p(perm(c1)),c1) | plus(c2,p(perm(c2))) = plus(c1,p(perm(c1))). [back_unit_del(70),unit_del(c,387)]. 0.40/0.62 482 plus(perm(c2),p(perm(c2))) != plus(perm(c1),p(perm(c1))). [resolve(73,b,48,a),flip(d),unit_del(a,82),unit_del(b,382),unit_del(c,381)]. 0.40/0.62 1683 minus(p(perm(c1)),p(perm(c2))) != minus(c2,c1). [ur(77,b,388,a),flip(a)]. 0.40/0.62 1686 plus(c2,p(perm(c2))) != plus(c1,p(perm(c1))). [ur(71,a,1683,a),rewrite([63(5),63(10)]),flip(a)]. 0.40/0.62 1689 minus(p(perm(c2)),c2) = minus(p(perm(c1)),c1). [back_unit_del(389),unit_del(b,1686)]. 0.40/0.62 1703 minus(p(perm(c1)),p(perm(c2))) != minus(c1,c2). [ur(72,b,482,a),rewrite([74(5),79(5)]),flip(a)]. 0.40/0.62 1726 $F. [ur(37,b,1703,a(flip)),rewrite([1689(5)]),xx(a)]. 0.40/0.62 0.40/0.62 % SZS output end Refutation 0.40/0.62 ============================== end of proof ========================== 0.40/0.62 0.40/0.62 ============================== STATISTICS ============================ 0.40/0.62 0.40/0.62 Given=754. Generated=6099. Kept=1709. proofs=1. 0.40/0.62 Usable=748. Sos=923. Demods=20. Limbo=2, Disabled=58. Hints=0. 0.40/0.62 Megabytes=1.50. 0.40/0.62 User_CPU=0.19, System_CPU=0.01, Wall_clock=0. 0.40/0.62 0.40/0.62 ============================== end of statistics ===================== 0.40/0.62 0.40/0.62 ============================== end of search ========================= 0.40/0.62 0.40/0.62 THEOREM PROVED 0.40/0.62 % SZS status Theorem 0.40/0.62 0.40/0.62 Exiting with 1 proof. 0.40/0.62 0.40/0.62 Process 62041 exit (max_proofs) Sat Jul 14 05:02:40 2018 0.40/0.62 Prover9 interrupted 0.40/0.63 EOF