TSTP Solution File: NUM422+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM422+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:08:17 EDT 2022
% Result : Theorem 1.84s 2.02s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of clauses : 40 ( 21 unt; 0 nHn; 40 RR)
% Number of literals : 73 ( 31 equ; 36 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ aInteger0(A)
| aInteger0(smndt0(A)) ),
file('NUM422+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| aInteger0(sdtasdt0(A,B)) ),
file('NUM422+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtpldt0(A,B),C) ),
file('NUM422+1.p',unknown),
[] ).
cnf(5,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtpldt0(A,B),C) = sdtpldt0(A,sdtpldt0(B,C)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.4')] ).
cnf(7,axiom,
( ~ aInteger0(A)
| sdtpldt0(A,sz00) = A ),
file('NUM422+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ aInteger0(A)
| A = sdtpldt0(sz00,A) ),
file('NUM422+1.p',unknown),
[] ).
cnf(9,plain,
( ~ aInteger0(A)
| sdtpldt0(sz00,A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.2')] ).
cnf(10,axiom,
( ~ aInteger0(A)
| sdtpldt0(A,smndt0(A)) = sz00 ),
file('NUM422+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ aInteger0(A)
| sz00 = sdtpldt0(smndt0(A),A) ),
file('NUM422+1.p',unknown),
[] ).
cnf(12,plain,
( ~ aInteger0(A)
| sdtpldt0(smndt0(A),A) = sz00 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.2')] ).
cnf(15,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| sdtasdt0(A,B) = sdtasdt0(B,A) ),
file('NUM422+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ aInteger0(A)
| sdtasdt0(A,sz10) = A ),
file('NUM422+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) ),
file('NUM422+1.p',unknown),
[] ).
cnf(20,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) = sdtasdt0(A,sdtpldt0(B,C)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[19])]),
[iquote('copy,19,flip.4')] ).
cnf(21,axiom,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtasdt0(sdtpldt0(A,B),C) = sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C)) ),
file('NUM422+1.p',unknown),
[] ).
cnf(22,plain,
( ~ aInteger0(A)
| ~ aInteger0(B)
| ~ aInteger0(C)
| sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C)) = sdtasdt0(sdtpldt0(A,B),C) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[21])]),
[iquote('copy,21,flip.4')] ).
cnf(23,axiom,
( ~ aInteger0(A)
| sdtasdt0(A,sz00) = sz00 ),
file('NUM422+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ aInteger0(A)
| sz00 = sdtasdt0(sz00,A) ),
file('NUM422+1.p',unknown),
[] ).
cnf(25,plain,
( ~ aInteger0(A)
| sdtasdt0(sz00,A) = sz00 ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[24])]),
[iquote('copy,24,flip.2')] ).
cnf(26,axiom,
sdtasdt0(smndt0(sz10),xa) != smndt0(xa),
file('NUM422+1.p',unknown),
[] ).
cnf(27,plain,
smndt0(xa) != sdtasdt0(smndt0(sz10),xa),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[26])]),
[iquote('copy,26,flip.1')] ).
cnf(29,axiom,
aInteger0(sz00),
file('NUM422+1.p',unknown),
[] ).
cnf(30,axiom,
aInteger0(sz10),
file('NUM422+1.p',unknown),
[] ).
cnf(31,axiom,
aInteger0(xa),
file('NUM422+1.p',unknown),
[] ).
cnf(78,plain,
sdtpldt0(sz10,smndt0(sz10)) = sz00,
inference(hyper,[status(thm)],[30,10]),
[iquote('hyper,30,10')] ).
cnf(90,plain,
aInteger0(smndt0(sz10)),
inference(hyper,[status(thm)],[30,1]),
[iquote('hyper,30,1')] ).
cnf(98,plain,
sdtasdt0(xa,sz00) = sz00,
inference(hyper,[status(thm)],[31,23]),
[iquote('hyper,31,23')] ).
cnf(174,plain,
sdtasdt0(xa,sz10) = xa,
inference(hyper,[status(thm)],[31,16]),
[iquote('hyper,31,16')] ).
cnf(186,plain,
sdtpldt0(smndt0(xa),xa) = sz00,
inference(hyper,[status(thm)],[31,12]),
[iquote('hyper,31,12')] ).
cnf(190,plain,
sdtpldt0(sz00,xa) = xa,
inference(hyper,[status(thm)],[31,9]),
[iquote('hyper,31,9')] ).
cnf(220,plain,
aInteger0(smndt0(xa)),
inference(hyper,[status(thm)],[31,1]),
[iquote('hyper,31,1')] ).
cnf(410,plain,
sdtasdt0(sz00,smndt0(sz10)) = sz00,
inference(hyper,[status(thm)],[90,25]),
[iquote('hyper,90,25')] ).
cnf(440,plain,
sdtpldt0(sz00,sdtasdt0(xa,smndt0(sz10))) = sdtasdt0(xa,smndt0(sz10)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[90,22,29,31]),410,190]),
[iquote('hyper,90,22,29,31,demod,410,190')] ).
cnf(494,plain,
sdtpldt0(xa,sdtasdt0(xa,smndt0(sz10))) = sz00,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[90,20,31,30]),174,78,98]),
[iquote('hyper,90,20,31,30,demod,174,78,98')] ).
cnf(554,plain,
sdtasdt0(smndt0(sz10),xa) = sdtasdt0(xa,smndt0(sz10)),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[90,15,31])]),
[iquote('hyper,90,15,31,flip.1')] ).
cnf(634,plain,
aInteger0(sdtasdt0(xa,smndt0(sz10))),
inference(hyper,[status(thm)],[90,3,31]),
[iquote('hyper,90,3,31')] ).
cnf(668,plain,
smndt0(xa) != sdtasdt0(xa,smndt0(sz10)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[27]),554]),
[iquote('back_demod,27,demod,554')] ).
cnf(1029,plain,
sdtpldt0(smndt0(xa),sz00) = smndt0(xa),
inference(hyper,[status(thm)],[220,7]),
[iquote('hyper,220,7')] ).
cnf(4825,plain,
smndt0(xa) = sdtasdt0(xa,smndt0(sz10)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[634,5,220,31]),186,440,494,1029])]),
[iquote('hyper,634,5,220,31,demod,186,440,494,1029,flip.1')] ).
cnf(4827,plain,
$false,
inference(binary,[status(thm)],[4825,668]),
[iquote('binary,4825.1,668.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM422+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n004.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:49:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.66/1.85 ----- Otter 3.3f, August 2004 -----
% 1.66/1.85 The process was started by sandbox2 on n004.cluster.edu,
% 1.66/1.85 Wed Jul 27 09:49:21 2022
% 1.66/1.85 The command was "./otter". The process ID is 19999.
% 1.66/1.85
% 1.66/1.85 set(prolog_style_variables).
% 1.66/1.85 set(auto).
% 1.66/1.85 dependent: set(auto1).
% 1.66/1.85 dependent: set(process_input).
% 1.66/1.85 dependent: clear(print_kept).
% 1.66/1.85 dependent: clear(print_new_demod).
% 1.66/1.85 dependent: clear(print_back_demod).
% 1.66/1.85 dependent: clear(print_back_sub).
% 1.66/1.85 dependent: set(control_memory).
% 1.66/1.85 dependent: assign(max_mem, 12000).
% 1.66/1.85 dependent: assign(pick_given_ratio, 4).
% 1.66/1.85 dependent: assign(stats_level, 1).
% 1.66/1.85 dependent: assign(max_seconds, 10800).
% 1.66/1.85 clear(print_given).
% 1.66/1.85
% 1.66/1.85 formula_list(usable).
% 1.66/1.85 all A (A=A).
% 1.66/1.85 all W0 (aInteger0(W0)->$T).
% 1.66/1.85 aInteger0(sz00).
% 1.66/1.85 aInteger0(sz10).
% 1.66/1.85 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 1.66/1.85 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 1.66/1.85 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 1.66/1.85 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 1.66/1.85 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 1.66/1.85 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 1.66/1.85 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 1.66/1.85 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 1.66/1.85 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 1.66/1.85 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 1.66/1.85 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2))&sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2))).
% 1.66/1.85 all W0 (aInteger0(W0)->sdtasdt0(W0,sz00)=sz00&sz00=sdtasdt0(sz00,W0)).
% 1.66/1.85 aInteger0(xa).
% 1.66/1.85 sdtasdt0(smndt0(sz10),xa)!=smndt0(xa).
% 1.66/1.85 end_of_list.
% 1.66/1.85
% 1.66/1.85 -------> usable clausifies to:
% 1.66/1.85
% 1.66/1.85 list(usable).
% 1.66/1.85 0 [] A=A.
% 1.66/1.85 0 [] -aInteger0(W0)|$T.
% 1.66/1.85 0 [] aInteger0(sz00).
% 1.66/1.85 0 [] aInteger0(sz10).
% 1.66/1.85 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 1.66/1.85 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 1.66/1.85 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 1.66/1.85 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 1.66/1.85 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 1.66/1.85 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 1.66/1.85 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 1.66/1.85 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 1.66/1.85 0 [] -aInteger0(W0)|sdtasdt0(W0,sz00)=sz00.
% 1.66/1.85 0 [] -aInteger0(W0)|sz00=sdtasdt0(sz00,W0).
% 1.66/1.85 0 [] aInteger0(xa).
% 1.66/1.85 0 [] sdtasdt0(smndt0(sz10),xa)!=smndt0(xa).
% 1.66/1.85 end_of_list.
% 1.66/1.85
% 1.66/1.85 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.66/1.85
% 1.66/1.85 This is a Horn set with equality. The strategy will be
% 1.66/1.85 Knuth-Bendix and hyper_res, with positive clauses in
% 1.66/1.85 sos and nonpositive clauses in usable.
% 1.66/1.85
% 1.66/1.85 dependent: set(knuth_bendix).
% 1.66/1.85 dependent: set(anl_eq).
% 1.66/1.85 dependent: set(para_from).
% 1.66/1.85 dependent: set(para_into).
% 1.66/1.85 dependent: clear(para_from_right).
% 1.66/1.85 dependent: clear(para_into_right).
% 1.66/1.85 dependent: set(para_from_vars).
% 1.66/1.85 dependent: set(eq_units_both_ways).
% 1.66/1.85 dependent: set(dynamic_demod_all).
% 1.66/1.85 dependent: set(dynamic_demod).
% 1.66/1.85 dependent: set(order_eq).
% 1.66/1.85 dependent: set(back_demod).
% 1.66/1.85 dependent: set(lrpo).
% 1.66/1.85 dependent: set(hyper_res).
% 1.66/1.85 dependent: clear(order_hyper).
% 1.66/1.85
% 1.66/1.85 ------------> process usable:
% 1.66/1.85 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 1.66/1.85 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 1.66/1.85 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 1.84/2.02 ** KEPT (pick-wt=17): 5 [copy,4,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtpldt0(A,B),C)=sdtpldt0(A,sdtpldt0(B,C)).
% 1.84/2.02 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 1.84/2.02 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 1.84/2.02 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 1.84/2.02 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 1.84/2.02 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 1.84/2.02 ** KEPT (pick-wt=17): 14 [copy,13,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtasdt0(sdtasdt0(A,B),C)=sdtasdt0(A,sdtasdt0(B,C)).
% 1.84/2.02 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 1.84/2.02 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 1.84/2.02 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 1.84/2.02 ** KEPT (pick-wt=19): 20 [copy,19,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C))=sdtasdt0(A,sdtpldt0(B,C)).
% 1.84/2.02 ** KEPT (pick-wt=19): 22 [copy,21,flip.4] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|sdtpldt0(sdtasdt0(A,C),sdtasdt0(B,C))=sdtasdt0(sdtpldt0(A,B),C).
% 1.84/2.02 ** KEPT (pick-wt=7): 23 [] -aInteger0(A)|sdtasdt0(A,sz00)=sz00.
% 1.84/2.02 ** KEPT (pick-wt=7): 25 [copy,24,flip.2] -aInteger0(A)|sdtasdt0(sz00,A)=sz00.
% 1.84/2.02 ** KEPT (pick-wt=7): 27 [copy,26,flip.1] smndt0(xa)!=sdtasdt0(smndt0(sz10),xa).
% 1.84/2.02
% 1.84/2.02 ------------> process sos:
% 1.84/2.02 ** KEPT (pick-wt=3): 28 [] A=A.
% 1.84/2.02 ** KEPT (pick-wt=2): 29 [] aInteger0(sz00).
% 1.84/2.02 ** KEPT (pick-wt=2): 30 [] aInteger0(sz10).
% 1.84/2.02 ** KEPT (pick-wt=2): 31 [] aInteger0(xa).
% 1.84/2.02 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] A=A.
% 1.84/2.02
% 1.84/2.02 ======= end of input processing =======
% 1.84/2.02
% 1.84/2.02 =========== start of search ===========
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Resetting weight limit to 7.
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Resetting weight limit to 7.
% 1.84/2.02
% 1.84/2.02 sos_size=1102
% 1.84/2.02
% 1.84/2.02 -------- PROOF --------
% 1.84/2.02
% 1.84/2.02 ----> UNIT CONFLICT at 0.17 sec ----> 4827 [binary,4825.1,668.1] $F.
% 1.84/2.02
% 1.84/2.02 Length of proof is 22. Level of proof is 4.
% 1.84/2.02
% 1.84/2.02 ---------------- PROOF ----------------
% 1.84/2.02 % SZS status Theorem
% 1.84/2.02 % SZS output start Refutation
% See solution above
% 1.84/2.02 ------------ end of proof -------------
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Search stopped by max_proofs option.
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Search stopped by max_proofs option.
% 1.84/2.02
% 1.84/2.02 ============ end of search ============
% 1.84/2.02
% 1.84/2.02 -------------- statistics -------------
% 1.84/2.02 clauses given 29
% 1.84/2.02 clauses generated 6303
% 1.84/2.02 clauses kept 2456
% 1.84/2.02 clauses forward subsumed 3200
% 1.84/2.02 clauses back subsumed 0
% 1.84/2.02 Kbytes malloced 4882
% 1.84/2.02
% 1.84/2.02 ----------- times (seconds) -----------
% 1.84/2.02 user CPU time 0.17 (0 hr, 0 min, 0 sec)
% 1.84/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.84/2.02 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.84/2.02
% 1.84/2.02 That finishes the proof of the theorem.
% 1.84/2.02
% 1.84/2.02 Process 19999 finished Wed Jul 27 09:49:23 2022
% 1.84/2.02 Otter interrupted
% 1.84/2.02 PROOF FOUND
%------------------------------------------------------------------------------