%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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 12:56:58 EDT 2022
% Result : Unsatisfiable 2.29s 2.44s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 5 RR)
% Number of literals : 52 ( 51 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 168 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('GRP413-1.p',unknown),
[] ).
cnf(4,axiom,
multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C,
file('GRP413-1.p',unknown),
[] ).
cnf(5,plain,
multiply(A,inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),inverse(multiply(inverse(C),D))),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.2.1.1.2.1.1.1,3.1.1')] ).
cnf(8,plain,
inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),inverse(A))),D))),A)) = multiply(B,inverse(multiply(multiply(multiply(inverse(C),C),inverse(D)),C))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[4,4])]),
[iquote('para_into,3.1.1.2.1.1.2.1,3.1.1,flip.1')] ).
cnf(11,plain,
inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(multiply(B,multiply(C,inverse(multiply(multiply(multiply(inverse(D),D),inverse(E)),D))))),inverse(A))),F))),A)) = multiply(B,inverse(multiply(multiply(multiply(multiply(C,inverse(multiply(multiply(multiply(inverse(D),D),inverse(E)),D))),multiply(multiply(multiply(inverse(G),G),inverse(multiply(inverse(multiply(inverse(multiply(C,inverse(D))),inverse(G))),E))),G)),inverse(F)),multiply(multiply(multiply(inverse(G),G),inverse(multiply(inverse(multiply(inverse(multiply(C,inverse(D))),inverse(G))),E))),G)))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,8]),8]),
[iquote('para_into,7.1.1.1.1.2.1.1.1.1.1.2,7.1.1,demod,8')] ).
cnf(19,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(C)),B)))) = C,
inference(para_from,[status(thm),theory(equality)],[8,4]),
[iquote('para_from,7.1.1,3.1.1.2')] ).
cnf(24,plain,
multiply(A,inverse(multiply(multiply(multiply(multiply(B,inverse(multiply(multiply(multiply(inverse(C),C),inverse(D)),C))),multiply(multiply(multiply(inverse(E),E),inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),inverse(E))),D))),E)),inverse(multiply(inverse(multiply(A,multiply(B,inverse(multiply(multiply(multiply(inverse(C),C),inverse(D)),C))))),F))),multiply(multiply(multiply(inverse(E),E),inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),inverse(E))),D))),E)))) = F,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[8,4]),8]),
[iquote('para_from,7.1.1,3.1.1.2.1.1.2.1.1.1.2,demod,8')] ).
cnf(32,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,B)))) = multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(D))),C))),D),
inference(para_into,[status(thm),theory(equality)],[19,4]),
[iquote('para_into,19.1.1.2.2.1.1,3.1.1')] ).
cnf(33,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,multiply(C,inverse(multiply(multiply(multiply(inverse(D),D),inverse(E)),D))))) = multiply(inverse(multiply(inverse(multiply(C,inverse(D))),inverse(B))),E),
inference(para_into,[status(thm),theory(equality)],[19,8]),
[iquote('para_into,19.1.1.2.2,7.1.1')] ).
cnf(35,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),C))),A) = multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(C,B)))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[32])]),
[iquote('copy,32,flip.1')] ).
cnf(48,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),multiply(multiply(inverse(B),B),inverse(C))))),A) = C,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,19])]),
[iquote('para_into,32.1.1,19.1.1,flip.1')] ).
cnf(89,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))) = multiply(inverse(multiply(multiply(inverse(D),D),inverse(B))),multiply(multiply(inverse(D),D),inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[48,32]),48]),
[iquote('para_from,47.1.1,32.1.1.2.2.1,demod,48')] ).
cnf(90,plain,
multiply(inverse(multiply(multiply(inverse(A),A),inverse(B))),multiply(multiply(inverse(A),A),inverse(C))) = multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[89])]),
[iquote('copy,89,flip.1')] ).
cnf(91,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))) = multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))),
inference(para_into,[status(thm),theory(equality)],[90,90]),
[iquote('para_into,90.1.1,90.1.1')] ).
cnf(97,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(C))))),A) = C,
inference(para_from,[status(thm),theory(equality)],[91,48]),
[iquote('para_from,91.1.1,47.1.1.1.2.1')] ).
cnf(104,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),C))),A) = multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(B,inverse(D))),C))),D),
inference(para_into,[status(thm),theory(equality)],[97,4]),
[iquote('para_into,96.1.1.1.2.1.2,3.1.1')] ).
cnf(107,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(multiply(C,A)))))) = C,
inference(para_from,[status(thm),theory(equality)],[35,4]),
[iquote('para_from,35.1.1,3.1.1.2.1')] ).
cnf(113,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,C)) = multiply(inverse(multiply(inverse(D),inverse(B))),multiply(inverse(D),C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[33,5]),4]),
[iquote('para_into,33.1.1.2.2,5.1.1,demod,4')] ).
cnf(114,plain,
multiply(inverse(multiply(inverse(A),inverse(B))),multiply(inverse(A),C)) = multiply(inverse(multiply(D,inverse(B))),multiply(D,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[113])]),
[iquote('copy,113,flip.1')] ).
cnf(123,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,C)) = multiply(inverse(multiply(D,inverse(B))),multiply(D,C)),
inference(para_into,[status(thm),theory(equality)],[114,114]),
[iquote('para_into,114.1.1,114.1.1')] ).
cnf(133,plain,
inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,C)))),A)) = C,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[123,11]),24]),
[iquote('para_from,123.1.1,11.1.1.1.1.2.1,demod,24')] ).
cnf(140,plain,
multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(multiply(D,B)),multiply(D,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[133,123]),133]),
[iquote('para_from,132.1.1,123.1.1.1.1.2,demod,133')] ).
cnf(148,plain,
multiply(A,multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(C,inverse(B))),multiply(C,A)))),D)) = multiply(inverse(multiply(E,B)),multiply(E,D)),
inference(para_into,[status(thm),theory(equality)],[140,133]),
[iquote('para_into,140.1.1.1,132.1.1')] ).
cnf(191,plain,
multiply(inverse(A),A) = multiply(inverse(multiply(B,C)),multiply(B,C)),
inference(para_into,[status(thm),theory(equality)],[148,97]),
[iquote('para_into,148.1.1.2,96.1.1')] ).
cnf(192,plain,
multiply(inverse(multiply(A,B)),multiply(A,B)) = multiply(inverse(C),C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[191])]),
[iquote('copy,191,flip.1')] ).
cnf(229,plain,
inverse(multiply(multiply(multiply(inverse(multiply(A,B)),multiply(A,B)),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,E)))),D)) = E,
inference(para_from,[status(thm),theory(equality)],[191,133]),
[iquote('para_from,191.1.1,132.1.1.1.1.1')] ).
cnf(231,plain,
multiply(multiply(inverse(multiply(A,B)),multiply(A,B)),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(multiply(E,D)))))) = E,
inference(para_from,[status(thm),theory(equality)],[191,107]),
[iquote('para_from,191.1.1,106.1.1.1')] ).
cnf(239,plain,
multiply(inverse(inverse(A)),inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(multiply(B,C)),multiply(B,C))),D))),A))) = D,
inference(para_from,[status(thm),theory(equality)],[191,4]),
[iquote('para_from,191.1.1,3.1.1.2.1.1.2.1.1.1')] ).
cnf(243,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(multiply(C,D)),multiply(C,D)),inverse(E)),B)))) = E,
inference(para_from,[status(thm),theory(equality)],[191,19]),
[iquote('para_from,191.1.1,19.1.1.2.2.1.1.1')] ).
cnf(247,plain,
multiply(multiply(inverse(multiply(A,B)),multiply(A,B)),a2) != a2,
inference(para_from,[status(thm),theory(equality)],[191,1]),
[iquote('para_from,191.1.1,1.1.1.1')] ).
cnf(259,plain,
multiply(multiply(inverse(A),A),a2) != a2,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[247,107]),107]),
[iquote('para_into,247.1.1.1.1.1,106.1.1,demod,107')] ).
cnf(267,plain,
multiply(inverse(A),A) = multiply(inverse(B),B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[192,107]),107]),
[iquote('para_into,192.1.1.1.1,106.1.1,demod,107')] ).
cnf(284,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[267,104]),97]),
[iquote('para_from,267.1.1,104.1.1.1.2.1,demod,97')] ).
cnf(292,plain,
multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),C) = C,
inference(para_into,[status(thm),theory(equality)],[284,267]),
[iquote('para_into,284.1.1.1.1,267.1.1')] ).
cnf(301,plain,
multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(B),C),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[292,148])]),
[iquote('para_from,292.1.1,148.1.1.2,flip.1')] ).
cnf(313,plain,
multiply(inverse(inverse(A)),inverse(multiply(multiply(multiply(inverse(A),A),inverse(B)),A))) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[292,35]),301])]),
[iquote('para_from,292.1.1,35.1.1,demod,301,flip.1')] ).
cnf(332,plain,
multiply(inverse(inverse(A)),inverse(multiply(multiply(multiply(inverse(B),B),inverse(C)),A))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[243]),301,301]),
[iquote('back_demod,243,demod,301,301')] ).
cnf(337,plain,
multiply(inverse(multiply(inverse(A),A)),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[239]),301,313]),
[iquote('back_demod,239,demod,301,313')] ).
cnf(340,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),inverse(multiply(C,B))))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[231]),301,301]),
[iquote('back_demod,231,demod,301,301')] ).
cnf(343,plain,
inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),C))),B)) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[229]),301,301]),
[iquote('back_demod,229,demod,301,301')] ).
cnf(363,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),inverse(B)))) = inverse(multiply(inverse(C),C)),
inference(para_into,[status(thm),theory(equality)],[340,337]),
[iquote('para_into,340.1.1.2.1.2.1,336.1.1')] ).
cnf(364,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),inverse(multiply(inverse(C),C))))) = inverse(B),
inference(para_into,[status(thm),theory(equality)],[340,267]),
[iquote('para_into,340.1.1.2.1.2.1,267.1.1')] ).
cnf(371,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))) = inverse(multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[363,343]),343]),
[iquote('para_into,363.1.1.2.1.1.1,342.1.1,demod,343')] ).
cnf(374,plain,
multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),inverse(multiply(inverse(C),C))))) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[364,343]),343]),
[iquote('para_into,364.1.1.2.1.1.1,342.1.1,demod,343')] ).
cnf(377,plain,
multiply(multiply(A,inverse(B)),B) = multiply(multiply(A,inverse(C)),C),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[374,104]),374]),
[iquote('para_from,373.1.1,104.1.1.1,demod,374')] ).
cnf(380,plain,
multiply(inverse(A),A) = multiply(multiply(multiply(inverse(B),B),inverse(C)),C),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[377,371]),337]),
[iquote('para_into,377.1.1.1,371.1.1,demod,337')] ).
cnf(385,plain,
multiply(inverse(inverse(A)),inverse(multiply(multiply(multiply(inverse(B),B),inverse(C)),C))) = A,
inference(para_from,[status(thm),theory(equality)],[377,332]),
[iquote('para_from,377.1.1,332.1.1.2.1')] ).
cnf(388,plain,
multiply(multiply(inverse(inverse(a2)),inverse(A)),A) != a2,
inference(para_from,[status(thm),theory(equality)],[377,259]),
[iquote('para_from,377.1.1,259.1.1')] ).
cnf(407,plain,
multiply(multiply(inverse(A),A),inverse(B)) = inverse(B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[380,340]),385]),
[iquote('para_from,380.1.1,340.1.1.2.1.2.1,demod,385')] ).
cnf(409,plain,
inverse(multiply(inverse(A),inverse(multiply(inverse(B),B)))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[380,374]),407,407]),
[iquote('para_from,380.1.1,373.1.1.2.1.2.1,demod,407,407')] ).
cnf(412,plain,
multiply(multiply(inverse(A),A),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[380,374]),407,409]),
[iquote('para_from,380.1.1,373.1.1.1,demod,407,409')] ).
cnf(414,plain,
$false,
inference(binary,[status(thm)],[412,388]),
[iquote('binary,412.1,388.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 05:10:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.29/2.44 ----- Otter 3.3f, August 2004 -----
% 2.29/2.44 The process was started by sandbox2 on n013.cluster.edu,
% 2.29/2.44 Wed Jul 27 05:10:45 2022
% 2.29/2.44 The command was "./otter". The process ID is 28639.
% 2.29/2.44
% 2.29/2.44 set(prolog_style_variables).
% 2.29/2.44 set(auto).
% 2.29/2.44 dependent: set(auto1).
% 2.29/2.44 dependent: set(process_input).
% 2.29/2.44 dependent: clear(print_kept).
% 2.29/2.44 dependent: clear(print_new_demod).
% 2.29/2.44 dependent: clear(print_back_demod).
% 2.29/2.44 dependent: clear(print_back_sub).
% 2.29/2.44 dependent: set(control_memory).
% 2.29/2.44 dependent: assign(max_mem, 12000).
% 2.29/2.44 dependent: assign(pick_given_ratio, 4).
% 2.29/2.44 dependent: assign(stats_level, 1).
% 2.29/2.44 dependent: assign(max_seconds, 10800).
% 2.29/2.44 clear(print_given).
% 2.29/2.44
% 2.29/2.44 list(usable).
% 2.29/2.44 0 [] A=A.
% 2.29/2.44 0 [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))=C.
% 2.29/2.44 0 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 2.29/2.44 end_of_list.
% 2.29/2.44
% 2.29/2.44 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.29/2.44
% 2.29/2.44 All clauses are units, and equality is present; the
% 2.29/2.44 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.29/2.44
% 2.29/2.44 dependent: set(knuth_bendix).
% 2.29/2.44 dependent: set(anl_eq).
% 2.29/2.44 dependent: set(para_from).
% 2.29/2.44 dependent: set(para_into).
% 2.29/2.44 dependent: clear(para_from_right).
% 2.29/2.44 dependent: clear(para_into_right).
% 2.29/2.44 dependent: set(para_from_vars).
% 2.29/2.44 dependent: set(eq_units_both_ways).
% 2.29/2.44 dependent: set(dynamic_demod_all).
% 2.29/2.44 dependent: set(dynamic_demod).
% 2.29/2.44 dependent: set(order_eq).
% 2.29/2.44 dependent: set(back_demod).
% 2.29/2.44 dependent: set(lrpo).
% 2.29/2.44
% 2.29/2.44 ------------> process usable:
% 2.29/2.44 ** KEPT (pick-wt=8): 1 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 2.29/2.44
% 2.29/2.44 ------------> process sos:
% 2.29/2.44 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.29/2.44 ** KEPT (pick-wt=20): 3 [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))=C.
% 2.29/2.44 ---> New Demodulator: 4 [new_demod,3] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))=C.
% 2.29/2.44 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.29/2.44 >>>> Starting back demodulation with 4.
% 2.29/2.44
% 2.29/2.44 ======= end of input processing =======
% 2.29/2.44
% 2.29/2.44 =========== start of search ===========
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 32.
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 32.
% 2.29/2.44
% 2.29/2.44 sos_size=52
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 27.
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 27.
% 2.29/2.44
% 2.29/2.44 sos_size=65
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 19.
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 19.
% 2.29/2.44
% 2.29/2.44 sos_size=102
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 16.
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Resetting weight limit to 16.
% 2.29/2.44
% 2.29/2.44 sos_size=18
% 2.29/2.44
% 2.29/2.44 -------- PROOF --------
% 2.29/2.44
% 2.29/2.44 ----> UNIT CONFLICT at 0.36 sec ----> 414 [binary,412.1,388.1] $F.
% 2.29/2.44
% 2.29/2.44 Length of proof is 49. Level of proof is 23.
% 2.29/2.44
% 2.29/2.44 ---------------- PROOF ----------------
% 2.29/2.44 % SZS status Unsatisfiable
% 2.29/2.44 % SZS output start Refutation
% See solution above
% 2.29/2.44 ------------ end of proof -------------
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Search stopped by max_proofs option.
% 2.29/2.44
% 2.29/2.44
% 2.29/2.44 Search stopped by max_proofs option.
% 2.29/2.44
% 2.29/2.44 ============ end of search ============
% 2.29/2.44
% 2.29/2.44 -------------- statistics -------------
% 2.29/2.44 clauses given 84
% 2.29/2.44 clauses generated 8960
% 2.29/2.44 clauses kept 303
% 2.29/2.44 clauses forward subsumed 1592
% 2.29/2.44 clauses back subsumed 55
% 2.29/2.44 Kbytes malloced 7812
% 2.29/2.44
% 2.29/2.44 ----------- times (seconds) -----------
% 2.29/2.44 user CPU time 0.36 (0 hr, 0 min, 0 sec)
% 2.29/2.44 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.29/2.44 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.29/2.44
% 2.29/2.44 That finishes the proof of the theorem.
% 2.29/2.44
% 2.29/2.44 Process 28639 finished Wed Jul 27 05:10:47 2022
% 2.29/2.44 Otter interrupted
% 2.29/2.44 PROOF FOUND
%------------------------------------------------------------------------------