0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n007.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Tue Aug 9 01:46:42 EDT 2022 0.14/0.34 % CPUTime : 0.45/1.01 ============================== Prover9 =============================== 0.45/1.01 Prover9 (32) version 2009-11A, November 2009. 0.45/1.01 Process 3337 was started by sandbox on n007.cluster.edu, 0.45/1.01 Tue Aug 9 01:46:42 2022 0.45/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_3100_n007.cluster.edu". 0.45/1.01 ============================== end of head =========================== 0.45/1.01 0.45/1.01 ============================== INPUT ================================= 0.45/1.01 0.45/1.01 % Reading from file /tmp/Prover9_3100_n007.cluster.edu 0.45/1.01 0.45/1.01 set(prolog_style_variables). 0.45/1.01 set(auto2). 0.45/1.01 % set(auto2) -> set(auto). 0.45/1.01 % set(auto) -> set(auto_inference). 0.45/1.01 % set(auto) -> set(auto_setup). 0.45/1.01 % set(auto_setup) -> set(predicate_elim). 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.45/1.01 % set(auto) -> set(auto_limits). 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.45/1.01 % set(auto) -> set(auto_denials). 0.45/1.01 % set(auto) -> set(auto_process). 0.45/1.01 % set(auto2) -> assign(new_constants, 1). 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.45/1.01 % set(auto2) -> assign(max_hours, 1). 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.45/1.01 % set(auto2) -> assign(max_seconds, 0). 0.45/1.01 % set(auto2) -> assign(max_minutes, 5). 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.45/1.01 % set(auto2) -> set(sort_initial_sos). 0.45/1.01 % set(auto2) -> assign(sos_limit, -1). 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.45/1.01 % set(auto2) -> assign(max_megs, 400). 0.45/1.01 % set(auto2) -> assign(stats, some). 0.45/1.01 % set(auto2) -> clear(echo_input). 0.45/1.01 % set(auto2) -> set(quiet). 0.45/1.01 % set(auto2) -> clear(print_initial_clauses). 0.45/1.01 % set(auto2) -> clear(print_given). 0.45/1.01 assign(lrs_ticks,-1). 0.45/1.01 assign(sos_limit,10000). 0.45/1.01 assign(order,kbo). 0.45/1.01 set(lex_order_vars). 0.45/1.01 clear(print_given). 0.45/1.01 0.45/1.01 % formulas(sos). % not echoed (12 formulas) 0.45/1.01 0.45/1.01 ============================== end of input ========================== 0.45/1.01 0.45/1.01 % From the command line: assign(max_seconds, 960). 0.45/1.01 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.45/1.01 0.45/1.01 % Formulas that are not ordinary clauses: 0.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 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.45/1.01 10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.45/1.01 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.45/1.01 12 -(exists Y1 ((all Y2 (Y1 != Y2 | (all Y3 (-r1(Y3) | -r2(Y3,Y2))))) & (all Y4 (Y1 != Y4 | -r1(Y4))))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause). [assumption]. 0.93/1.20 0.93/1.20 ============================== end of process non-clausal formulas === 0.93/1.20 0.93/1.20 ============================== PROCESS INITIAL CLAUSES =============== 0.93/1.20 0.93/1.20 ============================== PREDICATE ELIMINATION ================= 0.93/1.20 13 -r4(A,B,C) | C = f10(A,B) # label(axiom_4) # label(axiom). [clausify(4)]. 0.93/1.20 14 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.93/1.20 15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom). [clausify(9)]. 0.93/1.20 16 r4(A,f4(A,B),f3(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.93/1.20 17 A != f10(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(4)]. 0.93/1.20 Derived: f5(A,B) = f10(A,B). [resolve(13,a,14,a)]. 0.93/1.20 Derived: f15(A) = f10(A,f16(A)). [resolve(13,a,15,a)]. 0.93/1.20 Derived: f3(A,B) = f10(A,f4(A,B)). [resolve(13,a,16,a)]. 0.93/1.20 18 -r3(A,B,C) | C = f14(A,B) # label(axiom_3) # label(axiom). [clausify(8)]. 0.93/1.20 19 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.93/1.20 20 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom). [clausify(11)]. 0.93/1.20 21 r3(f5(A,B),A,f2(A,B)) # label(axiom_2a) # label(axiom). [clausify(2)]. 0.93/1.20 22 r3(A,f8(A,B),f7(A,B)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.93/1.20 Derived: f9(A,B) = f14(A,B). [resolve(18,a,19,a)]. 0.93/1.20 Derived: f18(A) = f14(A,f19(A)). [resolve(18,a,20,a)]. 0.93/1.20 Derived: f2(A,B) = f14(f5(A,B),A). [resolve(18,a,21,a)]. 0.93/1.20 Derived: f7(A,B) = f14(A,f8(A,B)). [resolve(18,a,22,a)]. 0.93/1.20 23 A != f14(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(8)]. 0.93/1.20 0.93/1.20 ============================== end predicate elimination ============= 0.93/1.20 0.93/1.20 Auto_denials: (non-Horn, no changes). 0.93/1.20 0.93/1.20 Term ordering decisions: 0.93/1.20 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. 0.93/1.20 0.93/1.20 ============================== end of process initial clauses ======== 0.93/1.20 0.93/1.20 ============================== CLAUSES FOR SEARCH ==================== 0.93/1.20 0.93/1.20 ============================== end of clauses for search ============= 0.93/1.20 0.93/1.20 ============================== SEARCH ================================ 0.93/1.20 0.93/1.20 % Starting search at 0.01 seconds. 0.93/1.20 0.93/1.20 ============================== PROOF ================================= 0.93/1.20 % SZS status Theorem 0.93/1.20 % SZS output start Refutation 0.93/1.20 0.93/1.20 % Proof 1 at 0.19 (+ 0.00) seconds. 0.93/1.20 % Length of proof is 52. 0.93/1.20 % Level of proof is 11. 0.93/1.20 % Maximum clause weight is 12.000. 0.93/1.20 % Given clauses 293. 0.93/1.20 0.93/1.20 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.93/1.20 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.93/1.20 5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.93/1.20 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.93/1.20 10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.93/1.20 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.93/1.20 12 -(exists Y1 ((all Y2 (Y1 != Y2 | (all Y3 (-r1(Y3) | -r2(Y3,Y2))))) & (all Y4 (Y1 != Y4 | -r1(Y4))))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause). [assumption]. 0.93/1.20 26 r1(f19(A)) # label(axiom_4a) # label(axiom). [clausify(11)]. 0.93/1.20 27 f18(A) = A # label(axiom_4a) # label(axiom). [clausify(11)]. 0.93/1.20 29 r2(A,f8(B,A)) # label(axiom_1a) # label(axiom). [clausify(3)]. 0.93/1.20 31 r1(f21(A)) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 36 A = f20(A) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 37 f20(A) = A | r1(f22(A)). [copy(36),flip(a)]. 0.93/1.20 38 r1(f21(A)) | A = f22(A) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 39 r1(f21(A)) | f22(A) = A. [copy(38),flip(b)]. 0.93/1.20 42 A = f20(A) | A = f22(A) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 43 f20(A) = A | f22(A) = A. [copy(42),flip(a),flip(b)]. 0.93/1.20 44 r2(f21(A),f20(A)) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 46 r2(f21(A),f20(A)) | A = f22(A) # label(nonzerosnononesexist) # label(negated_conjecture). [clausify(12)]. 0.93/1.20 47 r2(f21(A),f20(A)) | f22(A) = A. [copy(46),flip(b)]. 0.93/1.20 48 -r1(A) | A != B | -r2(C,B) # label(axiom_7a) # label(axiom). [clausify(5)]. 0.93/1.20 49 -r1(A) | A = c1 # label(axiom_1) # label(axiom). [clausify(10)]. 0.93/1.20 50 -r1(A) | c1 = A. [copy(49),flip(b)]. 0.93/1.20 51 A != c1 | r1(A) # label(axiom_1) # label(axiom). [clausify(10)]. 0.93/1.20 52 c1 != A | r1(A). [copy(51),flip(a)]. 0.93/1.20 53 -r2(A,B) | B = f1(A) # label(axiom_2) # label(axiom). [clausify(1)]. 0.93/1.20 54 -r2(A,B) | f1(A) = B. [copy(53),flip(b)]. 0.93/1.20 57 A = B | -r2(B,C) | C != D | -r2(A,D) # label(axiom_3a) # label(axiom). [clausify(6)]. 0.93/1.20 75 f20(A) = A | r1(A). [para(43(b,1),37(b,1)),merge(b)]. 0.93/1.20 82 -r1(f8(A,B)). [ur(48,b,27,a,c,29,a),rewrite([27(2)])]. 0.93/1.20 84 f19(A) != f8(B,C). [ur(48,a,26,a,c,29,a)]. 0.93/1.20 90 f21(A) = c1 | f22(A) = A. [resolve(50,a,39,a),flip(a)]. 0.93/1.20 93 f22(A) = c1 | r1(f21(A)). [resolve(50,a,31,b),flip(a)]. 0.93/1.20 94 f19(A) = c1. [resolve(50,a,26,a),flip(a)]. 0.93/1.20 98 f8(A,B) != c1. [back_rewrite(84),rewrite([94(1)]),flip(a)]. 0.93/1.20 108 f8(A,B) = f1(B). [resolve(54,a,29,a),flip(a)]. 0.93/1.20 110 f1(A) != c1. [back_rewrite(98),rewrite([108(1)])]. 0.93/1.20 111 -r1(f1(A)). [back_rewrite(82),rewrite([108(1)])]. 0.93/1.20 114 r2(A,f1(A)). [back_rewrite(29),rewrite([108(1)])]. 0.93/1.20 136 f20(f1(A)) = f1(A). [resolve(75,b,111,a)]. 0.93/1.20 153 -r2(c1,f1(f1(A))). [ur(57,a,110,a,c,27,a,d,114,a),rewrite([27(4)])]. 0.93/1.20 185 r2(f21(f1(A)),f1(A)) | r1(f22(f1(A))). [para(136(a,1),44(a,2))]. 0.93/1.20 186 r2(f21(f1(A)),f1(A)) | f22(f1(A)) = f1(A). [para(136(a,1),47(a,2))]. 0.93/1.20 191 f22(A) = c1 | f21(A) = c1. [resolve(93,b,50,a),flip(b)]. 0.93/1.20 341 f21(A) = c1 | r1(f22(A)). [resolve(191,a,52,a(flip))]. 0.93/1.20 349 f21(A) = c1 | r1(A). [para(90(b,1),341(b,1)),merge(b)]. 0.93/1.20 355 f21(f1(A)) = c1. [resolve(349,b,111,a)]. 0.93/1.20 364 r2(c1,f1(A)) | f22(f1(A)) = f1(A). [back_rewrite(186),rewrite([355(2)])]. 0.93/1.20 365 r2(c1,f1(A)) | r1(f22(f1(A))). [back_rewrite(185),rewrite([355(2)])]. 0.93/1.20 419 r1(f22(f1(f1(A)))). [resolve(365,a,153,a)]. 0.93/1.20 447 f22(f1(f1(A))) = c1. [resolve(419,a,50,a),flip(a)]. 0.93/1.20 1177 $F. [resolve(364,a,153,a),rewrite([447(3)]),flip(a),unit_del(a,110)]. 0.93/1.20 0.93/1.20 % SZS output end Refutation 0.93/1.20 ============================== end of proof ========================== 0.93/1.20 0.93/1.20 ============================== STATISTICS ============================ 0.93/1.20 0.93/1.20 Given=293. Generated=6547. Kept=1141. proofs=1. 0.93/1.20 Usable=273. Sos=778. Demods=38. Limbo=4, Disabled=130. Hints=0. 0.93/1.20 Megabytes=1.17. 0.93/1.20 User_CPU=0.19, System_CPU=0.00, Wall_clock=0. 0.93/1.20 0.93/1.20 ============================== end of statistics ===================== 0.93/1.20 0.93/1.20 ============================== end of search ========================= 0.93/1.20 0.93/1.20 THEOREM PROVED 0.93/1.20 % SZS status Theorem 0.93/1.20 0.93/1.20 Exiting with 1 proof. 0.93/1.20 0.93/1.20 Process 3337 exit (max_proofs) Tue Aug 9 01:46:42 2022 0.93/1.20 Prover9 interrupted 0.93/1.20 EOF