TSTP Solution File: MGT005-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:05:56 EDT 2022
% Result : Unsatisfiable 2.34s 2.55s
% Output : Refutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of clauses : 32 ( 28 unt; 1 nHn; 32 RR)
% Number of literals : 67 ( 5 equ; 37 neg)
% Maximal clause size : 19 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ greater(D,B)
| ~ greater(C,D)
| organization(A,D) ),
file('MGT005-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ reorganization(A,B,C)
| greater(C,B) ),
file('MGT005-2.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ reorganization(A,B,F)
| ~ reorganization(C,B,D)
| ~ reorganization_type(A,G,B)
| ~ reorganization_type(C,G,B)
| ~ complexity(A,H,B)
| ~ complexity(C,I,B)
| ~ greater(I,H)
| greater(D,F) ),
file('MGT005-2.p',unknown),
[] ).
cnf(12,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| ~ organization(A,D)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ survival_chance(A,F,B)
| ~ survival_chance(C,F,B)
| ~ reorganization(A,B,D)
| ~ reorganization(C,B,G)
| ~ reorganization_type(A,H,B)
| ~ reorganization_type(C,H,B)
| ~ survival_chance(A,I,D)
| ~ survival_chance(C,J,D)
| ~ complexity(A,K,B)
| ~ complexity(C,L,B)
| ~ greater(L,K)
| greater(I,J)
| I = J ),
file('MGT005-2.p',unknown),
[] ).
cnf(21,axiom,
~ greater(sk10,sk11),
file('MGT005-2.p',unknown),
[] ).
cnf(22,axiom,
sk10 != sk11,
file('MGT005-2.p',unknown),
[] ).
cnf(23,plain,
sk11 != sk10,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(62,axiom,
organization(sk5,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(63,axiom,
organization(sk6,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(64,axiom,
organization(sk5,sk17),
file('MGT005-2.p',unknown),
[] ).
cnf(65,axiom,
organization(sk6,sk17),
file('MGT005-2.p',unknown),
[] ).
cnf(66,axiom,
class(sk5,sk8,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(67,axiom,
class(sk6,sk8,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(68,axiom,
survival_chance(sk5,sk9,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(69,axiom,
survival_chance(sk6,sk9,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(70,axiom,
reorganization(sk5,sk15,sk16),
file('MGT005-2.p',unknown),
[] ).
cnf(71,axiom,
reorganization(sk6,sk15,sk17),
file('MGT005-2.p',unknown),
[] ).
cnf(72,axiom,
reorganization_type(sk5,sk7,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(73,axiom,
reorganization_type(sk6,sk7,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(75,axiom,
survival_chance(sk5,sk10,sk14),
file('MGT005-2.p',unknown),
[] ).
cnf(76,axiom,
survival_chance(sk6,sk11,sk14),
file('MGT005-2.p',unknown),
[] ).
cnf(77,axiom,
complexity(sk5,sk12,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(78,axiom,
complexity(sk6,sk13,sk15),
file('MGT005-2.p',unknown),
[] ).
cnf(79,axiom,
greater(sk13,sk12),
file('MGT005-2.p',unknown),
[] ).
cnf(80,axiom,
sk14 = sk16,
file('MGT005-2.p',unknown),
[] ).
cnf(82,plain,
sk16 = sk14,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[80])]),
[iquote('copy,80,flip.1')] ).
cnf(84,plain,
reorganization(sk5,sk15,sk14),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[70]),82]),
[iquote('back_demod,70,demod,82')] ).
cnf(287,plain,
greater(sk17,sk14),
inference(hyper,[status(thm)],[84,11,62,63,65,66,67,71,72,73,77,78,79]),
[iquote('hyper,84,11,62,63,65,66,67,71,72,73,77,78,79')] ).
cnf(288,plain,
greater(sk14,sk15),
inference(hyper,[status(thm)],[84,8]),
[iquote('hyper,84,8')] ).
cnf(309,plain,
organization(sk6,sk14),
inference(hyper,[status(thm)],[288,7,63,65,287]),
[iquote('hyper,288,7,63,65,287')] ).
cnf(310,plain,
organization(sk5,sk14),
inference(hyper,[status(thm)],[288,7,62,64,287]),
[iquote('hyper,288,7,62,64,287')] ).
cnf(329,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[310,12,62,63,309,66,67,68,69,84,71,72,73,75,76,77,78,79]),21,23]),
[iquote('hyper,310,12,62,63,309,66,67,68,69,84,71,72,73,75,76,77,78,79,unit_del,21,23')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 03:58:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.84/2.05 ----- Otter 3.3f, August 2004 -----
% 1.84/2.05 The process was started by sandbox on n021.cluster.edu,
% 1.84/2.05 Wed Jul 27 03:58:08 2022
% 1.84/2.05 The command was "./otter". The process ID is 31379.
% 1.84/2.05
% 1.84/2.05 set(prolog_style_variables).
% 1.84/2.05 set(auto).
% 1.84/2.05 dependent: set(auto1).
% 1.84/2.05 dependent: set(process_input).
% 1.84/2.05 dependent: clear(print_kept).
% 1.84/2.05 dependent: clear(print_new_demod).
% 1.84/2.05 dependent: clear(print_back_demod).
% 1.84/2.05 dependent: clear(print_back_sub).
% 1.84/2.05 dependent: set(control_memory).
% 1.84/2.05 dependent: assign(max_mem, 12000).
% 1.84/2.05 dependent: assign(pick_given_ratio, 4).
% 1.84/2.05 dependent: assign(stats_level, 1).
% 1.84/2.05 dependent: assign(max_seconds, 10800).
% 1.84/2.05 clear(print_given).
% 1.84/2.05
% 1.84/2.05 list(usable).
% 1.84/2.05 0 [] A=A.
% 1.84/2.05 0 [] -greater(A,B)|A!=B.
% 1.84/2.05 0 [] -greater(A,B)| -greater(B,A).
% 1.84/2.05 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.84/2.05 0 [] -survival_chance(A,B,C)| -survival_chance(D,E,C)|greater(p1,p2)|p1=p2|greater(p2,p1).
% 1.84/2.05 0 [] -organization(A,B)|survival_chance(A,sk1(B,A),B).
% 1.84/2.05 0 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.84/2.05 0 [] -reorganization(A,B,C)|greater(C,B).
% 1.84/2.05 0 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.84/2.05 0 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.84/2.05 0 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 1.84/2.05 0 [] -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 1.84/2.05 0 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater(sk2(A,B,H,F,G,D,E,C),B).
% 1.84/2.05 0 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater(A,sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 0 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(C,sk3(A,B,H,F,G,D,E,C),sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 0 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(E,sk4(A,B,H,F,G,D,E,C),sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 0 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|sk3(A,B,H,F,G,D,E,C)=sk4(A,B,H,F,G,D,E,C).
% 1.84/2.05 0 [] organization(sk5,sk15).
% 1.84/2.05 0 [] organization(sk6,sk15).
% 1.84/2.05 0 [] organization(sk5,sk17).
% 1.84/2.05 0 [] organization(sk6,sk17).
% 1.84/2.05 0 [] class(sk5,sk8,sk15).
% 1.84/2.05 0 [] class(sk6,sk8,sk15).
% 1.84/2.05 0 [] survival_chance(sk5,sk9,sk15).
% 1.84/2.05 0 [] survival_chance(sk6,sk9,sk15).
% 1.84/2.05 0 [] reorganization(sk5,sk15,sk16).
% 1.84/2.05 0 [] reorganization(sk6,sk15,sk17).
% 1.84/2.05 0 [] reorganization_type(sk5,sk7,sk15).
% 1.84/2.05 0 [] reorganization_type(sk6,sk7,sk15).
% 1.84/2.05 0 [] reorganization_free(sk5,sk16,sk17).
% 1.84/2.05 0 [] survival_chance(sk5,sk10,sk14).
% 1.84/2.05 0 [] survival_chance(sk6,sk11,sk14).
% 1.84/2.05 0 [] complexity(sk5,sk12,sk15).
% 1.84/2.05 0 [] complexity(sk6,sk13,sk15).
% 1.84/2.05 0 [] greater(sk13,sk12).
% 1.84/2.05 0 [] sk14!=sk17|greater(sk10,sk11).
% 1.84/2.05 0 [] sk14=sk16.
% 1.84/2.05 0 [] -greater(sk10,sk11).
% 1.84/2.05 0 [] sk10!=sk11.
% 1.84/2.05 end_of_list.
% 1.84/2.05
% 1.84/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 1.84/2.05
% 1.84/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.84/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.84/2.05 deletion, with positive clauses in sos and nonpositive
% 1.84/2.05 clauses in usable.
% 1.84/2.05
% 1.84/2.05 dependent: set(knuth_bendix).
% 1.84/2.05 dependent: set(anl_eq).
% 1.84/2.05 dependent: set(para_from).
% 1.84/2.05 dependent: set(para_into).
% 1.84/2.05 dependent: clear(para_from_right).
% 1.84/2.05 dependent: clear(para_into_right).
% 1.84/2.05 dependent: set(para_from_vars).
% 1.84/2.05 dependent: set(eq_units_both_ways).
% 1.84/2.05 dependent: set(dynamic_demod_all).
% 1.84/2.05 dependent: set(dynamic_demod).
% 1.84/2.05 dependent: set(order_eq).
% 1.84/2.05 dependent: set(back_demod).
% 1.84/2.05 dependent: set(lrpo).
% 1.84/2.05 dependent: set(hyper_res).
% 1.84/2.05 dependent: set(unit_deletion).
% 1.84/2.05 dependent: set(factor).
% 1.84/2.05
% 1.84/2.05 ------------> process usable:
% 1.84/2.05 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.84/2.05 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.84/2.05 ** KEPT (pick-wt=9): 3 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.84/2.05 ** KEPT (pick-wt=13): 5 [copy,4,factor_simp] -survival_chance(A,B,C)|greater(p1,p2)|p2=p1|greater(p2,p1).
% 1.84/2.05 ** KEPT (pick-wt=9): 6 [] -organization(A,B)|survival_chance(A,sk1(B,A),B).
% 1.84/2.05 ** KEPT (pick-wt=15): 7 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.84/2.05 ** KEPT (pick-wt=7): 8 [] -reorganization(A,B,C)|greater(C,B).
% 1.84/2.05 ** KEPT (pick-wt=24): 9 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.84/2.05 ** KEPT (pick-wt=30): 10 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.84/2.05 ** KEPT (pick-wt=47): 11 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 1.84/2.05 ** KEPT (pick-wt=69): 12 [] -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 1.84/2.05 ** KEPT (pick-wt=36): 13 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater(sk2(A,B,H,F,G,D,E,C),B).
% 1.84/2.05 ** KEPT (pick-wt=36): 14 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater(A,sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 ** KEPT (pick-wt=45): 15 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(C,sk3(A,B,H,F,G,D,E,C),sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 ** KEPT (pick-wt=45): 16 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(E,sk4(A,B,H,F,G,D,E,C),sk2(A,B,H,F,G,D,E,C)).
% 1.84/2.05 ** KEPT (pick-wt=44): 18 [copy,17,flip.8] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|sk4(A,B,H,F,G,D,E,C)=sk3(A,B,H,F,G,D,E,C).
% 1.84/2.05 ** KEPT (pick-wt=6): 20 [copy,19,flip.1] sk17!=sk14|greater(sk10,sk11).
% 1.84/2.05 ** KEPT (pick-wt=3): 21 [] -greater(sk10,sk11).
% 1.84/2.05 ** KEPT (pick-wt=3): 23 [copy,22,flip.1] sk11!=sk10.
% 1.84/2.05 30 back subsumes 28.
% 1.84/2.05 30 back subsumes 27.
% 1.84/2.05
% 1.84/2.05 ------------> process sos:
% 1.84/2.05 ** KEPT (pick-wt=3): 61 [] A=A.
% 1.84/2.05 ** KEPT (pick-wt=3): 62 [] organization(sk5,sk15).
% 1.84/2.05 ** KEPT (pick-wt=3): 63 [] organization(sk6,sk15).
% 1.84/2.05 ** KEPT (pick-wt=3): 64 [] organization(sk5,sk17).
% 1.84/2.05 ** KEPT (pick-wt=3): 65 [] organization(sk6,sk17).
% 1.84/2.05 ** KEPT (pick-wt=4): 66 [] class(sk5,sk8,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 67 [] class(sk6,sk8,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 68 [] survival_chance(sk5,sk9,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 69 [] survival_chance(sk6,sk9,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 70 [] reorganization(sk5,sk15,sk16).
% 1.84/2.05 ** KEPT (pick-wt=4): 71 [] reorganization(sk6,sk15,sk17).
% 1.84/2.05 ** KEPT (pick-wt=4): 72 [] reorganization_type(sk5,sk7,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 73 [] reorganization_type(sk6,sk7,sk15).
% 1.84/2.05 ** KEPT (pick-wt=4): 74 [] reorganization_free(sk5,sk16,sk17).
% 2.34/2.55 ** KEPT (pick-wt=4): 75 [] survival_chance(sk5,sk10,sk14).
% 2.34/2.55 ** KEPT (pick-wt=4): 76 [] survival_chance(sk6,sk11,sk14).
% 2.34/2.55 ** KEPT (pick-wt=4): 77 [] complexity(sk5,sk12,sk15).
% 2.34/2.55 ** KEPT (pick-wt=4): 78 [] complexity(sk6,sk13,sk15).
% 2.34/2.55 ** KEPT (pick-wt=3): 79 [] greater(sk13,sk12).
% 2.34/2.55 ** KEPT (pick-wt=3): 81 [copy,80,flip.1] sk16=sk14.
% 2.34/2.55 ---> New Demodulator: 82 [new_demod,81] sk16=sk14.
% 2.34/2.55 Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] A=A.
% 2.34/2.55 61 back subsumes 50.
% 2.34/2.55 >>>> Starting back demodulation with 82.
% 2.34/2.55 >> back demodulating 74 with 82.
% 2.34/2.55 >> back demodulating 70 with 82.
% 2.34/2.55
% 2.34/2.55 ======= end of input processing =======
% 2.34/2.55
% 2.34/2.55 =========== start of search ===========
% 2.34/2.55
% 2.34/2.55 -------- PROOF --------
% 2.34/2.55
% 2.34/2.55 -----> EMPTY CLAUSE at 0.52 sec ----> 329 [hyper,310,12,62,63,309,66,67,68,69,84,71,72,73,75,76,77,78,79,unit_del,21,23] $F.
% 2.34/2.55
% 2.34/2.55 Length of proof is 7. Level of proof is 4.
% 2.34/2.55
% 2.34/2.55 ---------------- PROOF ----------------
% 2.34/2.55 % SZS status Unsatisfiable
% 2.34/2.55 % SZS output start Refutation
% See solution above
% 2.34/2.55 ------------ end of proof -------------
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Search stopped by max_proofs option.
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Search stopped by max_proofs option.
% 2.34/2.55
% 2.34/2.55 ============ end of search ============
% 2.34/2.55
% 2.34/2.55 -------------- statistics -------------
% 2.34/2.55 clauses given 25
% 2.34/2.55 clauses generated 3013
% 2.34/2.55 clauses kept 322
% 2.34/2.55 clauses forward subsumed 2728
% 2.34/2.55 clauses back subsumed 4
% 2.34/2.55 Kbytes malloced 1953
% 2.34/2.55
% 2.34/2.55 ----------- times (seconds) -----------
% 2.34/2.55 user CPU time 0.52 (0 hr, 0 min, 0 sec)
% 2.34/2.55 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.34/2.55 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.34/2.55
% 2.34/2.55 That finishes the proof of the theorem.
% 2.34/2.55
% 2.34/2.55 Process 31379 finished Wed Jul 27 03:58:10 2022
% 2.34/2.55 Otter interrupted
% 2.34/2.55 PROOF FOUND
%------------------------------------------------------------------------------