TSTP Solution File: REL011+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : REL011+2 : 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:11:49 EDT 2022
% Result : Theorem 1.82s 2.00s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of clauses : 67 ( 67 unt; 0 nHn; 16 RR)
% Number of literals : 67 ( 66 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 80 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(composition(dollar_c2,dollar_c3),dollar_c1) != zero,
file('REL011+2.p',unknown),
[] ).
cnf(3,axiom,
join(A,B) = join(B,A),
file('REL011+2.p',unknown),
[] ).
cnf(4,axiom,
join(A,join(B,C)) = join(join(A,B),C),
file('REL011+2.p',unknown),
[] ).
cnf(6,plain,
join(join(A,B),C) = join(A,join(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.1')] ).
cnf(7,axiom,
A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),
file('REL011+2.p',unknown),
[] ).
cnf(8,plain,
join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,axiom,
meet(A,B) = complement(join(complement(A),complement(B))),
file('REL011+2.p',unknown),
[] ).
cnf(12,plain,
complement(join(complement(A),complement(B))) = meet(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(13,axiom,
composition(A,composition(B,C)) = composition(composition(A,B),C),
file('REL011+2.p',unknown),
[] ).
cnf(14,plain,
composition(composition(A,B),C) = composition(A,composition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.1')] ).
cnf(16,axiom,
composition(A,one) = A,
file('REL011+2.p',unknown),
[] ).
cnf(18,axiom,
composition(join(A,B),C) = join(composition(A,C),composition(B,C)),
file('REL011+2.p',unknown),
[] ).
cnf(19,plain,
join(composition(A,B),composition(C,B)) = composition(join(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
[iquote('copy,18,flip.1')] ).
cnf(22,axiom,
converse(converse(A)) = A,
file('REL011+2.p',unknown),
[] ).
cnf(23,axiom,
converse(join(A,B)) = join(converse(A),converse(B)),
file('REL011+2.p',unknown),
[] ).
cnf(25,axiom,
converse(composition(A,B)) = composition(converse(B),converse(A)),
file('REL011+2.p',unknown),
[] ).
cnf(27,axiom,
join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B),
file('REL011+2.p',unknown),
[] ).
cnf(29,axiom,
top = join(A,complement(A)),
file('REL011+2.p',unknown),
[] ).
cnf(30,plain,
join(A,complement(A)) = top,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[29])]),
[iquote('copy,29,flip.1')] ).
cnf(32,axiom,
zero = meet(A,complement(A)),
file('REL011+2.p',unknown),
[] ).
cnf(34,plain,
meet(A,complement(A)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[32])]),
[iquote('copy,32,flip.1')] ).
cnf(37,axiom,
join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C),
file('REL011+2.p',unknown),
[] ).
cnf(42,axiom,
meet(dollar_c3,composition(converse(dollar_c2),dollar_c1)) = zero,
file('REL011+2.p',unknown),
[] ).
cnf(43,plain,
join(meet(A,B),complement(join(complement(A),B))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[8]),12]),
[iquote('back_demod,8,demod,12')] ).
cnf(46,plain,
join(complement(A),A) = top,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,30])]),
[iquote('para_into,3.1.1,30.1.1,flip.1')] ).
cnf(53,plain,
complement(top) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,30]),34]),
[iquote('para_into,11.1.1.1,30.1.1,demod,34')] ).
cnf(54,plain,
meet(A,B) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,3]),12]),
[iquote('para_into,11.1.1.1,3.1.1,demod,12')] ).
cnf(61,plain,
join(complement(A),join(complement(B),meet(A,B))) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[12,30]),6]),
[iquote('para_from,11.1.1,30.1.1.2,demod,6')] ).
cnf(63,plain,
complement(join(complement(A),zero)) = meet(A,top),
inference(para_from,[status(thm),theory(equality)],[53,12]),
[iquote('para_from,52.1.1,11.1.1.1.2')] ).
cnf(73,plain,
join(complement(A),join(A,B)) = join(top,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,46])]),
[iquote('para_into,5.1.1.1,45.1.1,flip.1')] ).
cnf(97,plain,
join(composition(A,B),composition(C,composition(D,B))) = composition(join(A,composition(C,D)),B),
inference(para_into,[status(thm),theory(equality)],[19,14]),
[iquote('para_into,19.1.1.2,14.1.1')] ).
cnf(104,plain,
complement(join(zero,zero)) = meet(top,top),
inference(para_into,[status(thm),theory(equality)],[63,53]),
[iquote('para_into,63.1.1.1.1,52.1.1')] ).
cnf(150,plain,
join(converse(complement(A)),converse(A)) = converse(top),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,46])]),
[iquote('para_into,23.1.1.1,45.1.1,flip.1')] ).
cnf(168,plain,
composition(converse(one),converse(A)) = converse(A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[25,16])]),
[iquote('para_into,25.1.1.1,16.1.1,flip.1')] ).
cnf(178,plain,
composition(converse(one),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[168,22]),22]),
[iquote('para_into,168.1.1.2,21.1.1,demod,22')] ).
cnf(181,plain,
converse(one) = one,
inference(para_into,[status(thm),theory(equality)],[178,16]),
[iquote('para_into,178.1.1,16.1.1')] ).
cnf(183,plain,
composition(one,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[178]),181]),
[iquote('back_demod,178,demod,181')] ).
cnf(185,plain,
join(complement(A),complement(A)) = complement(A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,181]),183,183]),
[iquote('para_into,27.1.1.1.1,180.1.1,demod,183,183')] ).
cnf(200,plain,
join(composition(converse(A),complement(composition(A,top))),zero) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,53]),53]),
[iquote('para_into,27.1.1.2,52.1.1,demod,53')] ).
cnf(221,plain,
join(zero,zero) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[185,53]),53,53]),
[iquote('para_into,184.1.1.1,52.1.1,demod,53,53')] ).
cnf(234,plain,
complement(zero) = meet(top,top),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[104]),221]),
[iquote('back_demod,104,demod,221')] ).
cnf(249,plain,
complement(complement(A)) = meet(A,A),
inference(para_from,[status(thm),theory(equality)],[185,12]),
[iquote('para_from,184.1.1,11.1.1.1')] ).
cnf(256,plain,
join(zero,join(zero,A)) = join(zero,A),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[221,6])]),
[iquote('para_from,220.1.1,5.1.1.1,flip.1')] ).
cnf(345,plain,
join(meet(composition(dollar_c2,dollar_c3),dollar_c1),meet(composition(dollar_c2,zero),dollar_c1)) = meet(composition(dollar_c2,zero),dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[37,42]),42]),
[iquote('para_into,37.1.1.2.1.2,41.1.1,demod,42')] ).
cnf(398,plain,
join(zero,meet(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,34]),185,249]),
[iquote('para_into,43.1.1.1,33.1.1,demod,185,249')] ).
cnf(425,plain,
join(converse(complement(one)),one) = converse(top),
inference(para_into,[status(thm),theory(equality)],[150,181]),
[iquote('para_into,150.1.1.2,180.1.1')] ).
cnf(429,plain,
join(one,converse(complement(one))) = converse(top),
inference(para_into,[status(thm),theory(equality)],[425,3]),
[iquote('para_into,425.1.1,3.1.1')] ).
cnf(434,plain,
join(zero,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[256,398]),398]),
[iquote('para_into,256.1.1.2,397.1.1,demod,398')] ).
cnf(438,plain,
join(A,zero) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[256,3]),434,434]),
[iquote('para_into,256.1.1.2,3.1.1,demod,434,434')] ).
cnf(440,plain,
meet(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[398]),434]),
[iquote('back_demod,397,demod,434')] ).
cnf(453,plain,
complement(zero) = top,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[234]),440]),
[iquote('back_demod,234,demod,440')] ).
cnf(457,plain,
composition(converse(A),complement(composition(A,top))) = zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[200]),438]),
[iquote('back_demod,200,demod,438')] ).
cnf(466,plain,
complement(complement(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[249]),440]),
[iquote('back_demod,248,demod,440')] ).
cnf(469,plain,
complement(join(complement(A),top)) = meet(A,zero),
inference(para_from,[status(thm),theory(equality)],[453,12]),
[iquote('para_from,453.1.1,11.1.1.1.2')] ).
cnf(480,plain,
join(complement(A),top) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[61,440]),46]),
[iquote('para_into,61.1.1.2.2,439.1.1,demod,46')] ).
cnf(481,plain,
meet(A,zero) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[469]),480,53])]),
[iquote('back_demod,469,demod,480,53,flip.1')] ).
cnf(483,plain,
join(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[466,185]),466,466]),
[iquote('para_from,465.1.1,184.1.1.2,demod,466,466')] ).
cnf(486,plain,
meet(zero,A) = zero,
inference(para_into,[status(thm),theory(equality)],[481,54]),
[iquote('para_into,481.1.1,54.1.1')] ).
cnf(498,plain,
join(top,A) = top,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,483]),46])]),
[iquote('para_into,73.1.1.2,483.1.1,demod,46,flip.1')] ).
cnf(499,plain,
join(complement(one),converse(top)) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,429]),498]),
[iquote('para_into,73.1.1.2,429.1.1,demod,498')] ).
cnf(506,plain,
join(A,top) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,73]),466,498,498]),
[iquote('para_into,73.1.1.2,73.1.1,demod,466,498,498')] ).
cnf(525,plain,
converse(top) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[499,23]),22,506]),
[iquote('para_from,499.1.1,23.1.1.1,demod,22,506')] ).
cnf(586,plain,
composition(top,complement(composition(top,top))) = zero,
inference(para_into,[status(thm),theory(equality)],[457,525]),
[iquote('para_into,457.1.1.1,525.1.1')] ).
cnf(588,plain,
composition(A,complement(composition(top,top))) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[586,19]),438,506,586]),
[iquote('para_from,585.1.1,19.1.1.2,demod,438,506,586')] ).
cnf(590,plain,
composition(A,zero) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[586,97]),588,434,498,588]),
[iquote('para_from,585.1.1,97.1.1.1,demod,588,434,498,588')] ).
cnf(591,plain,
meet(composition(dollar_c2,dollar_c3),dollar_c1) = zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[345]),590,486,438,590,486]),
[iquote('back_demod,345,demod,590,486,438,590,486')] ).
cnf(593,plain,
$false,
inference(binary,[status(thm)],[591,1]),
[iquote('binary,591.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL011+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:00:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.77/1.97 ----- Otter 3.3f, August 2004 -----
% 1.77/1.97 The process was started by sandbox2 on n004.cluster.edu,
% 1.77/1.97 Wed Jul 27 10:00:51 2022
% 1.77/1.97 The command was "./otter". The process ID is 1190.
% 1.77/1.97
% 1.77/1.97 set(prolog_style_variables).
% 1.77/1.97 set(auto).
% 1.77/1.97 dependent: set(auto1).
% 1.77/1.97 dependent: set(process_input).
% 1.77/1.97 dependent: clear(print_kept).
% 1.77/1.97 dependent: clear(print_new_demod).
% 1.77/1.97 dependent: clear(print_back_demod).
% 1.77/1.97 dependent: clear(print_back_sub).
% 1.77/1.97 dependent: set(control_memory).
% 1.77/1.97 dependent: assign(max_mem, 12000).
% 1.77/1.97 dependent: assign(pick_given_ratio, 4).
% 1.77/1.97 dependent: assign(stats_level, 1).
% 1.77/1.97 dependent: assign(max_seconds, 10800).
% 1.77/1.97 clear(print_given).
% 1.77/1.97
% 1.77/1.97 formula_list(usable).
% 1.77/1.97 all A (A=A).
% 1.77/1.97 all X0 X1 (join(X0,X1)=join(X1,X0)).
% 1.77/1.97 all X0 X1 X2 (join(X0,join(X1,X2))=join(join(X0,X1),X2)).
% 1.77/1.97 all X0 X1 (X0=join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))).
% 1.77/1.97 all X0 X1 (meet(X0,X1)=complement(join(complement(X0),complement(X1)))).
% 1.77/1.97 all X0 X1 X2 (composition(X0,composition(X1,X2))=composition(composition(X0,X1),X2)).
% 1.77/1.97 all X0 (composition(X0,one)=X0).
% 1.77/1.97 all X0 X1 X2 (composition(join(X0,X1),X2)=join(composition(X0,X2),composition(X1,X2))).
% 1.77/1.97 all X0 (converse(converse(X0))=X0).
% 1.77/1.97 all X0 X1 (converse(join(X0,X1))=join(converse(X0),converse(X1))).
% 1.77/1.97 all X0 X1 (converse(composition(X0,X1))=composition(converse(X1),converse(X0))).
% 1.77/1.97 all X0 X1 (join(composition(converse(X0),complement(composition(X0,X1))),complement(X1))=complement(X1)).
% 1.77/1.97 all X0 (top=join(X0,complement(X0))).
% 1.77/1.97 all X0 (zero=meet(X0,complement(X0))).
% 1.77/1.97 all X0 X1 X2 (join(meet(composition(X0,X1),X2),composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2))))=composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2)))).
% 1.77/1.97 all X0 X1 X2 (join(meet(composition(X0,X1),X2),meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2))=meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2)).
% 1.77/1.97 all X0 X1 X2 (join(meet(composition(X0,X1),X2),meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2))=meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2)).
% 1.77/1.97 -(all X0 X1 X2 (meet(X0,composition(converse(X1),X2))=zero->meet(composition(X1,X0),X2)=zero)).
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 -------> usable clausifies to:
% 1.77/1.97
% 1.77/1.97 list(usable).
% 1.77/1.97 0 [] A=A.
% 1.77/1.97 0 [] join(X0,X1)=join(X1,X0).
% 1.77/1.97 0 [] join(X0,join(X1,X2))=join(join(X0,X1),X2).
% 1.77/1.97 0 [] X0=join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))).
% 1.77/1.97 0 [] meet(X0,X1)=complement(join(complement(X0),complement(X1))).
% 1.77/1.97 0 [] composition(X0,composition(X1,X2))=composition(composition(X0,X1),X2).
% 1.77/1.97 0 [] composition(X0,one)=X0.
% 1.77/1.97 0 [] composition(join(X0,X1),X2)=join(composition(X0,X2),composition(X1,X2)).
% 1.77/1.97 0 [] converse(converse(X0))=X0.
% 1.77/1.97 0 [] converse(join(X0,X1))=join(converse(X0),converse(X1)).
% 1.77/1.97 0 [] converse(composition(X0,X1))=composition(converse(X1),converse(X0)).
% 1.77/1.97 0 [] join(composition(converse(X0),complement(composition(X0,X1))),complement(X1))=complement(X1).
% 1.77/1.97 0 [] top=join(X0,complement(X0)).
% 1.77/1.97 0 [] zero=meet(X0,complement(X0)).
% 1.77/1.97 0 [] join(meet(composition(X0,X1),X2),composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2))))=composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2))).
% 1.77/1.97 0 [] join(meet(composition(X0,X1),X2),meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2))=meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2).
% 1.77/1.97 0 [] join(meet(composition(X0,X1),X2),meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2))=meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2).
% 1.77/1.97 0 [] meet($c3,composition(converse($c2),$c1))=zero.
% 1.77/1.97 0 [] meet(composition($c2,$c3),$c1)!=zero.
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.77/1.97
% 1.77/1.97 All clauses are units, and equality is present; the
% 1.77/1.97 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.77/1.97
% 1.77/1.97 dependent: set(knuth_bendix).
% 1.77/1.97 dependent: set(anl_eq).
% 1.77/1.97 dependent: set(para_from).
% 1.77/1.97 dependent: set(para_into).
% 1.77/1.97 dependent: clear(para_from_right).
% 1.77/1.97 dependent: clear(para_into_right).
% 1.77/1.97 dependent: set(para_from_vars).
% 1.77/1.97 dependent: set(eq_units_both_ways).
% 1.77/1.97 dependent: set(dynamic_demod_all).
% 1.77/1.97 dependent: set(dynamic_demod).
% 1.77/1.97 dependent: set(order_eq).
% 1.77/1.97 dependent: set(back_demod).
% 1.77/1.97 dependent: set(lrpo).
% 1.77/1.97
% 1.77/1.97 ------------> process usable:
% 1.77/1.97 ** KEPT (pick-wt=7): 1 [] meet(composition($c2,$c3),$c1)!=zero.
% 1.77/1.97
% 1.77/1.97 ------------> process sos:
% 1.77/1.97 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.77/1.97 ** KEPT (pick-wt=7): 3 [] join(A,B)=join(B,A).
% 1.77/1.97 ** KEPT (pick-wt=11): 5 [copy,4,flip.1] join(join(A,B),C)=join(A,join(B,C)).
% 1.77/1.97 ---> New Demodulator: 6 [new_demod,5] join(join(A,B),C)=join(A,join(B,C)).
% 1.77/1.97 ** KEPT (pick-wt=14): 8 [copy,7,flip.1] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.77/1.97 ---> New Demodulator: 9 [new_demod,8] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.77/1.97 ** KEPT (pick-wt=10): 11 [copy,10,flip.1] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.77/1.97 ---> New Demodulator: 12 [new_demod,11] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.77/1.97 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.77/1.97 ---> New Demodulator: 15 [new_demod,14] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.77/1.97 ** KEPT (pick-wt=5): 16 [] composition(A,one)=A.
% 1.77/1.97 ---> New Demodulator: 17 [new_demod,16] composition(A,one)=A.
% 1.77/1.97 ** KEPT (pick-wt=13): 19 [copy,18,flip.1] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.77/1.97 ---> New Demodulator: 20 [new_demod,19] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.77/1.97 ** KEPT (pick-wt=5): 21 [] converse(converse(A))=A.
% 1.77/1.97 ---> New Demodulator: 22 [new_demod,21] converse(converse(A))=A.
% 1.77/1.97 ** KEPT (pick-wt=10): 23 [] converse(join(A,B))=join(converse(A),converse(B)).
% 1.77/1.97 ---> New Demodulator: 24 [new_demod,23] converse(join(A,B))=join(converse(A),converse(B)).
% 1.77/1.97 ** KEPT (pick-wt=10): 25 [] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.77/1.97 ---> New Demodulator: 26 [new_demod,25] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.77/1.97 ** KEPT (pick-wt=13): 27 [] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.77/1.97 ---> New Demodulator: 28 [new_demod,27] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.77/1.97 ** KEPT (pick-wt=6): 30 [copy,29,flip.1] join(A,complement(A))=top.
% 1.77/1.97 ---> New Demodulator: 31 [new_demod,30] join(A,complement(A))=top.
% 1.77/1.97 ** KEPT (pick-wt=6): 33 [copy,32,flip.1] meet(A,complement(A))=zero.
% 1.77/1.97 ---> New Demodulator: 34 [new_demod,33] meet(A,complement(A))=zero.
% 1.77/1.97 ** KEPT (pick-wt=33): 35 [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))))=composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 1.77/1.97 ---> New Demodulator: 36 [new_demod,35] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))))=composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 1.77/1.97 ** KEPT (pick-wt=27): 37 [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C))=meet(composition(A,meet(B,composition(converse(A),C))),C).
% 1.77/1.97 ---> New Demodulator: 38 [new_demod,37] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C))=meet(composition(A,meet(B,composition(converse(A),C))),C).
% 1.77/1.97 ** KEPT (pick-wt=27): 39 [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C))=meet(composition(meet(A,composition(C,converse(B))),B),C).
% 1.77/1.97 ---> New Demodulator: 40 [new_demod,39] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C))=meet(composition(meet(A,composition(C,converse(B))),B),C).
% 1.77/1.97 ** KEPT (pick-wt=8): 41 [] meet($c3,composition(converse($c2),$c1))=zero.
% 1.77/1.97 ---> New Demodulator: 42 [new_demod,41] meet($c3,composition(converse($c2),$c1))=zero.
% 1.77/1.97 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.77/1.97 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] join(A,B)=join(B,A).
% 1.77/1.97 >>>> Starting back demodulation with 6.
% 1.82/2.00 >>>> Starting back demodulation with 9.
% 1.82/2.00 >>>> Starting back demodulation with 12.
% 1.82/2.00 >> back demodulating 8 with 12.
% 1.82/2.00 >>>> Starting back demodulation with 15.
% 1.82/2.00 >>>> Starting back demodulation with 17.
% 1.82/2.00 >>>> Starting back demodulation with 20.
% 1.82/2.00 >>>> Starting back demodulation with 22.
% 1.82/2.00 >>>> Starting back demodulation with 24.
% 1.82/2.00 >>>> Starting back demodulation with 26.
% 1.82/2.00 >>>> Starting back demodulation with 28.
% 1.82/2.00 >>>> Starting back demodulation with 31.
% 1.82/2.00 >>>> Starting back demodulation with 34.
% 1.82/2.00 >>>> Starting back demodulation with 36.
% 1.82/2.00 >>>> Starting back demodulation with 38.
% 1.82/2.00 >>>> Starting back demodulation with 40.
% 1.82/2.00 >>>> Starting back demodulation with 42.
% 1.82/2.00 >>>> Starting back demodulation with 44.
% 1.82/2.00
% 1.82/2.00 ======= end of input processing =======
% 1.82/2.00
% 1.82/2.00 =========== start of search ===========
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Resetting weight limit to 9.
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Resetting weight limit to 9.
% 1.82/2.00
% 1.82/2.00 sos_size=117
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Resetting weight limit to 8.
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Resetting weight limit to 8.
% 1.82/2.00
% 1.82/2.00 sos_size=67
% 1.82/2.00
% 1.82/2.00 -------- PROOF --------
% 1.82/2.00
% 1.82/2.00 ----> UNIT CONFLICT at 0.03 sec ----> 593 [binary,591.1,1.1] $F.
% 1.82/2.00
% 1.82/2.00 Length of proof is 50. Level of proof is 18.
% 1.82/2.00
% 1.82/2.00 ---------------- PROOF ----------------
% 1.82/2.00 % SZS status Theorem
% 1.82/2.00 % SZS output start Refutation
% See solution above
% 1.82/2.00 ------------ end of proof -------------
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Search stopped by max_proofs option.
% 1.82/2.00
% 1.82/2.00
% 1.82/2.00 Search stopped by max_proofs option.
% 1.82/2.00
% 1.82/2.00 ============ end of search ============
% 1.82/2.00
% 1.82/2.00 -------------- statistics -------------
% 1.82/2.00 clauses given 135
% 1.82/2.00 clauses generated 2896
% 1.82/2.00 clauses kept 301
% 1.82/2.00 clauses forward subsumed 1869
% 1.82/2.00 clauses back subsumed 0
% 1.82/2.00 Kbytes malloced 4882
% 1.82/2.00
% 1.82/2.00 ----------- times (seconds) -----------
% 1.82/2.00 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.82/2.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.00 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/2.00
% 1.82/2.00 That finishes the proof of the theorem.
% 1.82/2.00
% 1.82/2.00 Process 1190 finished Wed Jul 27 10:00:53 2022
% 1.82/2.00 Otter interrupted
% 1.82/2.00 PROOF FOUND
%------------------------------------------------------------------------------