0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n016.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 02:25:42 EDT 2022 0.12/0.33 % CPUTime : 0.42/0.99 ============================== Prover9 =============================== 0.42/0.99 Prover9 (32) version 2009-11A, November 2009. 0.42/0.99 Process 1795 was started by sandbox on n016.cluster.edu, 0.42/0.99 Tue Aug 9 02:25:42 2022 0.42/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_1626_n016.cluster.edu". 0.42/0.99 ============================== end of head =========================== 0.42/0.99 0.42/0.99 ============================== INPUT ================================= 0.42/0.99 0.42/0.99 % Reading from file /tmp/Prover9_1626_n016.cluster.edu 0.42/0.99 0.42/0.99 set(prolog_style_variables). 0.42/0.99 set(auto2). 0.42/0.99 % set(auto2) -> set(auto). 0.42/0.99 % set(auto) -> set(auto_inference). 0.42/0.99 % set(auto) -> set(auto_setup). 0.42/0.99 % set(auto_setup) -> set(predicate_elim). 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.42/0.99 % set(auto) -> set(auto_limits). 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.42/0.99 % set(auto) -> set(auto_denials). 0.42/0.99 % set(auto) -> set(auto_process). 0.42/0.99 % set(auto2) -> assign(new_constants, 1). 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.42/0.99 % set(auto2) -> assign(max_hours, 1). 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.42/0.99 % set(auto2) -> assign(max_seconds, 0). 0.42/0.99 % set(auto2) -> assign(max_minutes, 5). 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.42/0.99 % set(auto2) -> set(sort_initial_sos). 0.42/0.99 % set(auto2) -> assign(sos_limit, -1). 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.42/0.99 % set(auto2) -> assign(max_megs, 400). 0.42/0.99 % set(auto2) -> assign(stats, some). 0.42/0.99 % set(auto2) -> clear(echo_input). 0.42/0.99 % set(auto2) -> set(quiet). 0.42/0.99 % set(auto2) -> clear(print_initial_clauses). 0.42/0.99 % set(auto2) -> clear(print_given). 0.42/0.99 assign(lrs_ticks,-1). 0.42/0.99 assign(sos_limit,10000). 0.42/0.99 assign(order,kbo). 0.42/0.99 set(lex_order_vars). 0.42/0.99 clear(print_given). 0.42/0.99 0.42/0.99 % formulas(sos). % not echoed (12 formulas) 0.42/0.99 0.42/0.99 ============================== end of input ========================== 0.42/0.99 0.42/0.99 % From the command line: assign(max_seconds, 960). 0.42/0.99 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.42/0.99 0.42/0.99 % Formulas that are not ordinary clauses: 0.42/0.99 1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y2 = Y3)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 4 (all X16 all X17 exists Y23 all X18 (X18 != Y23 & -r4(X16,X17,X18) | Y23 = X18 & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 6 (all X3 all X10 (X10 = X3 | (all Y12 ((all Y13 (-r2(X3,Y13) | Y12 != Y13)) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 7 (all X6 ((exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 8 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 9 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y18 = Y8)))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.99 12 -(exists Y1 ((all Y5 (-r1(Y5) | Y5 != Y1)) & (all Y2 ((all Y3 (-r2(Y3,Y2) | (all Y4 (-r1(Y4) | -r2(Y4,Y3))))) | Y1 != Y2)))) # label(nonzerononetwoexist) # label(negated_conjecture) # label(non_clause). [assumption]. 0.73/1.04 0.73/1.04 ============================== end of process non-clausal formulas === 0.73/1.04 0.73/1.04 ============================== PROCESS INITIAL CLAUSES =============== 0.73/1.04 0.73/1.04 ============================== PREDICATE ELIMINATION ================= 0.73/1.04 13 -r4(A,B,C) | C = f10(A,B) # label(axiom_4) # label(axiom). [clausify(4)]. 0.73/1.04 14 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.73/1.04 15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom). [clausify(9)]. 0.73/1.04 16 r4(A,f4(A,B),f3(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.73/1.04 17 A != f10(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(4)]. 0.73/1.04 Derived: f5(A,B) = f10(A,B). [resolve(13,a,14,a)]. 0.73/1.04 Derived: f15(A) = f10(A,f16(A)). [resolve(13,a,15,a)]. 0.73/1.04 Derived: f3(A,B) = f10(A,f4(A,B)). [resolve(13,a,16,a)]. 0.73/1.04 18 -r3(A,B,C) | C = f14(A,B) # label(axiom_3) # label(axiom). [clausify(8)]. 0.73/1.04 19 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.73/1.04 20 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom). [clausify(11)]. 0.73/1.04 21 r3(f5(A,B),A,f2(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.73/1.04 22 r3(A,f8(A,B),f7(A,B)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.73/1.04 Derived: f9(A,B) = f14(A,B). [resolve(18,a,19,a)]. 0.73/1.04 Derived: f18(A) = f14(A,f19(A)). [resolve(18,a,20,a)]. 0.73/1.04 Derived: f2(A,B) = f14(f5(A,B),A). [resolve(18,a,21,a)]. 0.73/1.04 Derived: f7(A,B) = f14(A,f8(A,B)). [resolve(18,a,22,a)]. 0.73/1.04 23 A != f14(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(8)]. 0.73/1.04 0.73/1.04 ============================== end predicate elimination ============= 0.73/1.04 0.73/1.04 Auto_denials: (non-Horn, no changes). 0.73/1.04 0.73/1.04 Term ordering decisions: 0.73/1.04 Function symbol KB weights: c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f14=1. f1=1. f11=1. f12=1. f13=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. 0.73/1.04 0.73/1.04 ============================== end of process initial clauses ======== 0.73/1.04 0.73/1.04 ============================== CLAUSES FOR SEARCH ==================== 0.73/1.04 0.73/1.04 ============================== end of clauses for search ============= 0.73/1.04 0.73/1.04 ============================== SEARCH ================================ 0.73/1.04 0.73/1.04 % Starting search at 0.01 seconds. 0.73/1.04 0.73/1.04 ============================== PROOF ================================= 0.73/1.04 % SZS status Theorem 0.73/1.04 % SZS output start Refutation 0.73/1.04 0.73/1.04 % Proof 1 at 0.06 (+ 0.01) seconds. 0.73/1.04 % Length of proof is 54. 0.73/1.04 % Level of proof is 12. 0.73/1.04 % Maximum clause weight is 12.000. 0.73/1.04 % Given clauses 178. 0.73/1.04 0.73/1.04 1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 6 (all X3 all X10 (X10 = X3 | (all Y12 ((all Y13 (-r2(X3,Y13) | Y12 != Y13)) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 12 -(exists Y1 ((all Y5 (-r1(Y5) | Y5 != Y1)) & (all Y2 ((all Y3 (-r2(Y3,Y2) | (all Y4 (-r1(Y4) | -r2(Y4,Y3))))) | Y1 != Y2)))) # label(nonzerononetwoexist) # label(negated_conjecture) # label(non_clause). [assumption]. 0.73/1.04 26 r1(f19(A)) # label(axiom_4a) # label(axiom). [clausify(11)]. 0.73/1.04 27 f18(A) = A # label(axiom_4a) # label(axiom). [clausify(11)]. 0.73/1.04 29 r2(A,f8(B,A)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.73/1.04 31 r1(f20(A)) | r1(f23(A)) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 36 r1(f20(A)) | A = f21(A) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 37 r1(f20(A)) | f21(A) = A. [copy(36),flip(b)]. 0.73/1.04 42 r1(f20(A)) | r2(f22(A),f21(A)) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 43 r1(f20(A)) | r2(f23(A),f22(A)) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 44 A = f20(A) | A = f21(A) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 45 f20(A) = A | f21(A) = A. [copy(44),flip(a),flip(b)]. 0.73/1.04 47 A = f20(A) | r2(f22(A),f21(A)) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 48 f20(A) = A | r2(f22(A),f21(A)). [copy(47),flip(a)]. 0.73/1.04 49 A = f20(A) | r2(f23(A),f22(A)) # label(nonzerononetwoexist) # label(negated_conjecture). [clausify(12)]. 0.73/1.04 50 f20(A) = A | r2(f23(A),f22(A)). [copy(49),flip(a)]. 0.73/1.04 51 -r1(A) | A != B | -r2(C,B) # label(axiom_7a) # label(axiom). [clausify(5)]. 0.73/1.04 52 -r1(A) | A = c1 # label(axiom_1) # label(axiom). [clausify(10)]. 0.73/1.04 53 -r1(A) | c1 = A. [copy(52),flip(b)]. 0.73/1.04 56 -r2(A,B) | B = f1(A) # label(axiom_2) # label(axiom). [clausify(1)]. 0.73/1.04 57 -r2(A,B) | f1(A) = B. [copy(56),flip(b)]. 0.73/1.04 60 A = B | -r2(B,C) | C != D | -r2(A,D) # label(axiom_3a) # label(axiom). [clausify(6)]. 0.73/1.04 78 f20(A) = A | r2(f22(A),A). [para(45(b,1),48(b,2)),merge(b)]. 0.73/1.04 85 -r1(A) | f8(B,C) != A. [resolve(51,c,29,a),flip(b)]. 0.73/1.04 87 -r1(f8(A,B)). [ur(51,b,27,a,c,29,a),rewrite([27(2)])]. 0.73/1.04 89 f19(A) != f8(B,C). [ur(51,a,26,a,c,29,a)]. 0.73/1.04 98 f23(A) = c1 | r1(f20(A)). [resolve(53,a,31,b),flip(a)]. 0.73/1.04 99 f19(A) = c1. [resolve(53,a,26,a),flip(a)]. 0.73/1.04 103 f8(A,B) != c1. [back_rewrite(89),rewrite([99(1)]),flip(a)]. 0.73/1.04 110 f1(f23(A)) = f22(A) | f20(A) = A. [resolve(57,a,50,b)]. 0.73/1.04 113 f1(f23(A)) = f22(A) | r1(f20(A)). [resolve(57,a,43,b)]. 0.73/1.04 114 f1(f22(A)) = f21(A) | r1(f20(A)). [resolve(57,a,42,b)]. 0.73/1.04 116 f8(A,B) = f1(B). [resolve(57,a,29,a),flip(a)]. 0.73/1.04 118 f1(A) != c1. [back_rewrite(103),rewrite([116(1)])]. 0.73/1.04 119 -r1(f1(A)). [back_rewrite(87),rewrite([116(1)])]. 0.73/1.04 120 -r1(A) | f1(B) != A. [back_rewrite(85),rewrite([116(2)])]. 0.73/1.04 122 r2(A,f1(A)). [back_rewrite(29),rewrite([116(1)])]. 0.73/1.04 148 f20(A) = A | f1(f22(A)) = A. [resolve(78,b,57,a)]. 0.73/1.04 152 f20(A) != f1(B) | f21(A) = A. [resolve(120,a,37,a),flip(a)]. 0.73/1.04 163 -r2(c1,f1(f1(A))). [ur(60,a,118,a,c,27,a,d,122,a),rewrite([27(4)])]. 0.73/1.04 167 f1(f1(A)) != f1(c1). [ur(60,a,118,a,b,122,a,d,122,a),flip(a)]. 0.73/1.04 195 f23(A) = c1 | f20(A) != f1(B). [resolve(98,b,120,a),flip(b)]. 0.73/1.04 275 f20(A) = A | -r2(c1,f1(f22(A))). [para(110(a,1),163(a,2,1))]. 0.73/1.04 650 f20(A) = A | -r2(c1,A). [para(148(b,1),275(b,2)),merge(b)]. 0.73/1.04 653 f20(f1(c1)) = f1(c1). [resolve(650,b,122,a)]. 0.73/1.04 654 f23(f1(c1)) = c1. [resolve(653,a,195,b)]. 0.73/1.04 655 f21(f1(c1)) = f1(c1). [resolve(653,a,152,a)]. 0.73/1.04 656 f22(f1(c1)) = f1(c1). [para(653(a,1),113(b,1)),rewrite([654(3)]),flip(a),unit_del(b,119)]. 0.73/1.04 657 $F. [para(653(a,1),114(b,1)),rewrite([656(3),655(6)]),unit_del(a,167),unit_del(b,119)]. 0.73/1.04 0.73/1.04 % SZS output end Refutation 0.73/1.04 ============================== end of proof ========================== 0.73/1.04 0.73/1.04 ============================== STATISTICS ============================ 0.73/1.04 0.73/1.04 Given=178. Generated=2528. Kept=620. proofs=1. 0.73/1.04 Usable=163. Sos=395. Demods=36. Limbo=3, Disabled=105. Hints=0. 0.73/1.04 Megabytes=0.66. 0.73/1.04 User_CPU=0.06, System_CPU=0.01, Wall_clock=0. 0.73/1.04 0.73/1.04 ============================== end of statistics ===================== 0.73/1.04 0.73/1.04 ============================== end of search ========================= 0.73/1.04 0.73/1.04 THEOREM PROVED 0.73/1.04 % SZS status Theorem 0.73/1.04 0.73/1.04 Exiting with 1 proof. 0.73/1.04 0.73/1.04 Process 1795 exit (max_proofs) Tue Aug 9 02:25:42 2022 0.73/1.04 Prover9 interrupted 0.73/1.04 EOF