0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.33 % Computer : n028.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 960 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Aug 9 02:06:50 EDT 2022 0.11/0.33 % CPUTime : 0.42/0.98 ============================== Prover9 =============================== 0.42/0.98 Prover9 (32) version 2009-11A, November 2009. 0.42/0.98 Process 5397 was started by sandbox2 on n028.cluster.edu, 0.42/0.98 Tue Aug 9 02:06:50 2022 0.42/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_5243_n028.cluster.edu". 0.42/0.98 ============================== end of head =========================== 0.42/0.98 0.42/0.98 ============================== INPUT ================================= 0.42/0.98 0.42/0.98 % Reading from file /tmp/Prover9_5243_n028.cluster.edu 0.42/0.98 0.42/0.98 set(prolog_style_variables). 0.42/0.98 set(auto2). 0.42/0.98 % set(auto2) -> set(auto). 0.42/0.98 % set(auto) -> set(auto_inference). 0.42/0.98 % set(auto) -> set(auto_setup). 0.42/0.98 % set(auto_setup) -> set(predicate_elim). 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold). 0.42/0.98 % set(auto) -> set(auto_limits). 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000"). 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000). 0.42/0.98 % set(auto) -> set(auto_denials). 0.42/0.98 % set(auto) -> set(auto_process). 0.42/0.98 % set(auto2) -> assign(new_constants, 1). 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3). 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000"). 0.42/0.98 % set(auto2) -> assign(max_hours, 1). 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.42/0.98 % set(auto2) -> assign(max_seconds, 0). 0.42/0.98 % set(auto2) -> assign(max_minutes, 5). 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.42/0.98 % set(auto2) -> set(sort_initial_sos). 0.42/0.98 % set(auto2) -> assign(sos_limit, -1). 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000). 0.42/0.98 % set(auto2) -> assign(max_megs, 400). 0.42/0.98 % set(auto2) -> assign(stats, some). 0.42/0.98 % set(auto2) -> clear(echo_input). 0.42/0.98 % set(auto2) -> set(quiet). 0.42/0.98 % set(auto2) -> clear(print_initial_clauses). 0.42/0.98 % set(auto2) -> clear(print_given). 0.42/0.98 assign(lrs_ticks,-1). 0.42/0.98 assign(sos_limit,10000). 0.42/0.98 assign(order,kbo). 0.42/0.98 set(lex_order_vars). 0.42/0.98 clear(print_given). 0.42/0.98 0.42/0.98 % formulas(sos). % not echoed (19 formulas) 0.42/0.98 0.42/0.98 ============================== end of input ========================== 0.42/0.98 0.42/0.98 % From the command line: assign(max_seconds, 960). 0.42/0.98 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.42/0.98 0.42/0.98 % Formulas that are not ordinary clauses: 0.42/0.98 1 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 2 (all X11 exists Y21 all X12 (r2(X11,X12) & id(X12,Y21) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 3 (exists Y24 all X19 (-id(X19,Y24) & -r1(X19) | r1(X19) & id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 4 (all X16 all X17 exists Y23 all X18 (id(X18,Y23) & r4(X16,X17,X18) | -id(X18,Y23) & -r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 5 (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.42/0.98 6 (all X6 ((exists Y19 (id(X6,Y19) & r1(Y19))) | (exists Y1 exists Y11 (id(X6,Y11) & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & -id(X15,Y22) | id(X15,Y22) & r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 8 (all X4 exists Y9 ((exists Y16 (r3(X4,Y16,Y9) & r1(Y16))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 9 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-id(Y20,Y10) | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 11 (all X1 all X8 exists Y4 ((exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 12 (all X32 all X33 all X34 all X35 all X36 all X37 (-r3(X35,X36,X37) & -r3(X32,X33,X34) | r3(X35,X36,X37) & r3(X32,X33,X34) | -id(X34,X37) | -id(X33,X36) | -id(X32,X35))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption]. 0.42/0.98 13 (all X2 all X9 exists Y2 ((exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))) & (exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & id(Y3,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 14 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 15 (all X23 all X24 all X25 (-id(X23,X24) | -id(X24,X25) | id(X23,X25))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 16 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X27) & r1(X26))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 17 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X40,X43) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 18 (all X28 all X29 all X30 all X31 (-id(X28,X30) | -id(X29,X31) | -r2(X28,X29) & -r2(X30,X31) | r2(X28,X29) & r2(X30,X31))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 19 -(exists Y1 exists Y2 exists Y3 ((exists Y4 (id(Y4,Y1) & (exists Y6 ((exists Y7 (r2(Y7,Y6) & (exists Y8 (r2(Y8,Y7) & r1(Y8))))) & r4(Y6,Y2,Y4))))) & (exists Y5 (id(Y5,Y1) & r3(Y2,Y3,Y5))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause). [assumption]. 1.10/1.40 1.10/1.40 ============================== end of process non-clausal formulas === 1.10/1.40 1.10/1.40 ============================== PROCESS INITIAL CLAUSES =============== 1.10/1.40 1.10/1.40 ============================== PREDICATE ELIMINATION ================= 1.10/1.40 1.10/1.40 ============================== end predicate elimination ============= 1.10/1.40 1.10/1.40 Auto_denials: (non-Horn, no changes). 1.10/1.40 1.10/1.40 Term ordering decisions: 1.10/1.40 Function symbol KB weights: c1=1. f2=1. f6=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f1=1. f3=1. f4=1. f5=1. f7=1. f8=1. f17=1. f18=1. f19=1. 1.10/1.40 1.10/1.40 ============================== end of process initial clauses ======== 1.10/1.40 1.10/1.40 ============================== CLAUSES FOR SEARCH ==================== 1.10/1.40 1.10/1.40 ============================== end of clauses for search ============= 1.10/1.40 1.10/1.40 ============================== SEARCH ================================ 1.10/1.40 1.10/1.40 % Starting search at 0.01 seconds. 1.10/1.40 1.10/1.40 Low Water (keep): wt=16.000, iters=4015 1.10/1.40 1.10/1.40 Low Water (keep): wt=14.000, iters=3922 1.10/1.40 1.10/1.40 Low Water (keep): wt=13.000, iters=3647 1.10/1.40 1.10/1.40 Low Water (keep): wt=12.000, iters=5418 1.10/1.40 1.10/1.40 Low Water (keep): wt=11.000, iters=4239 1.10/1.40 1.10/1.40 ============================== PROOF ================================= 1.10/1.40 % SZS status Theorem 1.10/1.40 % SZS output start Refutation 1.10/1.40 1.10/1.40 % Proof 1 at 0.41 (+ 0.01) seconds. 1.10/1.40 % Length of proof is 29. 1.10/1.40 % Level of proof is 5. 1.10/1.40 % Maximum clause weight is 22.000. 1.10/1.40 % Given clauses 115. 1.10/1.40 1.10/1.40 2 (all X11 exists Y21 all X12 (r2(X11,X12) & id(X12,Y21) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 3 (exists Y24 all X19 (-id(X19,Y24) & -r1(X19) | r1(X19) & id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 8 (all X4 exists Y9 ((exists Y16 (r3(X4,Y16,Y9) & r1(Y16))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 9 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 11 (all X1 all X8 exists Y4 ((exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 14 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 16 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X27) & r1(X26))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption]. 1.10/1.40 19 -(exists Y1 exists Y2 exists Y3 ((exists Y4 (id(Y4,Y1) & (exists Y6 ((exists Y7 (r2(Y7,Y6) & (exists Y8 (r2(Y8,Y7) & r1(Y8))))) & r4(Y6,Y2,Y4))))) & (exists Y5 (id(Y5,Y1) & r3(Y2,Y3,Y5))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause). [assumption]. 1.10/1.40 21 id(A,A) # label(axiom_5) # label(axiom). [clausify(9)]. 1.10/1.40 22 r1(f18(A)) # label(axiom_5a) # label(axiom). [clausify(14)]. 1.10/1.40 23 r1(f19(A)) # label(axiom_5a) # label(axiom). [clausify(14)]. 1.10/1.40 24 id(f7(A),A) # label(axiom_4a) # label(axiom). [clausify(8)]. 1.10/1.40 25 r2(A,f11(B,A)) # label(axiom_1a) # label(axiom). [clausify(11)]. 1.10/1.40 27 id(f17(A),f19(A)) # label(axiom_5a) # label(axiom). [clausify(14)]. 1.10/1.40 28 r3(A,f8(A),f7(A)) # label(axiom_4a) # label(axiom). [clausify(8)]. 1.10/1.40 31 r4(A,f18(A),f17(A)) # label(axiom_5a) # label(axiom). [clausify(14)]. 1.10/1.40 43 -id(A,B) | -r2(C,D) | -r2(E,C) | -r1(E) | -r4(D,F,A) | -id(V6,B) | -r3(F,V7,V6) # label(thereexistsanevennumberid) # label(negated_conjecture). [clausify(19)]. 1.10/1.40 45 -r1(A) | id(A,c1) # label(axiom_1) # label(axiom). [clausify(3)]. 1.10/1.40 47 r2(A,B) | -id(B,f1(A)) # label(axiom_2) # label(axiom). [clausify(2)]. 1.10/1.40 50 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom). [clausify(16)]. 1.10/1.40 816 r2(A,f1(A)). [resolve(47,b,21,a)]. 1.10/1.40 829 r1(f17(A)). [resolve(50,a,27,a),unit_del(a,23)]. 1.10/1.40 830 -r1(A) | r1(f7(A)). [resolve(50,a,24,a)]. 1.10/1.40 1423 id(f17(A),c1). [resolve(829,a,45,a)]. 1.10/1.40 7909 r1(f7(f19(A))). [resolve(830,a,23,a)]. 1.10/1.40 7910 r1(f7(f18(A))). [resolve(830,a,22,a)]. 1.10/1.40 8316 -id(f7(f18(f11(A,f1(f7(f19(B)))))),c1). [ur(43,a,1423,a,b,25,a,c,816,a,d,7909,a,e,31,a,g,28,a)]. 1.10/1.40 8500 id(f7(f18(A)),c1). [resolve(7910,a,45,a)]. 1.10/1.40 8501 $F. [resolve(8500,a,8316,a)]. 1.10/1.40 1.10/1.40 % SZS output end Refutation 1.10/1.40 ============================== end of proof ========================== 1.10/1.40 1.10/1.40 ============================== STATISTICS ============================ 1.10/1.40 1.10/1.40 Given=115. Generated=25686. Kept=8481. proofs=1. 1.10/1.40 Usable=115. Sos=7865. Demods=0. Limbo=1, Disabled=542. Hints=0. 1.10/1.40 Megabytes=6.08. 1.10/1.40 User_CPU=0.41, System_CPU=0.01, Wall_clock=1. 1.10/1.40 1.10/1.40 ============================== end of statistics ===================== 1.10/1.40 1.10/1.40 ============================== end of search ========================= 1.10/1.40 1.10/1.40 THEOREM PROVED 1.10/1.40 % SZS status Theorem 1.10/1.40 1.10/1.40 Exiting with 1 proof. 1.10/1.40 1.10/1.40 Process 5397 exit (max_proofs) Tue Aug 9 02:06:51 2022 1.10/1.40 Prover9 interrupted 1.10/1.40 EOF