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