0.09/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n031.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % DateTime : Thu Jul 2 07:36:32 EDT 2020 0.09/0.30 % CPUTime : 0.76/1.13 ============================== Prover9 =============================== 0.76/1.13 Prover9 (32) version 2009-11A, November 2009. 0.76/1.13 Process 26318 was started by sandbox2 on n031.cluster.edu, 0.76/1.13 Thu Jul 2 07:36:33 2020 0.76/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_26165_n031.cluster.edu". 0.76/1.13 ============================== end of head =========================== 0.76/1.13 0.76/1.13 ============================== INPUT ================================= 0.76/1.13 0.76/1.13 % Reading from file /tmp/Prover9_26165_n031.cluster.edu 0.76/1.13 0.76/1.13 set(prolog_style_variables). 0.76/1.13 set(auto2). 0.76/1.13 % set(auto2) -> set(auto). 0.76/1.13 % set(auto) -> set(auto_inference). 0.76/1.13 % set(auto) -> set(auto_setup). 0.76/1.13 % set(auto_setup) -> set(predicate_elim). 0.76/1.13 % set(auto_setup) -> assign(eq_defs, unfold). 0.76/1.13 % set(auto) -> set(auto_limits). 0.76/1.13 % set(auto_limits) -> assign(max_weight, "100.000"). 0.76/1.13 % set(auto_limits) -> assign(sos_limit, 20000). 0.76/1.13 % set(auto) -> set(auto_denials). 0.76/1.13 % set(auto) -> set(auto_process). 0.76/1.13 % set(auto2) -> assign(new_constants, 1). 0.76/1.13 % set(auto2) -> assign(fold_denial_max, 3). 0.76/1.13 % set(auto2) -> assign(max_weight, "200.000"). 0.76/1.13 % set(auto2) -> assign(max_hours, 1). 0.76/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.76/1.13 % set(auto2) -> assign(max_seconds, 0). 0.76/1.13 % set(auto2) -> assign(max_minutes, 5). 0.76/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.76/1.13 % set(auto2) -> set(sort_initial_sos). 0.76/1.13 % set(auto2) -> assign(sos_limit, -1). 0.76/1.13 % set(auto2) -> assign(lrs_ticks, 3000). 0.76/1.13 % set(auto2) -> assign(max_megs, 400). 0.76/1.13 % set(auto2) -> assign(stats, some). 0.76/1.13 % set(auto2) -> clear(echo_input). 0.76/1.13 % set(auto2) -> set(quiet). 0.76/1.13 % set(auto2) -> clear(print_initial_clauses). 0.76/1.13 % set(auto2) -> clear(print_given). 0.76/1.13 assign(lrs_ticks,-1). 0.76/1.13 assign(sos_limit,10000). 0.76/1.13 assign(order,kbo). 0.76/1.13 set(lex_order_vars). 0.76/1.13 clear(print_given). 0.76/1.13 0.76/1.13 % formulas(sos). % not echoed (19 formulas) 0.76/1.13 0.76/1.13 ============================== end of input ========================== 0.76/1.13 0.76/1.13 % From the command line: assign(max_seconds, 960). 0.76/1.13 0.76/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.76/1.13 0.76/1.13 % Formulas that are not ordinary clauses: 0.76/1.13 1 (all X26 all X27 (-id(X26,X27) | -r1(X27) & -r1(X26) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 2 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & -id(X18,Y23) | r4(X16,X17,X18) & id(X18,Y23))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 3 (all X2 all X9 exists Y2 ((exists Y3 (id(Y3,Y2) & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))) & (exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 4 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X39,X42) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X40,X43) | -id(X38,X41))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 5 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 6 (all X6 ((exists Y19 (r1(Y19) & id(X6,Y19))) | (exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 7 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 8 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | -id(Y13,Y12))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 9 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 10 (all X28 all X29 all X30 all X31 (-r2(X30,X31) & -r2(X28,X29) | r2(X28,X29) & r2(X30,X31) | -id(X29,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 11 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & id(Y8,Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption]. 0.76/1.13 12 (all X11 exists Y21 all X12 (-id(X12,Y21) & -r2(X11,X12) | id(X12,Y21) & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 13 (all X32 all X33 all X34 all X35 all X36 all X37 (r3(X32,X33,X34) & r3(X35,X36,X37) | -r3(X35,X36,X37) & -r3(X32,X33,X34) | -id(X32,X35) | -id(X33,X36) | -id(X34,X37))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 14 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -id(X15,Y22) & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 16 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 17 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 18 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 19 -(all Y1 ((all Y5 (-id(Y1,Y5) | -r1(Y5))) | (all Y2 ((all Y3 (-r1(Y3) | -r3(Y3,Y2,Y1))) | (all Y4 (-r1(Y4) | -r2(Y4,Y2))))))) # label(zeroplusoneidzero) # label(negated_conjecture) # label(non_clause). [assumption]. 38.75/39.11 38.75/39.11 ============================== end of process non-clausal formulas === 38.75/39.11 38.75/39.11 ============================== PROCESS INITIAL CLAUSES =============== 38.75/39.11 38.75/39.11 ============================== PREDICATE ELIMINATION ================= 38.75/39.11 38.75/39.11 ============================== end predicate elimination ============= 38.75/39.11 38.75/39.11 Auto_denials: (non-Horn, no changes). 38.75/39.11 38.75/39.11 Term ordering decisions: 38.75/39.11 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f1=1. f2=1. f3=1. f4=1. f5=1. f13=1. f16=1. f17=1. f18=1. f19=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f14=1. f15=1. 38.75/39.11 38.75/39.11 ============================== end of process initial clauses ======== 38.75/39.11 38.75/39.11 ============================== CLAUSES FOR SEARCH ==================== 38.75/39.11 38.75/39.11 ============================== end of clauses for search ============= 38.75/39.11 38.75/39.11 ============================== SEARCH ================================ 38.75/39.11 38.75/39.11 % Starting search at 0.01 seconds. 38.75/39.11 38.75/39.11 Low Water (keep): wt=9.000, iters=3390 38.75/39.11 38.75/39.11 Low Water (keep): wt=8.000, iters=3429 38.75/39.11 38.75/39.11 Low Water (keep): wt=7.000, iters=3369 38.75/39.11 38.75/39.11 Low Water (displace): id=8568, wt=24.000 38.75/39.11 38.75/39.11 Low Water (displace): id=8574, wt=23.000 38.75/39.11 38.75/39.11 Low Water (displace): id=8869, wt=22.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9196, wt=21.000 38.75/39.11 38.75/39.11 Low Water (displace): id=8874, wt=20.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9433, wt=19.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9432, wt=18.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9447, wt=17.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9450, wt=16.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9456, wt=15.000 38.75/39.11 38.75/39.11 Low Water (displace): id=9461, wt=14.000 38.75/39.11 38.75/39.11 ============================== PROOF ================================= 38.75/39.11 % SZS status Theorem 38.75/39.11 % SZS output start Refutation 38.75/39.11 38.75/39.11 % Proof 1 at 36.01 (+ 1.93) seconds. 38.75/39.11 % Length of proof is 56. 38.75/39.11 % Level of proof is 7. 38.75/39.11 % Maximum clause weight is 17.000. 38.75/39.11 % Given clauses 1941. 38.75/39.11 38.75/39.11 1 (all X26 all X27 (-id(X26,X27) | -r1(X27) & -r1(X26) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 5 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 7 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 9 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 12 (all X11 exists Y21 all X12 (-id(X12,Y21) & -r2(X11,X12) | id(X12,Y21) & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 13 (all X32 all X33 all X34 all X35 all X36 all X37 (r3(X32,X33,X34) & r3(X35,X36,X37) | -r3(X35,X36,X37) & -r3(X32,X33,X34) | -id(X32,X35) | -id(X33,X36) | -id(X34,X37))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 14 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -id(X15,Y22) & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 16 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 18 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 38.75/39.11 19 -(all Y1 ((all Y5 (-id(Y1,Y5) | -r1(Y5))) | (all Y2 ((all Y3 (-r1(Y3) | -r3(Y3,Y2,Y1))) | (all Y4 (-r1(Y4) | -r2(Y4,Y2))))))) # label(zeroplusoneidzero) # label(negated_conjecture) # label(non_clause). [assumption]. 38.75/39.11 20 r1(c3) # label(zeroplusoneidzero) # label(negated_conjecture). [clausify(19)]. 38.75/39.11 21 r1(c5) # label(zeroplusoneidzero) # label(negated_conjecture). [clausify(19)]. 38.75/39.11 23 id(A,A) # label(axiom_5) # label(axiom). [clausify(7)]. 38.75/39.11 27 id(c2,c3) # label(zeroplusoneidzero) # label(negated_conjecture). [clausify(19)]. 38.75/39.11 28 r2(c6,c4) # label(zeroplusoneidzero) # label(negated_conjecture). [clausify(19)]. 38.75/39.11 30 r3(c5,c4,c2) # label(zeroplusoneidzero) # label(negated_conjecture). [clausify(19)]. 38.75/39.11 33 r2(A,f19(B,A)) # label(axiom_1a) # label(axiom). [clausify(18)]. 38.75/39.11 40 r2(f17(A,B),f16(A,B)) # label(axiom_1a) # label(axiom). [clausify(18)]. 38.75/39.11 41 id(f18(A,B),f16(A,B)) # label(axiom_1a) # label(axiom). [clausify(18)]. 38.75/39.11 46 r3(A,f19(A,B),f18(A,B)) # label(axiom_1a) # label(axiom). [clausify(18)]. 38.75/39.11 48 -id(A,B) | -r1(A) | -r2(C,B) # label(axiom_7a) # label(axiom). [clausify(9)]. 38.75/39.11 49 id(A,c1) | -r1(A) # label(axiom_1) # label(axiom). [clausify(5)]. 38.75/39.11 51 id(A,B) | -id(B,A) # label(axiom_6) # label(axiom). [clausify(15)]. 38.75/39.11 52 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom). [clausify(1)]. 38.75/39.11 53 -id(A,B) | -r1(A) | r1(B) # label(axiom_8) # label(axiom). [clausify(1)]. 38.75/39.11 54 -id(A,f12(B)) | r2(B,A) # label(axiom_2) # label(axiom). [clausify(12)]. 38.75/39.11 55 -r2(A,B) | id(B,f12(A)) # label(axiom_2) # label(axiom). [clausify(12)]. 38.75/39.11 58 id(A,f13(B,C)) | -r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(14)]. 38.75/39.11 60 -id(A,B) | id(C,B) | -id(C,A) # label(axiom_7) # label(axiom). [clausify(16)]. 38.75/39.11 67 r3(A,B,C) | -r3(D,E,F) | -id(D,A) | -id(E,B) | -id(F,C) # label(axiom_10) # label(axiom). [clausify(13)]. 38.75/39.11 135 id(c5,c1). [resolve(49,b,21,a)]. 38.75/39.11 136 id(c3,c1). [resolve(49,b,20,a)]. 38.75/39.11 151 r1(c2). [resolve(52,a,27,a),unit_del(a,20)]. 38.75/39.11 157 r2(A,f12(A)). [resolve(54,a,23,a)]. 38.75/39.11 160 id(f16(A,B),f12(f17(A,B))). [resolve(55,a,40,a)]. 38.75/39.11 161 id(f19(A,B),f12(B)). [resolve(55,a,33,a)]. 38.75/39.11 163 id(c4,f12(c6)). [resolve(55,a,28,a)]. 38.75/39.11 173 id(c2,f13(c5,c4)). [resolve(58,b,30,a)]. 38.75/39.11 184 -id(f16(A,B),C) | id(f18(A,B),C). [resolve(60,c,41,a)]. 38.75/39.11 229 r3(A,B,C) | -id(D,A) | -id(f19(D,E),B) | -id(f18(D,E),C). [resolve(67,b,46,a)]. 38.75/39.11 296 -id(c1,A) | id(c5,A). [resolve(135,a,60,c)]. 38.75/39.11 399 id(c1,c3). [resolve(136,a,51,b)]. 38.75/39.11 726 -r1(f12(A)). [ur(48,a,23,a,c,157,a)]. 38.75/39.11 727 -id(f12(c6),A) | id(c4,A). [resolve(163,a,60,c)]. 38.75/39.11 2178 r1(f13(c5,c4)). [resolve(173,a,53,a),unit_del(a,151)]. 38.75/39.11 2210 -id(f12(A),f13(c5,c4)). [ur(52,b,2178,a,c,726,a)]. 38.75/39.11 4927 id(f12(A),f19(B,A)). [resolve(161,a,51,b)]. 38.75/39.11 6078 id(f18(A,B),f12(f17(A,B))). [resolve(184,a,160,a)]. 38.75/39.11 10928 id(c5,c3). [resolve(296,a,399,a)]. 38.75/39.11 10955 id(c3,c5). [resolve(10928,a,51,b)]. 38.75/39.11 13545 id(c4,f19(A,c6)). [resolve(4927,a,727,a)]. 38.75/39.11 13564 id(f19(A,c6),c4). [resolve(13545,a,51,b)]. 38.75/39.11 13585 -r3(c5,c4,f12(A)). [ur(58,a,2210,a)]. 38.75/39.11 13590 -id(f18(c3,c6),f12(A)). [ur(229,a,13585,a,b,10955,a,c,13564,a)]. 38.75/39.11 13591 $F. [resolve(13590,a,6078,a)]. 38.75/39.11 38.75/39.11 % SZS output end Refutation 38.75/39.11 ============================== end of proof ========================== 38.75/39.11 38.75/39.11 ============================== STATISTICS ============================ 38.75/39.11 38.75/39.11 Given=1941. Generated=2107516. Kept=13571. proofs=1. 38.75/39.11 Usable=1934. Sos=9999. Demods=0. Limbo=4, Disabled=1681. Hints=0. 38.75/39.11 Megabytes=8.45. 38.75/39.11 User_CPU=36.01, System_CPU=1.93, Wall_clock=38. 38.75/39.11 38.75/39.11 ============================== end of statistics ===================== 38.75/39.11 38.75/39.11 ============================== end of search ========================= 38.75/39.11 38.75/39.11 THEOREM PROVED 38.75/39.11 % SZS status Theorem 38.75/39.11 38.75/39.11 Exiting with 1 proof. 38.75/39.11 38.75/39.11 Process 26318 exit (max_proofs) Thu Jul 2 07:37:11 2020 38.75/39.11 Prover9 interrupted 38.75/39.11 EOF