TSTP Solution File: REL048+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : REL048+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:59 EDT 2022
% Result : Theorem 1.73s 1.95s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of clauses : 68 ( 65 unt; 0 nHn; 21 RR)
% Number of literals : 71 ( 70 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 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 : 65 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( join(dollar_c3,dollar_c1) != dollar_c1
| join(dollar_c2,dollar_c1) != dollar_c1 ),
file('REL048+1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('REL048+1.p',unknown),
[] ).
cnf(3,axiom,
join(A,B) = join(B,A),
file('REL048+1.p',unknown),
[] ).
cnf(4,axiom,
join(A,join(B,C)) = join(join(A,B),C),
file('REL048+1.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('REL048+1.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('REL048+1.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('REL048+1.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('REL048+1.p',unknown),
[] ).
cnf(22,axiom,
converse(converse(A)) = A,
file('REL048+1.p',unknown),
[] ).
cnf(25,axiom,
converse(composition(A,B)) = composition(converse(B),converse(A)),
file('REL048+1.p',unknown),
[] ).
cnf(27,axiom,
join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B),
file('REL048+1.p',unknown),
[] ).
cnf(29,axiom,
top = join(A,complement(A)),
file('REL048+1.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('REL048+1.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(35,axiom,
join(join(dollar_c3,dollar_c2),dollar_c1) = dollar_c1,
file('REL048+1.p',unknown),
[] ).
cnf(36,plain,
join(dollar_c3,join(dollar_c2,dollar_c1)) = dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[35]),6]),
[iquote('copy,35,demod,6')] ).
cnf(38,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(40,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(42,plain,
( join(dollar_c3,dollar_c1) != dollar_c1
| join(dollar_c1,dollar_c2) != dollar_c1 ),
inference(para_from,[status(thm),theory(equality)],[3,1]),
[iquote('para_from,3.1.1,1.2.1')] ).
cnf(45,plain,
join(dollar_c3,join(dollar_c1,dollar_c2)) = dollar_c1,
inference(para_into,[status(thm),theory(equality)],[36,3]),
[iquote('para_into,36.1.1.2,3.1.1')] ).
cnf(47,plain,
join(dollar_c2,join(dollar_c1,dollar_c3)) = dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[36,3]),6]),
[iquote('para_into,36.1.1,3.1.1,demod,6')] ).
cnf(54,plain,
join(dollar_c2,join(dollar_c1,join(dollar_c3,A))) = join(dollar_c1,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,47]),6])]),
[iquote('para_into,5.1.1.1,46.1.1,demod,6,flip.1')] ).
cnf(56,plain,
join(dollar_c3,join(dollar_c1,join(dollar_c2,A))) = join(dollar_c1,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,45]),6])]),
[iquote('para_into,5.1.1.1,44.1.1,demod,6,flip.1')] ).
cnf(58,plain,
join(complement(A),join(A,B)) = join(top,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,40])]),
[iquote('para_into,5.1.1.1,40.1.1,flip.1')] ).
cnf(79,plain,
complement(top) = meet(complement(A),A),
inference(para_into,[status(thm),theory(equality)],[12,40]),
[iquote('para_into,11.1.1.1,40.1.1')] ).
cnf(81,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(83,plain,
meet(complement(A),A) = zero,
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[79])]),81]),
[iquote('copy,79,flip.1,demod,81')] ).
cnf(91,plain,
composition(A,composition(one,B)) = composition(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,16])]),
[iquote('para_into,14.1.1.1,16.1.1,flip.1')] ).
cnf(94,plain,
complement(join(complement(A),zero)) = meet(A,top),
inference(para_from,[status(thm),theory(equality)],[81,12]),
[iquote('para_from,80.1.1,11.1.1.1.2')] ).
cnf(146,plain,
complement(join(zero,zero)) = meet(top,top),
inference(para_into,[status(thm),theory(equality)],[94,81]),
[iquote('para_into,93.1.1.1.1,80.1.1')] ).
cnf(158,plain,
meet(meet(top,top),join(zero,zero)) = zero,
inference(para_from,[status(thm),theory(equality)],[146,83]),
[iquote('para_from,146.1.1,83.1.1.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(175,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(177,plain,
composition(one,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[175,91]),175])]),
[iquote('para_into,174.1.1,91.1.1,demod,175,flip.1')] ).
cnf(178,plain,
converse(one) = one,
inference(para_into,[status(thm),theory(equality)],[175,16]),
[iquote('para_into,174.1.1,16.1.1')] ).
cnf(185,plain,
join(complement(A),complement(A)) = complement(A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,178]),177,177]),
[iquote('para_into,27.1.1.1.1,178.1.1,demod,177,177')] ).
cnf(213,plain,
join(zero,zero) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[185,81]),81,81]),
[iquote('para_into,184.1.1.1,80.1.1,demod,81,81')] ).
cnf(224,plain,
meet(meet(top,top),zero) = zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[158]),213]),
[iquote('back_demod,158,demod,213')] ).
cnf(226,plain,
complement(zero) = meet(top,top),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[146]),213]),
[iquote('back_demod,146,demod,213')] ).
cnf(229,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(249,plain,
join(zero,meet(A,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[38,34]),185,229]),
[iquote('para_into,38.1.1.1,33.1.1,demod,185,229')] ).
cnf(259,plain,
join(meet(A,A),zero) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[38,40]),81]),
[iquote('para_into,38.1.1.2.1,40.1.1,demod,81')] ).
cnf(274,plain,
join(zero,meet(meet(top,top),top)) = meet(top,top),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[224,38]),94]),
[iquote('para_from,224.1.1,38.1.1.1,demod,94')] ).
cnf(284,plain,
meet(complement(A),top) = complement(A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[229,94]),259])]),
[iquote('para_from,228.1.1,93.1.1.1.1,demod,259,flip.1')] ).
cnf(289,plain,
join(meet(A,A),complement(A)) = top,
inference(para_from,[status(thm),theory(equality)],[229,40]),
[iquote('para_from,228.1.1,40.1.1.1')] ).
cnf(304,plain,
( join(dollar_c1,dollar_c3) != dollar_c1
| join(dollar_c1,dollar_c2) != dollar_c1 ),
inference(para_into,[status(thm),theory(equality)],[42,3]),
[iquote('para_into,42.1.1,3.1.1')] ).
cnf(306,plain,
meet(meet(A,A),top) = meet(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[284,229]),229]),
[iquote('para_into,284.1.1.1,228.1.1,demod,229')] ).
cnf(314,plain,
meet(top,top) = top,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[274]),306,249])]),
[iquote('back_demod,274,demod,306,249,flip.1')] ).
cnf(318,plain,
complement(zero) = top,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[226]),314]),
[iquote('back_demod,226,demod,314')] ).
cnf(321,plain,
join(complement(A),complement(join(meet(A,A),top))) = complement(A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[284,38]),229]),
[iquote('para_from,284.1.1,38.1.1.1,demod,229')] ).
cnf(462,plain,
join(top,meet(A,A)) = join(top,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,249]),318])]),
[iquote('para_into,58.1.1.2,248.1.1,demod,318,flip.1')] ).
cnf(465,plain,
join(top,complement(A)) = top,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,185]),229,289])]),
[iquote('para_into,58.1.1.2,184.1.1,demod,229,289,flip.1')] ).
cnf(486,plain,
join(meet(A,A),top) = join(top,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,40]),229]),
[iquote('para_into,58.1.1.2,40.1.1,demod,229')] ).
cnf(512,plain,
join(complement(A),complement(join(top,A))) = complement(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[321]),486]),
[iquote('back_demod,321,demod,486')] ).
cnf(564,plain,
join(top,A) = top,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[465,229]),462]),
[iquote('para_into,465.1.1.2,228.1.1,demod,462')] ).
cnf(571,plain,
join(complement(A),zero) = complement(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[512]),564,81]),
[iquote('back_demod,512,demod,564,81')] ).
cnf(759,plain,
meet(A,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[571,229]),259,229])]),
[iquote('para_into,571.1.1.1,228.1.1,demod,259,229,flip.1')] ).
cnf(787,plain,
complement(complement(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[229]),759]),
[iquote('back_demod,228,demod,759')] ).
cnf(819,plain,
join(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[787,185]),787,787]),
[iquote('para_from,786.1.1,184.1.1.2,demod,787,787')] ).
cnf(862,plain,
join(dollar_c1,dollar_c2) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[819,56]),45])]),
[iquote('para_from,819.1.1,56.1.1.2.2,demod,45,flip.1')] ).
cnf(864,plain,
join(dollar_c1,dollar_c3) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[819,54]),47])]),
[iquote('para_from,819.1.1,54.1.1.2.2,demod,47,flip.1')] ).
cnf(869,plain,
dollar_c1 != dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[304]),864,862]),
[iquote('back_demod,304,demod,864,862')] ).
cnf(870,plain,
$false,
inference(binary,[status(thm)],[869,2]),
[iquote('binary,869.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : REL048+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n021.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 10:02:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.73/1.93 ----- Otter 3.3f, August 2004 -----
% 1.73/1.93 The process was started by sandbox2 on n021.cluster.edu,
% 1.73/1.93 Wed Jul 27 10:02:53 2022
% 1.73/1.93 The command was "./otter". The process ID is 13465.
% 1.73/1.93
% 1.73/1.93 set(prolog_style_variables).
% 1.73/1.93 set(auto).
% 1.73/1.93 dependent: set(auto1).
% 1.73/1.93 dependent: set(process_input).
% 1.73/1.93 dependent: clear(print_kept).
% 1.73/1.93 dependent: clear(print_new_demod).
% 1.73/1.93 dependent: clear(print_back_demod).
% 1.73/1.93 dependent: clear(print_back_sub).
% 1.73/1.93 dependent: set(control_memory).
% 1.73/1.93 dependent: assign(max_mem, 12000).
% 1.73/1.93 dependent: assign(pick_given_ratio, 4).
% 1.73/1.93 dependent: assign(stats_level, 1).
% 1.73/1.93 dependent: assign(max_seconds, 10800).
% 1.73/1.93 clear(print_given).
% 1.73/1.93
% 1.73/1.93 formula_list(usable).
% 1.73/1.93 all A (A=A).
% 1.73/1.93 all X0 X1 (join(X0,X1)=join(X1,X0)).
% 1.73/1.93 all X0 X1 X2 (join(X0,join(X1,X2))=join(join(X0,X1),X2)).
% 1.73/1.93 all X0 X1 (X0=join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))).
% 1.73/1.93 all X0 X1 (meet(X0,X1)=complement(join(complement(X0),complement(X1)))).
% 1.73/1.93 all X0 X1 X2 (composition(X0,composition(X1,X2))=composition(composition(X0,X1),X2)).
% 1.73/1.93 all X0 (composition(X0,one)=X0).
% 1.73/1.93 all X0 X1 X2 (composition(join(X0,X1),X2)=join(composition(X0,X2),composition(X1,X2))).
% 1.73/1.93 all X0 (converse(converse(X0))=X0).
% 1.73/1.93 all X0 X1 (converse(join(X0,X1))=join(converse(X0),converse(X1))).
% 1.73/1.93 all X0 X1 (converse(composition(X0,X1))=composition(converse(X1),converse(X0))).
% 1.73/1.93 all X0 X1 (join(composition(converse(X0),complement(composition(X0,X1))),complement(X1))=complement(X1)).
% 1.73/1.93 all X0 (top=join(X0,complement(X0))).
% 1.73/1.93 all X0 (zero=meet(X0,complement(X0))).
% 1.73/1.93 -(all X0 X1 X2 (join(join(X0,X1),X2)=X2->join(X0,X2)=X2&join(X1,X2)=X2)).
% 1.73/1.93 end_of_list.
% 1.73/1.93
% 1.73/1.93 -------> usable clausifies to:
% 1.73/1.93
% 1.73/1.93 list(usable).
% 1.73/1.93 0 [] A=A.
% 1.73/1.93 0 [] join(X0,X1)=join(X1,X0).
% 1.73/1.93 0 [] join(X0,join(X1,X2))=join(join(X0,X1),X2).
% 1.73/1.93 0 [] X0=join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))).
% 1.73/1.93 0 [] meet(X0,X1)=complement(join(complement(X0),complement(X1))).
% 1.73/1.93 0 [] composition(X0,composition(X1,X2))=composition(composition(X0,X1),X2).
% 1.73/1.93 0 [] composition(X0,one)=X0.
% 1.73/1.93 0 [] composition(join(X0,X1),X2)=join(composition(X0,X2),composition(X1,X2)).
% 1.73/1.93 0 [] converse(converse(X0))=X0.
% 1.73/1.93 0 [] converse(join(X0,X1))=join(converse(X0),converse(X1)).
% 1.73/1.93 0 [] converse(composition(X0,X1))=composition(converse(X1),converse(X0)).
% 1.73/1.93 0 [] join(composition(converse(X0),complement(composition(X0,X1))),complement(X1))=complement(X1).
% 1.73/1.93 0 [] top=join(X0,complement(X0)).
% 1.73/1.93 0 [] zero=meet(X0,complement(X0)).
% 1.73/1.93 0 [] join(join($c3,$c2),$c1)=$c1.
% 1.73/1.93 0 [] join($c3,$c1)!=$c1|join($c2,$c1)!=$c1.
% 1.73/1.93 end_of_list.
% 1.73/1.93
% 1.73/1.93 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.73/1.93
% 1.73/1.93 This is a Horn set with equality. The strategy will be
% 1.73/1.93 Knuth-Bendix and hyper_res, with positive clauses in
% 1.73/1.93 sos and nonpositive clauses in usable.
% 1.73/1.93
% 1.73/1.93 dependent: set(knuth_bendix).
% 1.73/1.93 dependent: set(anl_eq).
% 1.73/1.93 dependent: set(para_from).
% 1.73/1.93 dependent: set(para_into).
% 1.73/1.93 dependent: clear(para_from_right).
% 1.73/1.93 dependent: clear(para_into_right).
% 1.73/1.93 dependent: set(para_from_vars).
% 1.73/1.93 dependent: set(eq_units_both_ways).
% 1.73/1.93 dependent: set(dynamic_demod_all).
% 1.73/1.93 dependent: set(dynamic_demod).
% 1.73/1.93 dependent: set(order_eq).
% 1.73/1.93 dependent: set(back_demod).
% 1.73/1.93 dependent: set(lrpo).
% 1.73/1.93 dependent: set(hyper_res).
% 1.73/1.93 dependent: clear(order_hyper).
% 1.73/1.93
% 1.73/1.93 ------------> process usable:
% 1.73/1.93 ** KEPT (pick-wt=10): 1 [] join($c3,$c1)!=$c1|join($c2,$c1)!=$c1.
% 1.73/1.93
% 1.73/1.93 ------------> process sos:
% 1.73/1.93 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.73/1.93 ** KEPT (pick-wt=7): 3 [] join(A,B)=join(B,A).
% 1.73/1.93 ** KEPT (pick-wt=11): 5 [copy,4,flip.1] join(join(A,B),C)=join(A,join(B,C)).
% 1.73/1.93 ---> New Demodulator: 6 [new_demod,5] join(join(A,B),C)=join(A,join(B,C)).
% 1.73/1.93 ** KEPT (pick-wt=14): 8 [copy,7,flip.1] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.73/1.93 ---> New Demodulator: 9 [new_demod,8] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.73/1.93 ** KEPT (pick-wt=10): 11 [copy,10,flip.1] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.73/1.93 ---> New Demodulator: 12 [new_demod,11] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.73/1.93 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.73/1.95 ---> New Demodulator: 15 [new_demod,14] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.73/1.95 ** KEPT (pick-wt=5): 16 [] composition(A,one)=A.
% 1.73/1.95 ---> New Demodulator: 17 [new_demod,16] composition(A,one)=A.
% 1.73/1.95 ** KEPT (pick-wt=13): 19 [copy,18,flip.1] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.73/1.95 ---> New Demodulator: 20 [new_demod,19] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.73/1.95 ** KEPT (pick-wt=5): 21 [] converse(converse(A))=A.
% 1.73/1.95 ---> New Demodulator: 22 [new_demod,21] converse(converse(A))=A.
% 1.73/1.95 ** KEPT (pick-wt=10): 23 [] converse(join(A,B))=join(converse(A),converse(B)).
% 1.73/1.95 ---> New Demodulator: 24 [new_demod,23] converse(join(A,B))=join(converse(A),converse(B)).
% 1.73/1.95 ** KEPT (pick-wt=10): 25 [] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.73/1.95 ---> New Demodulator: 26 [new_demod,25] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.73/1.95 ** KEPT (pick-wt=13): 27 [] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.73/1.95 ---> New Demodulator: 28 [new_demod,27] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.73/1.95 ** KEPT (pick-wt=6): 30 [copy,29,flip.1] join(A,complement(A))=top.
% 1.73/1.95 ---> New Demodulator: 31 [new_demod,30] join(A,complement(A))=top.
% 1.73/1.95 ** KEPT (pick-wt=6): 33 [copy,32,flip.1] meet(A,complement(A))=zero.
% 1.73/1.95 ---> New Demodulator: 34 [new_demod,33] meet(A,complement(A))=zero.
% 1.73/1.95 ** KEPT (pick-wt=7): 36 [copy,35,demod,6] join($c3,join($c2,$c1))=$c1.
% 1.73/1.95 ---> New Demodulator: 37 [new_demod,36] join($c3,join($c2,$c1))=$c1.
% 1.73/1.95 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.73/1.95 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] join(A,B)=join(B,A).
% 1.73/1.95 >>>> Starting back demodulation with 6.
% 1.73/1.95 >>>> Starting back demodulation with 9.
% 1.73/1.95 >>>> Starting back demodulation with 12.
% 1.73/1.95 >> back demodulating 8 with 12.
% 1.73/1.95 >>>> Starting back demodulation with 15.
% 1.73/1.95 >>>> Starting back demodulation with 17.
% 1.73/1.95 >>>> Starting back demodulation with 20.
% 1.73/1.95 >>>> Starting back demodulation with 22.
% 1.73/1.95 >>>> Starting back demodulation with 24.
% 1.73/1.95 >>>> Starting back demodulation with 26.
% 1.73/1.95 >>>> Starting back demodulation with 28.
% 1.73/1.95 >>>> Starting back demodulation with 31.
% 1.73/1.95 >>>> Starting back demodulation with 34.
% 1.73/1.95 >>>> Starting back demodulation with 37.
% 1.73/1.95 >>>> Starting back demodulation with 39.
% 1.73/1.95
% 1.73/1.95 ======= end of input processing =======
% 1.73/1.95
% 1.73/1.95 =========== start of search ===========
% 1.73/1.95
% 1.73/1.95 -------- PROOF --------
% 1.73/1.95
% 1.73/1.95 ----> UNIT CONFLICT at 0.02 sec ----> 870 [binary,869.1,2.1] $F.
% 1.73/1.95
% 1.73/1.95 Length of proof is 53. Level of proof is 17.
% 1.73/1.95
% 1.73/1.95 ---------------- PROOF ----------------
% 1.73/1.95 % SZS status Theorem
% 1.73/1.95 % SZS output start Refutation
% See solution above
% 1.73/1.95 ------------ end of proof -------------
% 1.73/1.95
% 1.73/1.95
% 1.73/1.95 Search stopped by max_proofs option.
% 1.73/1.95
% 1.73/1.95
% 1.73/1.95 Search stopped by max_proofs option.
% 1.73/1.95
% 1.73/1.95 ============ end of search ============
% 1.73/1.95
% 1.73/1.95 -------------- statistics -------------
% 1.73/1.95 clauses given 94
% 1.73/1.95 clauses generated 1166
% 1.73/1.95 clauses kept 456
% 1.73/1.95 clauses forward subsumed 1022
% 1.73/1.95 clauses back subsumed 4
% 1.73/1.95 Kbytes malloced 3906
% 1.73/1.95
% 1.73/1.95 ----------- times (seconds) -----------
% 1.73/1.95 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.73/1.95 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.73/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.73/1.95
% 1.73/1.95 That finishes the proof of the theorem.
% 1.73/1.95
% 1.73/1.95 Process 13465 finished Wed Jul 27 10:02:54 2022
% 1.73/1.95 Otter interrupted
% 1.73/1.95 PROOF FOUND
%------------------------------------------------------------------------------