0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n019.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 05:05:51 EDT 2022 0.12/0.33 % CPUTime : 0.82/1.14 ============================== Prover9 =============================== 0.82/1.14 Prover9 (32) version 2009-11A, November 2009. 0.82/1.14 Process 9423 was started by sandbox2 on n019.cluster.edu, 0.82/1.14 Tue Aug 9 05:05:52 2022 0.82/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_9270_n019.cluster.edu". 0.82/1.14 ============================== end of head =========================== 0.82/1.14 0.82/1.14 ============================== INPUT ================================= 0.82/1.14 0.82/1.14 % Reading from file /tmp/Prover9_9270_n019.cluster.edu 0.82/1.14 0.82/1.14 set(prolog_style_variables). 0.82/1.14 set(auto2). 0.82/1.14 % set(auto2) -> set(auto). 0.82/1.14 % set(auto) -> set(auto_inference). 0.82/1.14 % set(auto) -> set(auto_setup). 0.82/1.14 % set(auto_setup) -> set(predicate_elim). 0.82/1.14 % set(auto_setup) -> assign(eq_defs, unfold). 0.82/1.14 % set(auto) -> set(auto_limits). 0.82/1.14 % set(auto_limits) -> assign(max_weight, "100.000"). 0.82/1.14 % set(auto_limits) -> assign(sos_limit, 20000). 0.82/1.14 % set(auto) -> set(auto_denials). 0.82/1.14 % set(auto) -> set(auto_process). 0.82/1.14 % set(auto2) -> assign(new_constants, 1). 0.82/1.14 % set(auto2) -> assign(fold_denial_max, 3). 0.82/1.14 % set(auto2) -> assign(max_weight, "200.000"). 0.82/1.14 % set(auto2) -> assign(max_hours, 1). 0.82/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.82/1.14 % set(auto2) -> assign(max_seconds, 0). 0.82/1.14 % set(auto2) -> assign(max_minutes, 5). 0.82/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.82/1.14 % set(auto2) -> set(sort_initial_sos). 0.82/1.14 % set(auto2) -> assign(sos_limit, -1). 0.82/1.14 % set(auto2) -> assign(lrs_ticks, 3000). 0.82/1.14 % set(auto2) -> assign(max_megs, 400). 0.82/1.14 % set(auto2) -> assign(stats, some). 0.82/1.14 % set(auto2) -> clear(echo_input). 0.82/1.14 % set(auto2) -> set(quiet). 0.82/1.14 % set(auto2) -> clear(print_initial_clauses). 0.82/1.14 % set(auto2) -> clear(print_given). 0.82/1.14 assign(lrs_ticks,-1). 0.82/1.14 assign(sos_limit,10000). 0.82/1.14 assign(order,kbo). 0.82/1.14 set(lex_order_vars). 0.82/1.14 clear(print_given). 0.82/1.14 0.82/1.14 % formulas(sos). % not echoed (43 formulas) 0.82/1.14 0.82/1.14 ============================== end of input ========================== 0.82/1.14 0.82/1.14 % From the command line: assign(max_seconds, 960). 0.82/1.14 0.82/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.82/1.14 0.82/1.14 % Formulas that are not ordinary clauses: 0.82/1.14 1 and_1 <-> (all X all Y is_a_theorem(implies(and(X,Y),X))) # label(and_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 2 modus_tollens <-> (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) # label(modus_tollens) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 3 (all X all Y is_a_theorem(implies(and(X,Y),Y))) <-> and_2 # label(and_2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 4 (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) <-> or_3 # label(or_3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 5 and_3 <-> (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) # label(and_3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 6 equivalence_3 <-> (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) # label(equivalence_3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 7 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 8 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 9 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 10 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 11 (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) <-> cn1 # label(cn1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 12 equivalence_1 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) # label(equivalence_1) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 13 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> Y = X)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption]. 0.82/1.14 14 (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) <-> r5 # label(r5) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 15 (all P all Q is_a_theorem(implies(Q,or(P,Q)))) <-> r2 # label(r2) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 16 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 17 (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) <-> cn2 # label(cn2) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 18 (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) <-> implies_2 # label(implies_2) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 19 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 20 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 21 r4 <-> (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) # label(r4) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 22 (all P is_a_theorem(implies(P,and(P,P)))) <-> kn1 # label(kn1) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 23 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) <-> equivalence_2 # label(equivalence_2) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 24 modus_ponens <-> (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 25 (all X all Y is_a_theorem(implies(X,implies(Y,X)))) <-> implies_1 # label(implies_1) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 26 (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) <-> implies_3 # label(implies_3) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 27 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 28 op_implies_or -> (all X all Y or(not(X),Y) = implies(X,Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 29 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 30 op_or -> (all X all Y not(and(not(X),not(Y))) = or(X,Y)) # label(op_or) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 31 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause). [assumption]. 1.54/1.90 1.54/1.90 ============================== end of process non-clausal formulas === 1.54/1.90 1.54/1.90 ============================== PROCESS INITIAL CLAUSES =============== 1.54/1.90 1.54/1.90 ============================== PREDICATE ELIMINATION ================= 1.54/1.90 1.54/1.90 ============================== end predicate elimination ============= 1.54/1.90 1.54/1.90 Auto_denials: (non-Horn, no changes). 1.54/1.90 1.54/1.90 Term ordering decisions: 1.54/1.90 1.54/1.90 % Assigning unary symbol not kb_weight 0 and highest precedence (93). 1.54/1.90 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. c40=1. c41=1. c42=1. c43=1. c44=1. c45=1. c46=1. c47=1. c48=1. c49=1. c50=1. c51=1. c52=1. c53=1. c54=1. c55=1. implies=1. or=1. and=1. equiv=1. not=0. 1.54/1.90 1.54/1.90 ============================== end of process initial clauses ======== 1.54/1.90 1.54/1.90 ============================== CLAUSES FOR SEARCH ==================== 1.54/1.90 1.54/1.90 ============================== end of clauses for search ============= 1.54/1.90 1.54/1.90 ============================== SEARCH ================================ 1.54/1.90 1.54/1.90 % Starting search at 0.01 seconds. 1.54/1.90 1.54/1.90 Low Water (keep): wt=45.000, iters=3533 1.54/1.90 1.54/1.90 Low Water (keep): wt=33.000, iters=3429 1.54/1.90 1.54/1.90 Low Water (keep): wt=31.000, iters=3378 1.54/1.90 1.54/1.90 Low Water (keep): wt=27.000, iters=3360 1.54/1.90 1.54/1.90 Low Water (keep): wt=25.000, iters=3466 1.54/1.90 1.54/1.90 Low Water (keep): wt=23.000, iters=3335 1.54/1.90 1.54/1.90 Low Water (keep): wt=21.000, iters=3389 1.54/1.90 1.54/1.90 Low Water (keep): wt=20.000, iters=3346 1.54/1.90 1.54/1.90 Low Water (keep): wt=19.000, iters=3395 1.54/1.90 1.54/1.90 Low Water (keep): wt=18.000, iters=3633 1.54/1.90 1.54/1.90 Low Water (keep): wt=17.000, iters=3391 3.43/3.82 3.43/3.82 Low Water (keep): wt=16.000, iters=3367 3.43/3.82 3.43/3.82 Low Water (keep): wt=15.000, iters=3339 3.43/3.82 3.43/3.82 Low Water (displace): id=2027, wt=51.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3624, wt=49.000 3.43/3.82 3.43/3.82 Low Water (displace): id=1997, wt=47.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3633, wt=45.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3250, wt=43.000 3.43/3.82 3.43/3.82 Low Water (displace): id=2029, wt=41.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3066, wt=40.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3290, wt=39.000 3.43/3.82 3.43/3.82 Low Water (displace): id=1311, wt=38.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3486, wt=37.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3387, wt=35.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3623, wt=33.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3686, wt=32.000 3.43/3.82 3.43/3.82 Low Water (displace): id=3564, wt=31.000 3.43/3.82 3.43/3.82 Low Water (displace): id=10841, wt=24.000 3.43/3.82 3.43/3.82 Low Water (displace): id=11016, wt=14.000 3.43/3.82 3.43/3.82 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 111 (0.00 of 1.58 sec). 3.43/3.82 3.43/3.82 Low Water (displace): id=11741, wt=13.000 3.43/3.82 3.43/3.82 Low Water (displace): id=11743, wt=12.000 3.43/3.82 3.43/3.82 Low Water (displace): id=11828, wt=11.000 3.43/3.82 3.43/3.82 ============================== PROOF ================================= 3.43/3.82 % SZS status Theorem 3.43/3.82 % SZS output start Refutation 3.43/3.82 3.43/3.82 % Proof 1 at 2.50 (+ 0.12) seconds. 3.43/3.82 % Length of proof is 61. 3.43/3.82 % Level of proof is 21. 3.43/3.82 % Maximum clause weight is 16.000. 3.43/3.82 % Given clauses 697. 3.43/3.82 3.43/3.82 7 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 8 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 9 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 22 (all P is_a_theorem(implies(P,and(P,P)))) <-> kn1 # label(kn1) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 24 modus_ponens <-> (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 27 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 30 op_or -> (all X all Y not(and(not(X),not(Y))) = or(X,Y)) # label(op_or) # label(axiom) # label(non_clause). [assumption]. 3.43/3.82 32 modus_ponens # label(rosser_modus_ponens) # label(axiom). [assumption]. 3.43/3.82 33 kn3 # label(rosser_kn3) # label(axiom). [assumption]. 3.43/3.82 34 op_or # label(rosser_op_or) # label(axiom). [assumption]. 3.43/3.82 35 kn2 # label(rosser_kn2) # label(axiom). [assumption]. 3.43/3.82 38 kn1 # label(rosser_kn1) # label(axiom). [assumption]. 3.43/3.82 39 op_implies_and # label(rosser_op_implies_and) # label(axiom). [assumption]. 3.43/3.82 40 -or_1 # label(hilbert_or_1) # label(negated_conjecture). [assumption]. 3.43/3.82 45 -kn2 | is_a_theorem(implies(and(A,B),A)) # label(kn2) # label(axiom). [clausify(7)]. 3.43/3.82 46 is_a_theorem(implies(and(A,B),A)). [copy(45),unit_del(a,35)]. 3.43/3.82 48 or_1 | -is_a_theorem(implies(c19,or(c19,c20))) # label(or_1) # label(axiom). [clausify(9)]. 3.43/3.82 49 -is_a_theorem(implies(c19,or(c19,c20))). [copy(48),unit_del(a,40)]. 3.43/3.82 56 is_a_theorem(implies(A,and(A,A))) | -kn1 # label(kn1) # label(axiom). [clausify(22)]. 3.43/3.82 57 is_a_theorem(implies(A,and(A,A))). [copy(56),unit_del(b,38)]. 3.43/3.82 74 -modus_ponens | -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B) # label(modus_ponens) # label(axiom). [clausify(24)]. 3.43/3.82 75 -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B). [copy(74),unit_del(a,32)]. 3.43/3.82 77 -op_implies_and | not(and(A,not(B))) = implies(A,B) # label(op_implies_and) # label(axiom). [clausify(27)]. 3.43/3.82 78 not(and(A,not(B))) = implies(A,B). [copy(77),unit_del(a,39)]. 3.43/3.82 83 -op_or | or(A,B) = not(and(not(A),not(B))) # label(op_or) # label(axiom). [clausify(30)]. 3.43/3.82 84 or(A,B) = implies(not(A),B). [copy(83),rewrite([78(6)]),unit_del(a,34)]. 3.43/3.82 107 -kn3 | is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A))))) # label(kn3) # label(axiom). [clausify(8)]. 3.43/3.82 108 is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A))))). [copy(107),unit_del(a,33)]. 3.43/3.82 120 -is_a_theorem(implies(c19,implies(not(c19),c20))). [back_rewrite(49),rewrite([84(4)])]. 3.43/3.82 127 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(not(and(B,C)),not(and(C,A)))). [resolve(108,a,75,b)]. 3.43/3.82 215 is_a_theorem(implies(not(and(and(A,A),B)),not(and(B,A)))). [resolve(127,a,57,a)]. 3.43/3.82 216 is_a_theorem(implies(not(and(A,B)),not(and(B,and(A,C))))). [resolve(127,a,46,a)]. 3.43/3.82 251 -is_a_theorem(not(and(and(A,A),B))) | is_a_theorem(not(and(B,A))). [resolve(215,a,75,b)]. 3.43/3.82 271 -is_a_theorem(not(and(A,B))) | is_a_theorem(not(and(B,and(A,C)))). [resolve(216,a,75,b)]. 3.43/3.82 287 -is_a_theorem(implies(and(A,A),B)) | is_a_theorem(not(and(not(B),A))). [para(78(a,1),251(a,1))]. 3.43/3.82 400 is_a_theorem(not(and(not(A),A))). [resolve(287,a,46,a)]. 3.43/3.82 402 is_a_theorem(not(and(A,and(not(A),B)))). [resolve(400,a,271,a)]. 3.43/3.82 421 is_a_theorem(implies(not(not(A)),A)). [para(78(a,1),400(a,1))]. 3.43/3.82 510 is_a_theorem(implies(not(and(A,B)),implies(B,not(A)))). [resolve(421,a,127,a),rewrite([78(6)])]. 3.43/3.82 512 -is_a_theorem(not(not(A))) | is_a_theorem(A). [resolve(421,a,75,b)]. 3.43/3.82 556 is_a_theorem(not(and(and(not(A),B),and(A,C)))). [resolve(402,a,271,a)]. 3.43/3.82 745 -is_a_theorem(not(and(A,B))) | is_a_theorem(implies(B,not(A))). [resolve(510,a,75,b)]. 3.43/3.82 1236 is_a_theorem(implies(and(A,B),not(and(not(A),C)))). [resolve(745,a,556,a)]. 3.43/3.82 1239 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(not(B),not(A))). [para(78(a,1),745(a,1))]. 3.43/3.82 2340 is_a_theorem(implies(and(A,B),implies(not(A),C))). [para(78(a,1),1236(a,1,2))]. 3.43/3.82 2345 is_a_theorem(not(and(not(implies(not(A),B)),A))). [resolve(2340,a,287,a)]. 3.43/3.82 2668 -is_a_theorem(implies(not(and(not(implies(not(A),B)),A)),implies(c19,implies(not(c19),c20)))). [ur(75,a,2345,a,c,120,a)]. 3.43/3.82 3724 is_a_theorem(implies(not(and(A,A)),not(A))). [resolve(1239,a,57,a)]. 3.43/3.82 3725 is_a_theorem(implies(not(A),not(and(A,B)))). [resolve(1239,a,46,a)]. 3.43/3.82 3994 -is_a_theorem(not(and(A,A))) | is_a_theorem(not(A)). [resolve(3724,a,75,b)]. 3.43/3.82 4156 is_a_theorem(implies(not(A),implies(A,B))). [para(78(a,1),3725(a,1,2))]. 3.43/3.82 4162 is_a_theorem(implies(not(and(implies(A,B),C)),implies(C,A))). [resolve(4156,a,127,a),rewrite([78(6)])]. 3.43/3.82 4570 -is_a_theorem(implies(not(A),A)) | is_a_theorem(not(not(A))). [para(78(a,1),3994(a,1))]. 3.43/3.82 10353 -is_a_theorem(not(and(implies(A,B),C))) | is_a_theorem(implies(C,A)). [resolve(4162,a,75,b)]. 3.43/3.82 10372 is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))). [para(78(a,1),4162(a,1,1))]. 3.43/3.82 11880 -is_a_theorem(implies(implies(A,B),C)) | is_a_theorem(implies(not(C),A)). [para(78(a,1),10353(a,1))]. 3.43/3.82 12873 is_a_theorem(implies(not(implies(not(A),B)),implies(B,C))). [resolve(11880,a,10372,a)]. 3.43/3.82 13898 is_a_theorem(not(not(implies(not(A),not(A))))). [resolve(12873,a,4570,a)]. 3.43/3.82 13927 is_a_theorem(implies(not(A),not(A))). [resolve(13898,a,512,a)]. 3.43/3.82 13952 is_a_theorem(implies(not(and(not(A),B)),implies(B,A))). [resolve(13927,a,127,a),rewrite([78(6)])]. 3.43/3.82 13953 $F. [resolve(13952,a,2668,a)]. 3.43/3.82 3.43/3.82 % SZS output end Refutation 3.43/3.82 ============================== end of proof ========================== 3.43/3.82 3.43/3.82 ============================== STATISTICS ============================ 3.43/3.82 3.43/3.82 Given=697. Generated=115001. Kept=13903. proofs=1. 3.43/3.82 Usable=692. Sos=9999. Demods=6. Limbo=7, Disabled=3276. Hints=0. 3.43/3.82 Megabytes=12.76. 3.43/3.82 User_CPU=2.50, System_CPU=0.12, Wall_clock=2. 3.43/3.82 3.43/3.82 ============================== end of statistics ===================== 3.43/3.82 3.43/3.82 ============================== end of search ========================= 3.43/3.82 3.43/3.82 THEOREM PROVED 3.43/3.82 % SZS status Theorem 3.43/3.82 3.43/3.82 Exiting with 1 proof. 3.43/3.82 3.43/3.82 Process 9423 exit (max_proofs) Tue Aug 9 05:05:54 2022 3.43/3.82 Prover9 interrupted 3.43/3.82 EOF