TSTP Solution File: HWV001-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:58:02 EDT 2022
% Result : Unsatisfiable 1.79s 2.09s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 32
% Syntax : Number of clauses : 130 ( 130 unt; 0 nHn; 101 RR)
% Number of literals : 130 ( 121 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 19 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ circuit(input(i1,i2),output(i2,i1)),
file('HWV001-1.p',unknown),
[] ).
cnf(5,axiom,
and(A,n1) = A,
file('HWV001-1.p',unknown),
[] ).
cnf(8,axiom,
or(A,n0) = A,
file('HWV001-1.p',unknown),
[] ).
cnf(12,axiom,
not(n0) = n1,
file('HWV001-1.p',unknown),
[] ).
cnf(15,axiom,
and(A,B) = and(B,A),
file('HWV001-1.p',unknown),
[] ).
cnf(16,axiom,
or(A,B) = or(B,A),
file('HWV001-1.p',unknown),
[] ).
cnf(17,axiom,
and(A,and(B,C)) = and(and(A,B),C),
file('HWV001-1.p',unknown),
[] ).
cnf(19,plain,
and(and(A,B),C) = and(A,and(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[17])]),
[iquote('copy,17,flip.1')] ).
cnf(20,axiom,
or(A,or(B,C)) = or(or(A,B),C),
file('HWV001-1.p',unknown),
[] ).
cnf(22,plain,
or(or(A,B),C) = or(A,or(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[20])]),
[iquote('copy,20,flip.1')] ).
cnf(27,axiom,
not(and(A,B)) = or(not(A),not(B)),
file('HWV001-1.p',unknown),
[] ).
cnf(29,axiom,
not(or(A,B)) = and(not(A),not(B)),
file('HWV001-1.p',unknown),
[] ).
cnf(31,axiom,
and(or(A,B),C) = or(and(A,C),and(B,C)),
file('HWV001-1.p',unknown),
[] ).
cnf(32,plain,
or(and(A,B),and(C,B)) = and(or(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[31])]),
[iquote('copy,31,flip.1')] ).
cnf(36,axiom,
and(and(A,B),A) = and(A,B),
file('HWV001-1.p',unknown),
[] ).
cnf(37,plain,
and(A,and(B,A)) = and(A,B),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[36]),19]),
[iquote('copy,36,demod,19')] ).
cnf(41,axiom,
or(or(A,B),A) = or(A,B),
file('HWV001-1.p',unknown),
[] ).
cnf(42,plain,
or(A,or(B,A)) = or(A,B),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[41]),22]),
[iquote('copy,41,demod,22')] ).
cnf(44,axiom,
and(A,not(A)) = n0,
file('HWV001-1.p',unknown),
[] ).
cnf(54,axiom,
not(not(A)) = A,
file('HWV001-1.p',unknown),
[] ).
cnf(56,axiom,
or(and(A,B),and(A,not(B))) = A,
file('HWV001-1.p',unknown),
[] ).
cnf(60,axiom,
a1 = and(b1,b3),
file('HWV001-1.p',unknown),
[] ).
cnf(61,plain,
and(b1,b3) = a1,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[60])]),
[iquote('copy,60,flip.1')] ).
cnf(63,axiom,
a2 = and(b2,b3),
file('HWV001-1.p',unknown),
[] ).
cnf(64,plain,
and(b2,b3) = a2,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[63])]),
[iquote('copy,63,flip.1')] ).
cnf(66,axiom,
b1 = not(d1),
file('HWV001-1.p',unknown),
[] ).
cnf(68,plain,
not(d1) = b1,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[66])]),
[iquote('copy,66,flip.1')] ).
cnf(69,axiom,
b2 = not(d2),
file('HWV001-1.p',unknown),
[] ).
cnf(71,plain,
not(d2) = b2,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[69])]),
[iquote('copy,69,flip.1')] ).
cnf(72,axiom,
b3 = or(c1,c2),
file('HWV001-1.p',unknown),
[] ).
cnf(73,plain,
or(c1,c2) = b3,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[72])]),
[iquote('copy,72,flip.1')] ).
cnf(75,axiom,
c1 = or(d1,d3),
file('HWV001-1.p',unknown),
[] ).
cnf(76,plain,
or(d1,d3) = c1,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[75])]),
[iquote('copy,75,flip.1')] ).
cnf(78,axiom,
c2 = or(d2,d3),
file('HWV001-1.p',unknown),
[] ).
cnf(80,plain,
or(d2,d3) = c2,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[78])]),
[iquote('copy,78,flip.1')] ).
cnf(81,axiom,
d3 = f3,
file('HWV001-1.p',unknown),
[] ).
cnf(83,plain,
f3 = d3,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[81])]),
[iquote('copy,81,flip.1')] ).
cnf(84,axiom,
d1 = not(e1),
file('HWV001-1.p',unknown),
[] ).
cnf(85,plain,
not(e1) = d1,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[84])]),
[iquote('copy,84,flip.1')] ).
cnf(87,axiom,
d2 = not(e2),
file('HWV001-1.p',unknown),
[] ).
cnf(88,plain,
not(e2) = d2,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[87])]),
[iquote('copy,87,flip.1')] ).
cnf(90,axiom,
e1 = or(f1,f3),
file('HWV001-1.p',unknown),
[] ).
cnf(91,plain,
or(f1,d3) = e1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[90]),83])]),
[iquote('copy,90,demod,83,flip.1')] ).
cnf(93,axiom,
e2 = or(f2,f3),
file('HWV001-1.p',unknown),
[] ).
cnf(94,plain,
or(f2,d3) = e2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[93]),83])]),
[iquote('copy,93,demod,83,flip.1')] ).
cnf(96,axiom,
f1 = not(i1),
file('HWV001-1.p',unknown),
[] ).
cnf(98,plain,
not(i1) = f1,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[96])]),
[iquote('copy,96,flip.1')] ).
cnf(99,axiom,
f2 = not(i2),
file('HWV001-1.p',unknown),
[] ).
cnf(101,plain,
not(i2) = f2,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[99])]),
[iquote('copy,99,flip.1')] ).
cnf(102,axiom,
f3 = and(i1,i2),
file('HWV001-1.p',unknown),
[] ).
cnf(104,plain,
and(i1,i2) = d3,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[102]),83])]),
[iquote('copy,102,demod,83,flip.1')] ).
cnf(105,axiom,
circuit(input(i1,i2),output(a1,a2)),
file('HWV001-1.p',unknown),
[] ).
cnf(107,plain,
and(n1,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,5])]),
[iquote('para_into,15.1.1,5.1.1,flip.1')] ).
cnf(111,plain,
not(f2) = i2,
inference(para_into,[status(thm),theory(equality)],[54,101]),
[iquote('para_into,54.1.1.1,100.1.1')] ).
cnf(113,plain,
not(f1) = i1,
inference(para_into,[status(thm),theory(equality)],[54,98]),
[iquote('para_into,54.1.1.1,97.1.1')] ).
cnf(115,plain,
e2 = b2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[54,88]),71])]),
[iquote('para_into,54.1.1.1,88.1.1,demod,71,flip.1')] ).
cnf(117,plain,
e1 = b1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[54,85]),68])]),
[iquote('para_into,54.1.1.1,85.1.1,demod,68,flip.1')] ).
cnf(119,plain,
not(b2) = d2,
inference(para_into,[status(thm),theory(equality)],[54,71]),
[iquote('para_into,54.1.1.1,70.1.1')] ).
cnf(121,plain,
not(b1) = d1,
inference(para_into,[status(thm),theory(equality)],[54,68]),
[iquote('para_into,54.1.1.1,67.1.1')] ).
cnf(122,plain,
or(f2,d3) = b2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[94]),115]),
[iquote('back_demod,94,demod,115')] ).
cnf(124,plain,
or(f1,d3) = b1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[91]),117]),
[iquote('back_demod,91,demod,117')] ).
cnf(129,plain,
or(n0,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[16,8])]),
[iquote('para_into,16.1.1,7.1.1,flip.1')] ).
cnf(133,plain,
and(A,and(B,C)) = and(B,and(C,A)),
inference(para_into,[status(thm),theory(equality)],[19,15]),
[iquote('para_into,18.1.1,15.1.1')] ).
cnf(134,plain,
and(A,and(B,C)) = and(C,and(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[133])]),
[iquote('copy,133,flip.1')] ).
cnf(144,plain,
or(c2,c1) = b3,
inference(para_into,[status(thm),theory(equality)],[73,16]),
[iquote('para_into,73.1.1,16.1.1')] ).
cnf(146,plain,
or(d3,d1) = c1,
inference(para_into,[status(thm),theory(equality)],[76,16]),
[iquote('para_into,76.1.1,16.1.1')] ).
cnf(157,plain,
or(d3,d2) = c2,
inference(para_into,[status(thm),theory(equality)],[80,16]),
[iquote('para_into,79.1.1,16.1.1')] ).
cnf(161,plain,
and(i2,i1) = d3,
inference(para_into,[status(thm),theory(equality)],[104,15]),
[iquote('para_into,103.1.1,15.1.1')] ).
cnf(170,plain,
or(d3,f2) = b2,
inference(para_into,[status(thm),theory(equality)],[122,16]),
[iquote('para_into,122.1.1,16.1.1')] ).
cnf(174,plain,
or(d3,f1) = b1,
inference(para_into,[status(thm),theory(equality)],[124,16]),
[iquote('para_into,124.1.1,16.1.1')] ).
cnf(197,plain,
not(d3) = or(f1,f2),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,104]),98,101]),
[iquote('para_into,27.1.1.1,103.1.1,demod,98,101')] ).
cnf(198,plain,
or(d2,not(b3)) = not(a2),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,64]),119])]),
[iquote('para_into,27.1.1.1,64.1.1,demod,119,flip.1')] ).
cnf(200,plain,
or(d1,not(b3)) = not(a1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,61]),121])]),
[iquote('para_into,27.1.1.1,61.1.1,demod,121,flip.1')] ).
cnf(210,plain,
and(or(f1,f2),i1) = d1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,174]),121,197,113])]),
[iquote('para_into,29.1.1.1,174.1.1,demod,121,197,113,flip.1')] ).
cnf(212,plain,
and(or(f1,f2),i2) = d2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,170]),119,197,111])]),
[iquote('para_into,29.1.1.1,170.1.1,demod,119,197,111,flip.1')] ).
cnf(215,plain,
not(c2) = and(or(f1,f2),b2),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,157]),197,71]),
[iquote('para_into,29.1.1.1,156.1.1,demod,197,71')] ).
cnf(217,plain,
not(c1) = and(or(f1,f2),b1),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,146]),197,68]),
[iquote('para_into,29.1.1.1,145.1.1,demod,197,68')] ).
cnf(219,plain,
not(b3) = and(or(f1,f2),and(b2,and(or(f1,f2),b1))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,144]),215,217,19]),
[iquote('para_into,29.1.1.1,143.1.1,demod,215,217,19')] ).
cnf(221,plain,
and(i1,or(f1,f2)) = d1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,124]),121,113,197])]),
[iquote('para_into,29.1.1.1,124.1.1,demod,121,113,197,flip.1')] ).
cnf(223,plain,
and(i2,or(f1,f2)) = d2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,122]),119,111,197])]),
[iquote('para_into,29.1.1.1,122.1.1,demod,119,111,197,flip.1')] ).
cnf(224,plain,
not(a1) = or(d1,and(or(f1,f2),and(b2,and(or(f1,f2),b1)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[200]),219])]),
[iquote('back_demod,200,demod,219,flip.1')] ).
cnf(226,plain,
not(a2) = or(d2,and(or(f1,f2),and(b2,and(or(f1,f2),b1)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[198]),219])]),
[iquote('back_demod,198,demod,219,flip.1')] ).
cnf(232,plain,
and(f1,i1) = n0,
inference(para_into,[status(thm),theory(equality)],[44,113]),
[iquote('para_into,44.1.1.2,112.1.1')] ).
cnf(234,plain,
and(f2,i2) = n0,
inference(para_into,[status(thm),theory(equality)],[44,111]),
[iquote('para_into,44.1.1.2,110.1.1')] ).
cnf(267,plain,
and(or(f1,A),i1) = and(A,i1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,232]),129])]),
[iquote('para_into,32.1.1.1,232.1.1,demod,129,flip.1')] ).
cnf(325,plain,
and(f2,i1) = d1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[210]),267]),
[iquote('back_demod,210,demod,267')] ).
cnf(333,plain,
and(or(A,f2),i2) = and(A,i2),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[234,32]),8])]),
[iquote('para_from,234.1.1,32.1.1.2,demod,8,flip.1')] ).
cnf(336,plain,
or(i2,f2) = n1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[234,27]),12,111,101])]),
[iquote('para_from,234.1.1,27.1.1.1,demod,12,111,101,flip.1')] ).
cnf(340,plain,
and(f1,i2) = d2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[212]),333]),
[iquote('back_demod,212,demod,333')] ).
cnf(366,plain,
and(i1,d3) = d3,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[37,161]),104]),
[iquote('para_into,37.1.1.2,160.1.1,demod,104')] ).
cnf(372,plain,
and(i2,d3) = d3,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[37,104]),161]),
[iquote('para_into,37.1.1.2,103.1.1,demod,161')] ).
cnf(381,plain,
and(A,and(B,and(C,A))) = and(A,and(B,C)),
inference(para_into,[status(thm),theory(equality)],[37,19]),
[iquote('para_into,37.1.1.2,18.1.1')] ).
cnf(387,plain,
and(A,and(B,and(A,C))) = and(A,and(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[37,19]),19,19])]),
[iquote('para_from,37.1.1,18.1.1.1,demod,19,19,flip.1')] ).
cnf(388,plain,
not(a2) = or(d2,and(or(f1,f2),and(b2,b1))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[226]),387]),
[iquote('back_demod,226,demod,387')] ).
cnf(390,plain,
not(a1) = or(d1,and(or(f1,f2),and(b2,b1))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[224]),387]),
[iquote('back_demod,224,demod,387')] ).
cnf(393,plain,
not(b3) = and(or(f1,f2),and(b2,b1)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[219]),387]),
[iquote('back_demod,218,demod,387')] ).
cnf(412,plain,
or(d2,c2) = c2,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[42,157]),80]),
[iquote('para_into,42.1.1.2,156.1.1,demod,80')] ).
cnf(426,plain,
or(c2,b3) = b3,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[42,73]),144]),
[iquote('para_into,42.1.1.2,73.1.1,demod,144')] ).
cnf(448,plain,
and(i2,f1) = d2,
inference(para_into,[status(thm),theory(equality)],[340,15]),
[iquote('para_into,340.1.1,15.1.1')] ).
cnf(592,plain,
or(c2,d2) = c2,
inference(para_into,[status(thm),theory(equality)],[412,16]),
[iquote('para_into,412.1.1,16.1.1')] ).
cnf(601,plain,
i2 = c2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[56,372]),197,223,157])]),
[iquote('para_into,56.1.1.1,372.1.1,demod,197,223,157,flip.1')] ).
cnf(607,plain,
i1 = c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[56,366]),197,221,146])]),
[iquote('para_into,56.1.1.1,366.1.1,demod,197,221,146,flip.1')] ).
cnf(610,plain,
or(d1,and(f2,and(or(f1,f2),b1))) = f2,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[56,325]),607,217]),
[iquote('para_into,56.1.1.1,325.1.1,demod,607,217')] ).
cnf(684,plain,
and(c2,f1) = d2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[448]),601]),
[iquote('back_demod,448,demod,601')] ).
cnf(705,plain,
or(c2,f2) = n1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[336]),601]),
[iquote('back_demod,336,demod,601')] ).
cnf(729,plain,
not(f2) = c2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[111]),601]),
[iquote('back_demod,110,demod,601')] ).
cnf(730,plain,
circuit(input(c1,c2),output(a1,a2)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[105]),607,601]),
[iquote('back_demod,105,demod,607,601')] ).
cnf(734,plain,
and(or(f1,f2),b2) = f2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[101]),601,215]),
[iquote('back_demod,100,demod,601,215')] ).
cnf(735,plain,
~ circuit(input(c1,c2),output(c2,c1)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),607,601,601,607]),
[iquote('back_demod,1,demod,607,601,601,607')] ).
cnf(791,plain,
not(f1) = c1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[113]),607]),
[iquote('back_demod,112,demod,607')] ).
cnf(793,plain,
and(or(f1,f2),b1) = f1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),607,217]),
[iquote('back_demod,97,demod,607,217')] ).
cnf(799,plain,
not(c2) = f2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[215]),734]),
[iquote('back_demod,214,demod,734')] ).
cnf(803,plain,
or(d1,and(f2,f1)) = f2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[610]),793]),
[iquote('back_demod,610,demod,793')] ).
cnf(889,plain,
or(b3,c2) = b3,
inference(para_into,[status(thm),theory(equality)],[426,16]),
[iquote('para_into,426.1.1,16.1.1')] ).
cnf(891,plain,
and(f2,and(or(f1,f2),and(b2,b1))) = and(or(f1,f2),and(b2,b1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[426,29]),393,799,393])]),
[iquote('para_from,426.1.1,29.1.1.1,demod,393,799,393,flip.1')] ).
cnf(971,plain,
and(f2,b2) = f2,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[592,29]),799,799,71])]),
[iquote('para_from,592.1.1,29.1.1.1,demod,799,799,71,flip.1')] ).
cnf(1015,plain,
or(d2,and(A,f1)) = and(or(c2,A),f1),
inference(para_from,[status(thm),theory(equality)],[684,32]),
[iquote('para_from,684.1.1,32.1.1.1')] ).
cnf(1248,plain,
and(or(f1,f2),and(b2,and(b1,f2))) = and(or(f1,f2),and(b2,b1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[889,29]),393,393,799,19,19])]),
[iquote('para_from,889.1.1,29.1.1.1,demod,393,393,799,19,19,flip.1')] ).
cnf(1303,plain,
and(b2,and(A,f2)) = and(A,f2),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[971,134])]),
[iquote('para_from,971.1.1,134.1.1.2,flip.1')] ).
cnf(1310,plain,
and(or(f1,f2),and(b2,b1)) = and(or(f1,f2),and(b1,f2)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1248]),1303])]),
[iquote('back_demod,1248,demod,1303,flip.1')] ).
cnf(1323,plain,
and(or(f1,f2),and(b1,f2)) = and(f2,f1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[891]),1310,381,793,1310])]),
[iquote('back_demod,891,demod,1310,381,793,1310,flip.1')] ).
cnf(1330,plain,
not(a1) = f2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[390]),1310,1323,803]),
[iquote('back_demod,390,demod,1310,1323,803')] ).
cnf(1332,plain,
not(a2) = f1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[388]),1310,1323,1015,705,107]),
[iquote('back_demod,388,demod,1310,1323,1015,705,107')] ).
cnf(1349,plain,
c2 = a1,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1330,54]),729]),
[iquote('para_from,1330.1.1,54.1.1.1,demod,729')] ).
cnf(1450,plain,
~ circuit(input(c1,a1),output(a1,c1)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[735]),1349,1349]),
[iquote('back_demod,735,demod,1349,1349')] ).
cnf(1453,plain,
circuit(input(c1,a1),output(a1,a2)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[730]),1349]),
[iquote('back_demod,730,demod,1349')] ).
cnf(1579,plain,
c1 = a2,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1332,54]),791]),
[iquote('para_from,1332.1.1,54.1.1.1,demod,791')] ).
cnf(1612,plain,
circuit(input(a2,a1),output(a1,a2)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1453]),1579]),
[iquote('back_demod,1453,demod,1579')] ).
cnf(1615,plain,
~ circuit(input(a2,a1),output(a1,a2)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1450]),1579,1579]),
[iquote('back_demod,1450,demod,1579,1579')] ).
cnf(1616,plain,
$false,
inference(binary,[status(thm)],[1615,1612]),
[iquote('binary,1615.1,1612.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.16 % Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.16 % Command : otter-tptp-script %s
% 0.12/0.37 % Computer : n012.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Jul 27 06:38:20 EDT 2022
% 0.12/0.37 % CPUTime :
% 1.79/2.06 ----- Otter 3.3f, August 2004 -----
% 1.79/2.06 The process was started by sandbox2 on n012.cluster.edu,
% 1.79/2.06 Wed Jul 27 06:38:20 2022
% 1.79/2.06 The command was "./otter". The process ID is 23817.
% 1.79/2.06
% 1.79/2.06 set(prolog_style_variables).
% 1.79/2.06 set(auto).
% 1.79/2.06 dependent: set(auto1).
% 1.79/2.06 dependent: set(process_input).
% 1.79/2.06 dependent: clear(print_kept).
% 1.79/2.06 dependent: clear(print_new_demod).
% 1.79/2.06 dependent: clear(print_back_demod).
% 1.79/2.06 dependent: clear(print_back_sub).
% 1.79/2.06 dependent: set(control_memory).
% 1.79/2.06 dependent: assign(max_mem, 12000).
% 1.79/2.06 dependent: assign(pick_given_ratio, 4).
% 1.79/2.06 dependent: assign(stats_level, 1).
% 1.79/2.06 dependent: assign(max_seconds, 10800).
% 1.79/2.06 clear(print_given).
% 1.79/2.06
% 1.79/2.06 list(usable).
% 1.79/2.06 0 [] A=A.
% 1.79/2.06 0 [] and(X,n0)=n0.
% 1.79/2.06 0 [] and(X,n1)=X.
% 1.79/2.06 0 [] or(X,n0)=X.
% 1.79/2.06 0 [] or(X,n1)=n1.
% 1.79/2.06 0 [] not(n0)=n1.
% 1.79/2.06 0 [] not(n1)=n0.
% 1.79/2.06 0 [] and(X,Y)=and(Y,X).
% 1.79/2.06 0 [] or(X,Y)=or(Y,X).
% 1.79/2.06 0 [] and(X,and(Y,Z))=and(and(X,Y),Z).
% 1.79/2.06 0 [] or(X,or(Y,Z))=or(or(X,Y),Z).
% 1.79/2.06 0 [] or(or(X,Y),Z)=or(or(X,Z),Y).
% 1.79/2.06 0 [] and(and(X,Y),Z)=and(and(X,Z),Y).
% 1.79/2.06 0 [] not(and(X,Y))=or(not(X),not(Y)).
% 1.79/2.06 0 [] not(or(X,Y))=and(not(X),not(Y)).
% 1.79/2.06 0 [] and(or(X,Y),Z)=or(and(X,Z),and(Y,Z)).
% 1.79/2.06 0 [] and(X,X)=X.
% 1.79/2.06 0 [] and(and(X,Y),Y)=and(X,Y).
% 1.79/2.06 0 [] and(and(X,Y),X)=and(X,Y).
% 1.79/2.06 0 [] or(X,X)=X.
% 1.79/2.06 0 [] or(or(X,Y),Y)=or(X,Y).
% 1.79/2.06 0 [] or(or(X,Y),X)=or(X,Y).
% 1.79/2.06 0 [] and(X,not(X))=n0.
% 1.79/2.06 0 [] and(and(X,Y),not(Y))=n0.
% 1.79/2.06 0 [] and(and(X,Y),not(X))=n0.
% 1.79/2.06 0 [] or(X,not(X))=n1.
% 1.79/2.06 0 [] or(or(X,Y),not(Y))=n1.
% 1.79/2.06 0 [] or(or(X,Y),not(X))=n1.
% 1.79/2.06 0 [] not(not(X))=X.
% 1.79/2.06 0 [] or(and(X,Y),and(X,not(Y)))=X.
% 1.79/2.06 0 [] or(and(X,Y),and(Y,not(X)))=Y.
% 1.79/2.06 0 [] a1=and(b1,b3).
% 1.79/2.06 0 [] a2=and(b2,b3).
% 1.79/2.06 0 [] b1=not(d1).
% 1.79/2.06 0 [] b2=not(d2).
% 1.79/2.06 0 [] b3=or(c1,c2).
% 1.79/2.06 0 [] c1=or(d1,d3).
% 1.79/2.06 0 [] c2=or(d2,d3).
% 1.79/2.06 0 [] d3=f3.
% 1.79/2.06 0 [] d1=not(e1).
% 1.79/2.06 0 [] d2=not(e2).
% 1.79/2.06 0 [] e1=or(f1,f3).
% 1.79/2.06 0 [] e2=or(f2,f3).
% 1.79/2.06 0 [] f1=not(i1).
% 1.79/2.06 0 [] f2=not(i2).
% 1.79/2.06 0 [] f3=and(i1,i2).
% 1.79/2.06 0 [] circuit(input(i1,i2),output(a1,a2)).
% 1.79/2.06 0 [] -circuit(input(i1,i2),output(i2,i1)).
% 1.79/2.06 end_of_list.
% 1.79/2.06
% 1.79/2.06 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.79/2.06
% 1.79/2.06 All clauses are units, and equality is present; the
% 1.79/2.06 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.79/2.06
% 1.79/2.06 dependent: set(knuth_bendix).
% 1.79/2.06 dependent: set(anl_eq).
% 1.79/2.06 dependent: set(para_from).
% 1.79/2.06 dependent: set(para_into).
% 1.79/2.06 dependent: clear(para_from_right).
% 1.79/2.06 dependent: clear(para_into_right).
% 1.79/2.06 dependent: set(para_from_vars).
% 1.79/2.06 dependent: set(eq_units_both_ways).
% 1.79/2.06 dependent: set(dynamic_demod_all).
% 1.79/2.06 dependent: set(dynamic_demod).
% 1.79/2.06 dependent: set(order_eq).
% 1.79/2.06 dependent: set(back_demod).
% 1.79/2.06 dependent: set(lrpo).
% 1.79/2.06
% 1.79/2.06 ------------> process usable:
% 1.79/2.06 ** KEPT (pick-wt=7): 1 [] -circuit(input(i1,i2),output(i2,i1)).
% 1.79/2.06
% 1.79/2.06 ------------> process sos:
% 1.79/2.06 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.79/2.06 ** KEPT (pick-wt=5): 3 [] and(A,n0)=n0.
% 1.79/2.06 ---> New Demodulator: 4 [new_demod,3] and(A,n0)=n0.
% 1.79/2.06 ** KEPT (pick-wt=5): 5 [] and(A,n1)=A.
% 1.79/2.06 ---> New Demodulator: 6 [new_demod,5] and(A,n1)=A.
% 1.79/2.06 ** KEPT (pick-wt=5): 7 [] or(A,n0)=A.
% 1.79/2.06 ---> New Demodulator: 8 [new_demod,7] or(A,n0)=A.
% 1.79/2.06 ** KEPT (pick-wt=5): 9 [] or(A,n1)=n1.
% 1.79/2.06 ---> New Demodulator: 10 [new_demod,9] or(A,n1)=n1.
% 1.79/2.06 ** KEPT (pick-wt=4): 11 [] not(n0)=n1.
% 1.79/2.06 ---> New Demodulator: 12 [new_demod,11] not(n0)=n1.
% 1.79/2.06 ** KEPT (pick-wt=4): 13 [] not(n1)=n0.
% 1.79/2.06 ---> New Demodulator: 14 [new_demod,13] not(n1)=n0.
% 1.79/2.06 ** KEPT (pick-wt=7): 15 [] and(A,B)=and(B,A).
% 1.79/2.06 ** KEPT (pick-wt=7): 16 [] or(A,B)=or(B,A).
% 1.79/2.06 ** KEPT (pick-wt=11): 18 [copy,17,flip.1] and(and(A,B),C)=and(A,and(B,C)).
% 1.79/2.06 ---> New Demodulator: 19 [new_demod,18] and(and(A,B),C)=and(A,and(B,C)).
% 1.79/2.06 ** KEPT (pick-wt=11): 21 [copy,20,flip.1] or(or(A,B),C)=or(A,or(B,C)).
% 1.79/2.06 ---> New Demodulator: 22 [new_demod,21] or(or(A,B),C)=or(A,or(B,C)).
% 1.79/2.06 ** KEPT (pick-wt=11): 24 [copy,23,demod,22,22] or(A,or(B,C))=or(A,or(C,B)).
% 1.79/2.06 ** KEPT (pick-wt=11): 26 [copy,25,demod,19,19] and(A,and(B,C))=and(A,and(C,B)).
% 1.79/2.06 ** KEPT (pick-wt=10): 27 [] not(and(A,B))=or(not(A),not(B)).
% 1.79/2.06 ---> New Demodulator: 28 [new_demod,27] not(and(A,B))=or(not(A),not(B)).
% 1.79/2.06 ** KEPT (pick-wt=10): 29 [] not(or(A,B))=and(not(A),not(B)).
% 1.79/2.06 ---> New Demodulator: 30 [new_demod,29] not(or(A,B))=and(not(A),not(B)).
% 1.79/2.06 ** KEPT (pick-wt=13): 32 [copy,31,flip.1] or(and(A,B),and(C,B))=and(or(A,C),B).
% 1.79/2.06 ---> New Demodulator: 33 [new_demod,32] or(and(A,B),and(C,B))=and(or(A,C),B).
% 1.79/2.06 ** KEPT (pick-wt=5): 34 [] and(A,A)=A.
% 1.79/2.06 ---> New Demodulator: 35 [new_demod,34] and(A,A)=A.
% 1.79/2.06 Following clause subsumed by 2 during input processing: 0 [demod,19,35] and(A,B)=and(A,B).
% 1.79/2.06 ** KEPT (pick-wt=9): 37 [copy,36,demod,19] and(A,and(B,A))=and(A,B).
% 1.79/2.06 ---> New Demodulator: 38 [new_demod,37] and(A,and(B,A))=and(A,B).
% 1.79/2.06 ** KEPT (pick-wt=5): 39 [] or(A,A)=A.
% 1.79/2.06 ---> New Demodulator: 40 [new_demod,39] or(A,A)=A.
% 1.79/2.06 Following clause subsumed by 2 during input processing: 0 [demod,22,40] or(A,B)=or(A,B).
% 1.79/2.06 ** KEPT (pick-wt=9): 42 [copy,41,demod,22] or(A,or(B,A))=or(A,B).
% 1.79/2.06 ---> New Demodulator: 43 [new_demod,42] or(A,or(B,A))=or(A,B).
% 1.79/2.06 ** KEPT (pick-wt=6): 44 [] and(A,not(A))=n0.
% 1.79/2.06 ---> New Demodulator: 45 [new_demod,44] and(A,not(A))=n0.
% 1.79/2.06 Following clause subsumed by 2 during input processing: 0 [demod,19,45,4] n0=n0.
% 1.79/2.06 ** KEPT (pick-wt=8): 47 [copy,46,demod,19] and(A,and(B,not(A)))=n0.
% 1.79/2.06 ---> New Demodulator: 48 [new_demod,47] and(A,and(B,not(A)))=n0.
% 1.79/2.06 ** KEPT (pick-wt=6): 49 [] or(A,not(A))=n1.
% 1.79/2.06 ---> New Demodulator: 50 [new_demod,49] or(A,not(A))=n1.
% 1.79/2.06 Following clause subsumed by 2 during input processing: 0 [demod,22,50,10] n1=n1.
% 1.79/2.06 ** KEPT (pick-wt=8): 52 [copy,51,demod,22] or(A,or(B,not(A)))=n1.
% 1.79/2.06 ---> New Demodulator: 53 [new_demod,52] or(A,or(B,not(A)))=n1.
% 1.79/2.06 ** KEPT (pick-wt=5): 54 [] not(not(A))=A.
% 1.79/2.06 ---> New Demodulator: 55 [new_demod,54] not(not(A))=A.
% 1.79/2.06 ** KEPT (pick-wt=10): 56 [] or(and(A,B),and(A,not(B)))=A.
% 1.79/2.06 ---> New Demodulator: 57 [new_demod,56] or(and(A,B),and(A,not(B)))=A.
% 1.79/2.06 ** KEPT (pick-wt=10): 58 [] or(and(A,B),and(B,not(A)))=B.
% 1.79/2.06 ---> New Demodulator: 59 [new_demod,58] or(and(A,B),and(B,not(A)))=B.
% 1.79/2.06 ** KEPT (pick-wt=5): 61 [copy,60,flip.1] and(b1,b3)=a1.
% 1.79/2.06 ---> New Demodulator: 62 [new_demod,61] and(b1,b3)=a1.
% 1.79/2.06 ** KEPT (pick-wt=5): 64 [copy,63,flip.1] and(b2,b3)=a2.
% 1.79/2.06 ---> New Demodulator: 65 [new_demod,64] and(b2,b3)=a2.
% 1.79/2.06 ** KEPT (pick-wt=4): 67 [copy,66,flip.1] not(d1)=b1.
% 1.79/2.06 ---> New Demodulator: 68 [new_demod,67] not(d1)=b1.
% 1.79/2.06 ** KEPT (pick-wt=4): 70 [copy,69,flip.1] not(d2)=b2.
% 1.79/2.06 ---> New Demodulator: 71 [new_demod,70] not(d2)=b2.
% 1.79/2.06 ** KEPT (pick-wt=5): 73 [copy,72,flip.1] or(c1,c2)=b3.
% 1.79/2.06 ---> New Demodulator: 74 [new_demod,73] or(c1,c2)=b3.
% 1.79/2.06 ** KEPT (pick-wt=5): 76 [copy,75,flip.1] or(d1,d3)=c1.
% 1.79/2.06 ---> New Demodulator: 77 [new_demod,76] or(d1,d3)=c1.
% 1.79/2.06 ** KEPT (pick-wt=5): 79 [copy,78,flip.1] or(d2,d3)=c2.
% 1.79/2.06 ---> New Demodulator: 80 [new_demod,79] or(d2,d3)=c2.
% 1.79/2.06 ** KEPT (pick-wt=3): 82 [copy,81,flip.1] f3=d3.
% 1.79/2.06 ---> New Demodulator: 83 [new_demod,82] f3=d3.
% 1.79/2.06 ** KEPT (pick-wt=4): 85 [copy,84,flip.1] not(e1)=d1.
% 1.79/2.06 ---> New Demodulator: 86 [new_demod,85] not(e1)=d1.
% 1.79/2.06 ** KEPT (pick-wt=4): 88 [copy,87,flip.1] not(e2)=d2.
% 1.79/2.06 ---> New Demodulator: 89 [new_demod,88] not(e2)=d2.
% 1.79/2.06 ** KEPT (pick-wt=5): 91 [copy,90,demod,83,flip.1] or(f1,d3)=e1.
% 1.79/2.06 ---> New Demodulator: 92 [new_demod,91] or(f1,d3)=e1.
% 1.79/2.06 ** KEPT (pick-wt=5): 94 [copy,93,demod,83,flip.1] or(f2,d3)=e2.
% 1.79/2.06 ---> New Demodulator: 95 [new_demod,94] or(f2,d3)=e2.
% 1.79/2.06 ** KEPT (pick-wt=4): 97 [copy,96,flip.1] not(i1)=f1.
% 1.79/2.06 ---> New Demodulator: 98 [new_demod,97] not(i1)=f1.
% 1.79/2.06 ** KEPT (pick-wt=4): 100 [copy,99,flip.1] not(i2)=f2.
% 1.79/2.06 ---> New Demodulator: 101 [new_demod,100] not(i2)=f2.
% 1.79/2.06 ** KEPT (pick-wt=5): 103 [copy,102,demod,83,flip.1] and(i1,i2)=d3.
% 1.79/2.06 ---> New Demodulator: 104 [new_demod,103] and(i1,i2)=d3.
% 1.79/2.06 ** KEPT (pick-wt=7): 105 [] circuit(input(i1,i2),output(a1,a2)).
% 1.79/2.06 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.79/2.06 >>>> Starting back demodulation with 4.
% 1.79/2.06 >>>> Starting back demodulation with 6.
% 1.79/2.06 >>>> Starting back demodulation with 8.
% 1.79/2.06 >>>> Starting back demodulation with 10.
% 1.79/2.06 >>>> Starting back demodulation with 12.
% 1.79/2.06 >>>> Starting back demodulation with 14.
% 1.79/2.06 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] and(A,B)=and(B,A).
% 1.79/2.06 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] or(A,B)=or(B,A).
% 1.79/2.06 >>>> Starting back demodulation with 19.
% 1.79/2.06 >>>> Starting back demodulation with 22.
% 1.79/2.06 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] or(A,or(B,C))=or(A,or(C,B)).
% 1.79/2.06 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] and(A,and(B,C))=and(A,and(C,B)).
% 1.79/2.09 >>>> Starting back demodulation with 28.
% 1.79/2.09 >>>> Starting back demodulation with 30.
% 1.79/2.09 >>>> Starting back demodulation with 33.
% 1.79/2.09 >>>> Starting back demodulation with 35.
% 1.79/2.09 >>>> Starting back demodulation with 38.
% 1.79/2.09 >>>> Starting back demodulation with 40.
% 1.79/2.09 >>>> Starting back demodulation with 43.
% 1.79/2.09 >>>> Starting back demodulation with 45.
% 1.79/2.09 >>>> Starting back demodulation with 48.
% 1.79/2.09 >>>> Starting back demodulation with 50.
% 1.79/2.09 >>>> Starting back demodulation with 53.
% 1.79/2.09 >>>> Starting back demodulation with 55.
% 1.79/2.09 >>>> Starting back demodulation with 57.
% 1.79/2.09 >>>> Starting back demodulation with 59.
% 1.79/2.09 >>>> Starting back demodulation with 62.
% 1.79/2.09 >>>> Starting back demodulation with 65.
% 1.79/2.09 >>>> Starting back demodulation with 68.
% 1.79/2.09 >>>> Starting back demodulation with 71.
% 1.79/2.09 >>>> Starting back demodulation with 74.
% 1.79/2.09 >>>> Starting back demodulation with 77.
% 1.79/2.09 >>>> Starting back demodulation with 80.
% 1.79/2.09 >>>> Starting back demodulation with 83.
% 1.79/2.09 >>>> Starting back demodulation with 86.
% 1.79/2.09 >>>> Starting back demodulation with 89.
% 1.79/2.09 >>>> Starting back demodulation with 92.
% 1.79/2.09 >>>> Starting back demodulation with 95.
% 1.79/2.09 >>>> Starting back demodulation with 98.
% 1.79/2.09 >>>> Starting back demodulation with 101.
% 1.79/2.09 >>>> Starting back demodulation with 104.
% 1.79/2.09
% 1.79/2.09 ======= end of input processing =======
% 1.79/2.09
% 1.79/2.09 =========== start of search ===========
% 1.79/2.09
% 1.79/2.09 -------- PROOF --------
% 1.79/2.09
% 1.79/2.09 ----> UNIT CONFLICT at 0.03 sec ----> 1616 [binary,1615.1,1612.1] $F.
% 1.79/2.09
% 1.79/2.09 Length of proof is 97. Level of proof is 15.
% 1.79/2.09
% 1.79/2.09 ---------------- PROOF ----------------
% 1.79/2.09 % SZS status Unsatisfiable
% 1.79/2.09 % SZS output start Refutation
% See solution above
% 1.79/2.09 ------------ end of proof -------------
% 1.79/2.09
% 1.79/2.09
% 1.79/2.09 Search stopped by max_proofs option.
% 1.79/2.09
% 1.79/2.09
% 1.79/2.09 Search stopped by max_proofs option.
% 1.79/2.09
% 1.79/2.09 ============ end of search ============
% 1.79/2.09
% 1.79/2.09 -------------- statistics -------------
% 1.79/2.09 clauses given 154
% 1.79/2.09 clauses generated 2269
% 1.79/2.09 clauses kept 873
% 1.79/2.09 clauses forward subsumed 1858
% 1.79/2.09 clauses back subsumed 2
% 1.79/2.09 Kbytes malloced 3906
% 1.79/2.09
% 1.79/2.09 ----------- times (seconds) -----------
% 1.79/2.09 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.79/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.79/2.09
% 1.79/2.09 That finishes the proof of the theorem.
% 1.79/2.09
% 1.79/2.09 Process 23817 finished Wed Jul 27 06:38:22 2022
% 1.79/2.09 Otter interrupted
% 1.79/2.09 PROOF FOUND
%------------------------------------------------------------------------------