TSTP Solution File: NUM423+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM423+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:18 EDT 2022
% Result : Theorem 2.04s 2.25s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 15 ( 10 unt; 2 nHn; 15 RR)
% Number of literals : 27 ( 11 equ; 13 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
( ~ aInteger0(A)
| sdtpldt0(A,smndt0(A)) = sz00 ),
file('NUM423+3.p',unknown),
[] ).
cnf(23,axiom,
( ~ aInteger0(A)
| sdtasdt0(A,sz00) = sz00 ),
file('NUM423+3.p',unknown),
[] ).
cnf(27,axiom,
( ~ aInteger0(A)
| smndt0(A) = sdtasdt0(A,smndt0(sz10)) ),
file('NUM423+3.p',unknown),
[] ).
cnf(33,axiom,
( ~ aInteger0(A)
| aDivisorOf0(B,A)
| ~ aInteger0(B)
| B = sz00
| ~ aInteger0(C)
| sdtasdt0(B,C) != A ),
file('NUM423+3.p',unknown),
[] ).
cnf(36,axiom,
xq != sz00,
file('NUM423+3.p',unknown),
[] ).
cnf(38,axiom,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))),
file('NUM423+3.p',unknown),
[] ).
cnf(58,plain,
( ~ aInteger0(A)
| aDivisorOf0(B,A)
| ~ aInteger0(B)
| B = sz00
| sdtasdt0(B,A) != A ),
inference(factor,[status(thm)],[33]),
[iquote('factor,33.1.5')] ).
cnf(74,axiom,
aInteger0(sz00),
file('NUM423+3.p',unknown),
[] ).
cnf(76,axiom,
aInteger0(xa),
file('NUM423+3.p',unknown),
[] ).
cnf(77,axiom,
aInteger0(xq),
file('NUM423+3.p',unknown),
[] ).
cnf(283,plain,
smndt0(xa) = sdtasdt0(xa,smndt0(sz10)),
inference(hyper,[status(thm)],[76,27]),
[iquote('hyper,76,27')] ).
cnf(341,plain,
sdtpldt0(xa,sdtasdt0(xa,smndt0(sz10))) = sz00,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[76,10]),283]),
[iquote('hyper,76,10,demod,283')] ).
cnf(366,plain,
~ aDivisorOf0(xq,sz00),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[38]),283,341]),
[iquote('back_demod,38,demod,283,341')] ).
cnf(577,plain,
sdtasdt0(xq,sz00) = sz00,
inference(hyper,[status(thm)],[77,23]),
[iquote('hyper,77,23')] ).
cnf(5465,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[577,58,74,77]),366,36]),
[iquote('hyper,577,58,74,77,unit_del,366,36')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM423+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n028.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 09:47:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.82/1.98 ----- Otter 3.3f, August 2004 -----
% 1.82/1.98 The process was started by sandbox on n028.cluster.edu,
% 1.82/1.98 Wed Jul 27 09:47:49 2022
% 1.82/1.98 The command was "./otter". The process ID is 30247.
% 1.82/1.98
% 1.82/1.98 set(prolog_style_variables).
% 1.82/1.98 set(auto).
% 1.82/1.98 dependent: set(auto1).
% 1.82/1.98 dependent: set(process_input).
% 1.82/1.98 dependent: clear(print_kept).
% 1.82/1.98 dependent: clear(print_new_demod).
% 1.82/1.98 dependent: clear(print_back_demod).
% 1.82/1.98 dependent: clear(print_back_sub).
% 1.82/1.98 dependent: set(control_memory).
% 1.82/1.98 dependent: assign(max_mem, 12000).
% 1.82/1.98 dependent: assign(pick_given_ratio, 4).
% 1.82/1.98 dependent: assign(stats_level, 1).
% 1.82/1.98 dependent: assign(max_seconds, 10800).
% 1.82/1.98 clear(print_given).
% 1.82/1.98
% 1.82/1.98 formula_list(usable).
% 1.82/1.98 all A (A=A).
% 1.82/1.98 all W0 (aInteger0(W0)->$T).
% 1.82/1.98 aInteger0(sz00).
% 1.82/1.98 aInteger0(sz10).
% 1.82/1.98 all W0 (aInteger0(W0)->aInteger0(smndt0(W0))).
% 1.82/1.98 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtpldt0(W0,W1))).
% 1.82/1.98 all W0 W1 (aInteger0(W0)&aInteger0(W1)->aInteger0(sdtasdt0(W0,W1))).
% 1.82/1.98 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2)).
% 1.82/1.98 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtpldt0(W0,W1)=sdtpldt0(W1,W0)).
% 1.82/1.98 all W0 (aInteger0(W0)->sdtpldt0(W0,sz00)=W0&W0=sdtpldt0(sz00,W0)).
% 1.82/1.98 all W0 (aInteger0(W0)->sdtpldt0(W0,smndt0(W0))=sz00&sz00=sdtpldt0(smndt0(W0),W0)).
% 1.82/1.98 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)->sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2)).
% 1.82/1.98 all W0 W1 (aInteger0(W0)&aInteger0(W1)->sdtasdt0(W0,W1)=sdtasdt0(W1,W0)).
% 1.82/1.98 all W0 (aInteger0(W0)->sdtasdt0(W0,sz10)=W0&W0=sdtasdt0(sz10,W0)).
% 1.82/1.98 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.82/1.98 all W0 (aInteger0(W0)->sdtasdt0(W0,sz00)=sz00&sz00=sdtasdt0(sz00,W0)).
% 1.82/1.98 all W0 (aInteger0(W0)->sdtasdt0(smndt0(sz10),W0)=smndt0(W0)&smndt0(W0)=sdtasdt0(W0,smndt0(sz10))).
% 1.82/1.98 all W0 W1 (aInteger0(W0)&aInteger0(W1)-> (sdtasdt0(W0,W1)=sz00->W0=sz00|W1=sz00)).
% 1.82/1.98 all W0 (aInteger0(W0)-> (all W1 (aDivisorOf0(W1,W0)<->aInteger0(W1)&W1!=sz00& (exists W2 (aInteger0(W2)&sdtasdt0(W1,W2)=W0))))).
% 1.82/1.98 all W0 W1 W2 (aInteger0(W0)&aInteger0(W1)&aInteger0(W2)&W2!=sz00-> (sdte_qdtlpzmzozddtrp0(W0,W1,W2)<->aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))))).
% 1.82/1.98 aInteger0(xa).
% 1.82/1.98 aInteger0(xq).
% 1.82/1.98 xq!=sz00.
% 1.82/1.98 -((exists W0 (aInteger0(W0)&sdtasdt0(xq,W0)=sdtpldt0(xa,smndt0(xa))))|aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))|sdte_qdtlpzmzozddtrp0(xa,xa,xq)).
% 1.82/1.98 end_of_list.
% 1.82/1.98
% 1.82/1.98 -------> usable clausifies to:
% 1.82/1.98
% 1.82/1.98 list(usable).
% 1.82/1.98 0 [] A=A.
% 1.82/1.98 0 [] -aInteger0(W0)|$T.
% 1.82/1.98 0 [] aInteger0(sz00).
% 1.82/1.98 0 [] aInteger0(sz10).
% 1.82/1.98 0 [] -aInteger0(W0)|aInteger0(smndt0(W0)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtpldt0(W0,W1)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)|aInteger0(sdtasdt0(W0,W1)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtpldt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtpldt0(W0,W1),W2).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtpldt0(W0,W1)=sdtpldt0(W1,W0).
% 1.82/1.98 0 [] -aInteger0(W0)|sdtpldt0(W0,sz00)=W0.
% 1.82/1.98 0 [] -aInteger0(W0)|W0=sdtpldt0(sz00,W0).
% 1.82/1.98 0 [] -aInteger0(W0)|sdtpldt0(W0,smndt0(W0))=sz00.
% 1.82/1.98 0 [] -aInteger0(W0)|sz00=sdtpldt0(smndt0(W0),W0).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtasdt0(W1,W2))=sdtasdt0(sdtasdt0(W0,W1),W2).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)=sdtasdt0(W1,W0).
% 1.82/1.98 0 [] -aInteger0(W0)|sdtasdt0(W0,sz10)=W0.
% 1.82/1.98 0 [] -aInteger0(W0)|W0=sdtasdt0(sz10,W0).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(W0,sdtpldt0(W1,W2))=sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|sdtasdt0(sdtpldt0(W0,W1),W2)=sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)).
% 1.82/1.98 0 [] -aInteger0(W0)|sdtasdt0(W0,sz00)=sz00.
% 1.82/1.98 0 [] -aInteger0(W0)|sz00=sdtasdt0(sz00,W0).
% 1.82/1.98 0 [] -aInteger0(W0)|sdtasdt0(smndt0(sz10),W0)=smndt0(W0).
% 1.82/1.98 0 [] -aInteger0(W0)|smndt0(W0)=sdtasdt0(W0,smndt0(sz10)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aInteger0(W1)|sdtasdt0(W0,W1)!=sz00|W0=sz00|W1=sz00.
% 1.82/1.98 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0(W1).
% 1.82/1.98 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|W1!=sz00.
% 1.82/1.98 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|aInteger0($f1(W0,W1)).
% 1.82/1.98 0 [] -aInteger0(W0)| -aDivisorOf0(W1,W0)|sdtasdt0(W1,$f1(W0,W1))=W0.
% 1.82/1.99 0 [] -aInteger0(W0)|aDivisorOf0(W1,W0)| -aInteger0(W1)|W1=sz00| -aInteger0(W2)|sdtasdt0(W1,W2)!=W0.
% 1.82/1.99 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00| -sdte_qdtlpzmzozddtrp0(W0,W1,W2)|aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.82/1.99 0 [] -aInteger0(W0)| -aInteger0(W1)| -aInteger0(W2)|W2=sz00|sdte_qdtlpzmzozddtrp0(W0,W1,W2)| -aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))).
% 1.82/1.99 0 [] aInteger0(xa).
% 1.82/1.99 0 [] aInteger0(xq).
% 1.82/1.99 0 [] xq!=sz00.
% 1.82/1.99 0 [] -aInteger0(W0)|sdtasdt0(xq,W0)!=sdtpldt0(xa,smndt0(xa)).
% 1.82/1.99 0 [] -aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))).
% 1.82/1.99 0 [] -sdte_qdtlpzmzozddtrp0(xa,xa,xq).
% 1.82/1.99 end_of_list.
% 1.82/1.99
% 1.82/1.99 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.82/1.99
% 1.82/1.99 This ia a non-Horn set with equality. The strategy will be
% 1.82/1.99 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.82/1.99 deletion, with positive clauses in sos and nonpositive
% 1.82/1.99 clauses in usable.
% 1.82/1.99
% 1.82/1.99 dependent: set(knuth_bendix).
% 1.82/1.99 dependent: set(anl_eq).
% 1.82/1.99 dependent: set(para_from).
% 1.82/1.99 dependent: set(para_into).
% 1.82/1.99 dependent: clear(para_from_right).
% 1.82/1.99 dependent: clear(para_into_right).
% 1.82/1.99 dependent: set(para_from_vars).
% 1.82/1.99 dependent: set(eq_units_both_ways).
% 1.82/1.99 dependent: set(dynamic_demod_all).
% 1.82/1.99 dependent: set(dynamic_demod).
% 1.82/1.99 dependent: set(order_eq).
% 1.82/1.99 dependent: set(back_demod).
% 1.82/1.99 dependent: set(lrpo).
% 1.82/1.99 dependent: set(hyper_res).
% 1.82/1.99 dependent: set(unit_deletion).
% 1.82/1.99 dependent: set(factor).
% 1.82/1.99
% 1.82/1.99 ------------> process usable:
% 1.82/1.99 ** KEPT (pick-wt=5): 1 [] -aInteger0(A)|aInteger0(smndt0(A)).
% 1.82/1.99 ** KEPT (pick-wt=8): 2 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtpldt0(A,B)).
% 1.82/1.99 ** KEPT (pick-wt=8): 3 [] -aInteger0(A)| -aInteger0(B)|aInteger0(sdtasdt0(A,B)).
% 1.82/1.99 ** 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.82/1.99 ** KEPT (pick-wt=11): 6 [] -aInteger0(A)| -aInteger0(B)|sdtpldt0(A,B)=sdtpldt0(B,A).
% 1.82/1.99 ** KEPT (pick-wt=7): 7 [] -aInteger0(A)|sdtpldt0(A,sz00)=A.
% 1.82/1.99 ** KEPT (pick-wt=7): 9 [copy,8,flip.2] -aInteger0(A)|sdtpldt0(sz00,A)=A.
% 1.82/1.99 ** KEPT (pick-wt=8): 10 [] -aInteger0(A)|sdtpldt0(A,smndt0(A))=sz00.
% 1.82/1.99 ** KEPT (pick-wt=8): 12 [copy,11,flip.2] -aInteger0(A)|sdtpldt0(smndt0(A),A)=sz00.
% 1.82/1.99 ** 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.82/1.99 ** KEPT (pick-wt=11): 15 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)=sdtasdt0(B,A).
% 1.82/1.99 ** KEPT (pick-wt=7): 16 [] -aInteger0(A)|sdtasdt0(A,sz10)=A.
% 1.82/1.99 ** KEPT (pick-wt=7): 18 [copy,17,flip.2] -aInteger0(A)|sdtasdt0(sz10,A)=A.
% 1.82/1.99 ** 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.82/1.99 ** 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.82/1.99 ** KEPT (pick-wt=7): 23 [] -aInteger0(A)|sdtasdt0(A,sz00)=sz00.
% 1.82/1.99 ** KEPT (pick-wt=7): 25 [copy,24,flip.2] -aInteger0(A)|sdtasdt0(sz00,A)=sz00.
% 1.82/1.99 ** KEPT (pick-wt=9): 26 [] -aInteger0(A)|sdtasdt0(smndt0(sz10),A)=smndt0(A).
% 1.82/1.99 ** KEPT (pick-wt=9): 27 [] -aInteger0(A)|smndt0(A)=sdtasdt0(A,smndt0(sz10)).
% 1.82/1.99 ** KEPT (pick-wt=15): 28 [] -aInteger0(A)| -aInteger0(B)|sdtasdt0(A,B)!=sz00|A=sz00|B=sz00.
% 1.82/1.99 ** KEPT (pick-wt=7): 29 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0(B).
% 1.82/1.99 ** KEPT (pick-wt=8): 30 [] -aInteger0(A)| -aDivisorOf0(B,A)|B!=sz00.
% 1.82/1.99 ** KEPT (pick-wt=9): 31 [] -aInteger0(A)| -aDivisorOf0(B,A)|aInteger0($f1(A,B)).
% 1.82/1.99 ** KEPT (pick-wt=12): 32 [] -aInteger0(A)| -aDivisorOf0(B,A)|sdtasdt0(B,$f1(A,B))=A.
% 1.82/1.99 ** KEPT (pick-wt=17): 33 [] -aInteger0(A)|aDivisorOf0(B,A)| -aInteger0(B)|B=sz00| -aInteger0(C)|sdtasdt0(B,C)!=A.
% 1.82/1.99 ** KEPT (pick-wt=19): 34 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00| -sdte_qdtlpzmzozddtrp0(A,B,C)|aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 1.82/1.99 ** KEPT (pick-wt=19): 35 [] -aInteger0(A)| -aInteger0(B)| -aInteger0(C)|C=sz00|sdte_qdtlpzmzozddtrp0(A,B,C)| -aDivisorOf0(C,sdtpldt0(A,smndt0(B))).
% 1.82/1.99 ** KEPT (pick-wt=3): 36 [] xq!=sz00.
% 1.82/1.99 ** KEPT (pick-wt=10): 37 [] -aInteger0(A)|sdtasdt0(xq,A)!=sdtpldt0(xa,smndt0(xa)).
% 1.82/1.99 ** KEPT (pick-wt=6): 38 [] -aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))).
% 2.04/2.25 ** KEPT (pick-wt=4): 39 [] -sdte_qdtlpzmzozddtrp0(xa,xa,xq).
% 2.04/2.25
% 2.04/2.25 ------------> process sos:
% 2.04/2.25 ** KEPT (pick-wt=3): 73 [] A=A.
% 2.04/2.25 ** KEPT (pick-wt=2): 74 [] aInteger0(sz00).
% 2.04/2.25 ** KEPT (pick-wt=2): 75 [] aInteger0(sz10).
% 2.04/2.25 ** KEPT (pick-wt=2): 76 [] aInteger0(xa).
% 2.04/2.25 ** KEPT (pick-wt=2): 77 [] aInteger0(xq).
% 2.04/2.25 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] A=A.
% 2.04/2.25 73 back subsumes 49.
% 2.04/2.25 73 back subsumes 45.
% 2.04/2.25
% 2.04/2.25 ======= end of input processing =======
% 2.04/2.25
% 2.04/2.25 =========== start of search ===========
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 8.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 8.
% 2.04/2.25
% 2.04/2.25 sos_size=1715
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 7.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 7.
% 2.04/2.25
% 2.04/2.25 sos_size=1769
% 2.04/2.25
% 2.04/2.25 -------- PROOF --------
% 2.04/2.25
% 2.04/2.25 -----> EMPTY CLAUSE at 0.26 sec ----> 5465 [hyper,577,58,74,77,unit_del,366,36] $F.
% 2.04/2.25
% 2.04/2.25 Length of proof is 5. Level of proof is 3.
% 2.04/2.25
% 2.04/2.25 ---------------- PROOF ----------------
% 2.04/2.25 % SZS status Theorem
% 2.04/2.25 % SZS output start Refutation
% See solution above
% 2.04/2.25 ------------ end of proof -------------
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25 ============ end of search ============
% 2.04/2.25
% 2.04/2.25 -------------- statistics -------------
% 2.04/2.25 clauses given 35
% 2.04/2.25 clauses generated 15226
% 2.04/2.25 clauses kept 2868
% 2.04/2.25 clauses forward subsumed 4704
% 2.04/2.25 clauses back subsumed 2
% 2.04/2.25 Kbytes malloced 4882
% 2.04/2.25
% 2.04/2.25 ----------- times (seconds) -----------
% 2.04/2.25 user CPU time 0.26 (0 hr, 0 min, 0 sec)
% 2.04/2.25 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.04/2.25 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.04/2.25
% 2.04/2.25 That finishes the proof of the theorem.
% 2.04/2.25
% 2.04/2.25 Process 30247 finished Wed Jul 27 09:47:50 2022
% 2.04/2.25 Otter interrupted
% 2.04/2.25 PROOF FOUND
%------------------------------------------------------------------------------