0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n005.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % DateTime : Tue Jul 13 16:36:48 EDT 2021 0.13/0.34 % CPUTime : 0.74/1.01 ============================== Prover9 =============================== 0.74/1.01 Prover9 (32) version 2009-11A, November 2009. 0.74/1.01 Process 14312 was started by sandbox2 on n005.cluster.edu, 0.74/1.01 Tue Jul 13 16:36:49 2021 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_13929_n005.cluster.edu". 0.74/1.01 ============================== end of head =========================== 0.74/1.01 0.74/1.01 ============================== INPUT ================================= 0.74/1.01 0.74/1.01 % Reading from file /tmp/Prover9_13929_n005.cluster.edu 0.74/1.01 0.74/1.01 set(prolog_style_variables). 0.74/1.01 set(auto2). 0.74/1.01 % set(auto2) -> set(auto). 0.74/1.01 % set(auto) -> set(auto_inference). 0.74/1.01 % set(auto) -> set(auto_setup). 0.74/1.01 % set(auto_setup) -> set(predicate_elim). 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.74/1.01 % set(auto) -> set(auto_limits). 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.74/1.01 % set(auto) -> set(auto_denials). 0.74/1.01 % set(auto) -> set(auto_process). 0.74/1.01 % set(auto2) -> assign(new_constants, 1). 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.74/1.01 % set(auto2) -> assign(max_hours, 1). 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.74/1.01 % set(auto2) -> assign(max_seconds, 0). 0.74/1.01 % set(auto2) -> assign(max_minutes, 5). 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.74/1.01 % set(auto2) -> set(sort_initial_sos). 0.74/1.01 % set(auto2) -> assign(sos_limit, -1). 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.74/1.01 % set(auto2) -> assign(max_megs, 400). 0.74/1.01 % set(auto2) -> assign(stats, some). 0.74/1.01 % set(auto2) -> clear(echo_input). 0.74/1.01 % set(auto2) -> set(quiet). 0.74/1.01 % set(auto2) -> clear(print_initial_clauses). 0.74/1.01 % set(auto2) -> clear(print_given). 0.74/1.01 assign(lrs_ticks,-1). 0.74/1.01 assign(sos_limit,10000). 0.74/1.01 assign(order,kbo). 0.74/1.01 set(lex_order_vars). 0.74/1.01 clear(print_given). 0.74/1.01 0.74/1.01 % formulas(sos). % not echoed (12 formulas) 0.74/1.01 0.74/1.01 ============================== end of input ========================== 0.74/1.01 0.74/1.01 % From the command line: assign(max_seconds, 1200). 0.74/1.01 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.74/1.01 0.74/1.01 % Formulas that are not ordinary clauses: 0.74/1.01 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.74/1.01 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.74/1.01 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.74/1.01 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.74/1.01 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.74/1.01 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.74/1.01 7 (exists Y24 all X19 (r1(X19) & Y24 = X19 | X19 != Y24 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 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.74/1.01 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.74/1.01 10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | Y10 != Y20)))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 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.74/1.01 12 -(exists Y1 ((all Y11 (-r1(Y11) | Y1 != Y11)) & (all X1 all X2 ((all Y2 all Y6 (-r3(X1,Y2,Y6) | Y1 != Y6)) | (all Y3 all Y5 (-r3(X2,Y3,Y5) | Y5 != Y1)) | (all Y4 (Y1 != Y4 | -r4(X1,X2,Y4))) | (exists Y7 (Y7 = X1 & (exists Y9 (r1(Y9) & r2(Y9,Y7))))) | (exists Y8 (X2 = Y8 & (exists Y10 (r2(Y10,Y8) & r1(Y10))))))))) # label(primeexist) # label(negated_conjecture) # label(non_clause). [assumption]. 18.14/18.47 18.14/18.47 ============================== end of process non-clausal formulas === 18.14/18.47 18.14/18.47 ============================== PROCESS INITIAL CLAUSES =============== 18.14/18.47 18.14/18.47 ============================== PREDICATE ELIMINATION ================= 18.14/18.47 13 A = f4(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(4)]. 18.14/18.47 14 r3(A,f2(A),f1(A)) # label(axiom_4a) # label(axiom). [clausify(2)]. 18.14/18.47 15 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom). [clausify(6)]. 18.14/18.47 16 r3(A,f11(A,B),f10(A,B)) # label(axiom_1a) # label(axiom). [clausify(6)]. 18.14/18.47 17 r3(f13(A,B),A,f12(A,B)) # label(axiom_2a) # label(axiom). [clausify(8)]. 18.14/18.47 18 r1(f20(A)) | r3(f21(A),f23(A),f24(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 19 r1(f20(A)) | r3(f22(A),f25(A),f26(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 20 f20(A) = A | r3(f21(A),f23(A),f24(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 21 f20(A) = A | r3(f22(A),f25(A),f26(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 Derived: f1(A) = f4(A,f2(A)). [resolve(13,b,14,a)]. 18.14/18.47 Derived: f9(A,B) = f4(A,B). [resolve(13,b,15,a)]. 18.14/18.47 Derived: f10(A,B) = f4(A,f11(A,B)). [resolve(13,b,16,a)]. 18.14/18.47 Derived: f12(A,B) = f4(f13(A,B),A). [resolve(13,b,17,a)]. 18.14/18.47 Derived: f24(A) = f4(f21(A),f23(A)) | r1(f20(A)). [resolve(13,b,18,b)]. 18.14/18.47 Derived: f26(A) = f4(f22(A),f25(A)) | r1(f20(A)). [resolve(13,b,19,b)]. 18.14/18.47 Derived: f24(A) = f4(f21(A),f23(A)) | f20(A) = A. [resolve(13,b,20,b)]. 18.14/18.47 Derived: f26(A) = f4(f22(A),f25(A)) | f20(A) = A. [resolve(13,b,21,b)]. 18.14/18.47 22 r3(A,B,C) | C != f4(A,B) # label(axiom_3) # label(axiom). [clausify(4)]. 18.14/18.47 23 A = f3(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(3)]. 18.14/18.47 24 r4(A,f7(A),f5(A)) # label(axiom_5a) # label(axiom). [clausify(5)]. 18.14/18.47 25 r4(A,B,f13(A,B)) # label(axiom_2a) # label(axiom). [clausify(8)]. 18.14/18.47 26 r4(A,f15(A,B),f14(A,B)) # label(axiom_2a) # label(axiom). [clausify(8)]. 18.14/18.47 27 r1(f20(A)) | r4(f21(A),f22(A),f27(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 28 f20(A) = A | r4(f21(A),f22(A),f27(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)]. 18.14/18.47 Derived: f5(A) = f3(A,f7(A)). [resolve(23,b,24,a)]. 18.14/18.47 Derived: f13(A,B) = f3(A,B). [resolve(23,b,25,a)]. 18.14/18.47 Derived: f14(A,B) = f3(A,f15(A,B)). [resolve(23,b,26,a)]. 18.14/18.47 Derived: f27(A) = f3(f21(A),f22(A)) | r1(f20(A)). [resolve(23,b,27,b)]. 18.14/18.47 Derived: f27(A) = f3(f21(A),f22(A)) | f20(A) = A. [resolve(23,b,28,b)]. 18.14/18.47 29 r4(A,B,C) | C != f3(A,B) # label(axiom_4) # label(axiom). [clausify(3)]. 18.14/18.47 18.14/18.47 ============================== end predicate elimination ============= 18.14/18.47 18.14/18.47 Auto_denials: (non-Horn, no changes). 18.14/18.47 18.14/18.47 Term ordering decisions: 18.14/18.47 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. f24=1. f25=1. f26=1. f27=1. 18.14/18.47 18.14/18.47 ============================== end of process initial clauses ======== 18.14/18.47 18.14/18.47 ============================== CLAUSES FOR SEARCH ==================== 18.14/18.47 18.14/18.47 ============================== end of clauses for search ============= 18.14/18.47 18.14/18.47 ============================== SEARCH ================================ 18.14/18.47 18.14/18.47 % Starting search at 0.01 seconds. 18.14/18.47 18.14/18.47 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 427 (0.00 of 0.37 sec). 18.14/18.47 18.14/18.47 Low Water (keep): wt=33.000, iters=3434 18.14/18.47 18.14/18.47 Low Water (keep): wt=29.000, iters=3427 18.14/18.47 18.14/18.47 Low Water (keep): wt=25.000, iters=3368 18.14/18.47 18.14/18.47 Low Water (keep): wt=19.000, iters=3386 18.14/18.47 18.14/18.47 Low Water (keep): wt=18.000, iters=3340 18.14/18.47 18.14/18.47 Low Water (keep): wt=17.000, iters=3333 18.14/18.47 18.14/18.47 Low Water (keep): wt=16.000, iters=3381 18.14/18.47 18.14/18.47 Low Water (keep): wt=15.000, iters=3333 18.14/18.47 18.14/18.47 Low Water (displace): id=3972, wt=40.000 18.14/18.47 18.14/18.47 Low Water (displace): id=9422, wt=21.000 18.14/18.47 18.14/18.47 Low Water (displace): id=9485, wt=19.000 18.14/18.47 18.14/18.47 Low Water (displace): id=9942, wt=18.000 18.14/18.47 18.14/18.47 Low Water (displace): id=10376, wt=17.000 18.14/18.47 18.14/18.47 Low Water (displace)Alarm clock 119.78/120.07 Prover9 interrupted 119.78/120.07 EOF