TSTP Solution File: REL006-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL006-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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 : 600s
% DateTime : Mon Jul 18 19:15:15 EDT 2022
% Result : Unsatisfiable 1.69s 2.07s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of clauses : 88 ( 88 unt; 0 nHn; 21 RR)
% Number of literals : 88 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 103 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL006-1.p',unknown),
[] ).
cnf(2,plain,
equal(join(join(A,B),C),join(A,join(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(complement(join(complement(A),complement(B))),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(join(meet(A,B),complement(join(complement(A),B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(7,plain,
equal(composition(A,one),A),
file('REL006-1.p',unknown),
[] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL006-1.p',unknown),
[] ).
cnf(10,plain,
equal(converse(join(A,B)),join(converse(A),converse(B))),
file('REL006-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL006-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL006-1.p',unknown),
[] ).
cnf(13,plain,
equal(join(A,complement(A)),top),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(meet(A,complement(A)),zero),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(meet(converse(sk1),sk2),zero),
file('REL006-1.p',unknown),
[] ).
cnf(16,plain,
~ equal(meet(sk1,converse(sk2)),zero),
file('REL006-1.p',unknown),
[] ).
cnf(19,plain,
equal(join(A,join(B,C)),join(B,join(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),2]),
[iquote('para(1,2),demod([2])')] ).
cnf(20,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),4]),
[iquote('para(1,4),demod([4])')] ).
cnf(25,plain,
equal(join(meet(A,B),complement(join(B,complement(A)))),A),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(27,plain,
equal(meet(complement(A),A),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,20]),1]),
[iquote('para(14,20),flip(1)')] ).
cnf(28,plain,
equal(join(meet(join(complement(A),complement(B)),C),complement(join(meet(A,B),C))),join(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(29,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(30,plain,
equal(meet(sk2,converse(sk1)),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,20]),1]),
[iquote('para(15,20),flip(1)')] ).
cnf(31,plain,
equal(composition(converse(one),converse(A)),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1]),
[iquote('para(7,11),flip(1)')] ).
cnf(32,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,31]),9]),
[iquote('para(9,31),demod([9])')] ).
cnf(34,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,7]),1]),
[iquote('para(32,7),flip(1)')] ).
cnf(35,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),34]),
[iquote('back_demod(32),demod([34])')] ).
cnf(40,plain,
equal(complement(top),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,4]),14]),
[iquote('para(13,4),demod([14])')] ).
cnf(51,plain,
equal(complement(join(zero,complement(A))),meet(top,A)),
inference(para,[status(thm),theory(equality)],[40,4]),
[iquote('para(40,4)')] ).
cnf(54,plain,
equal(complement(join(zero,zero)),meet(top,top)),
inference(para,[status(thm),theory(equality)],[40,51]),
[iquote('para(40,51)')] ).
cnf(60,plain,
equal(join(A,join(complement(A),B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),1]),
[iquote('para(13,2),flip(1)')] ).
cnf(62,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),40]),
[iquote('para(13,5),demod([40])')] ).
cnf(63,plain,
equal(join(converse(A),converse(complement(A))),converse(top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),1]),
[iquote('para(13,10),flip(1)')] ).
cnf(65,plain,
equal(meet(join(complement(A),complement(B)),meet(A,B)),zero),
inference(para,[status(thm),theory(equality)],[4,14]),
[iquote('para(4,14)')] ).
cnf(66,plain,
equal(join(zero,meet(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,5]),4]),
[iquote('para(14,5),demod([4])')] ).
cnf(67,plain,
equal(join(meet(A,A),zero),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,1]),1]),
[iquote('para(66,1),flip(1)')] ).
cnf(69,plain,
equal(join(A,converse(complement(converse(A)))),converse(top)),
inference(para,[status(thm),theory(equality)],[9,63]),
[iquote('para(9,63)')] ).
cnf(100,plain,
equal(join(A,join(B,complement(A))),join(B,top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,19]),1]),
[iquote('para(13,19),flip(1)')] ).
cnf(139,plain,
equal(join(meet(A,complement(B)),meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,25]),
[iquote('para(4,25)')] ).
cnf(147,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[20,62]),
[iquote('para(20,62)')] ).
cnf(152,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[147,1]),1]),
[iquote('para(147,1),flip(1)')] ).
cnf(160,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,29]),152]),1]),
[iquote('para(27,29),demod([152]),flip(1)')] ).
cnf(165,plain,
equal(join(zero,complement(join(A,A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,5]),160]),
[iquote('para(27,5),demod([160])')] ).
cnf(166,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[160,51]),
[iquote('para(160,51)')] ).
cnf(169,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[54]),166]),
[iquote('back_demod(54),demod([166])')] ).
cnf(202,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[160,4]),
[iquote('para(160,4)')] ).
cnf(213,plain,
equal(complement(join(complement(A),B)),meet(A,complement(B))),
inference(para,[status(thm),theory(equality)],[160,4]),
[iquote('para(160,4)')] ).
cnf(229,plain,
equal(join(meet(sk2,complement(converse(sk1))),zero),sk2),
inference(para,[status(thm),theory(equality)],[30,29]),
[iquote('para(30,29)')] ).
cnf(230,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,12]),35,35]),
[iquote('para(34,12),demod([35,35])')] ).
cnf(243,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[160,230]),160,160]),
[iquote('para(160,230),demod([160,160])')] ).
cnf(244,plain,
equal(join(zero,complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[165]),243]),
[iquote('back_demod(165),demod([243])')] ).
cnf(257,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[160,244]),160]),
[iquote('para(160,244),demod([160])')] ).
cnf(264,plain,
equal(meet(top,complement(A)),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[166]),257]),1]),
[iquote('back_demod(166),demod([257]),flip(1)')] ).
cnf(265,plain,
equal(complement(zero),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[169]),264]),
[iquote('back_demod(169),demod([264])')] ).
cnf(270,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),257]),
[iquote('back_demod(66),demod([257])')] ).
cnf(271,plain,
equal(complement(zero),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[265]),270]),
[iquote('back_demod(265),demod([270])')] ).
cnf(272,plain,
equal(join(A,zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),270]),
[iquote('back_demod(67),demod([270])')] ).
cnf(273,plain,
equal(meet(sk2,complement(converse(sk1))),sk2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[229]),272]),
[iquote('back_demod(229),demod([272])')] ).
cnf(325,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[271,202]),
[iquote('para(271,202)')] ).
cnf(328,plain,
equal(complement(join(top,A)),meet(zero,complement(A))),
inference(para,[status(thm),theory(equality)],[271,213]),
[iquote('para(271,213)')] ).
cnf(353,plain,
equal(join(A,join(top,meet(complement(A),zero))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[325,13]),2]),
[iquote('para(325,13),demod([2])')] ).
cnf(367,plain,
equal(join(top,join(A,meet(zero,complement(A)))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[328,13]),2]),
[iquote('para(328,13),demod([2])')] ).
cnf(371,plain,
equal(join(top,complement(A)),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[243,60]),13]),1]),
[iquote('para(243,60),demod([13]),flip(1)')] ).
cnf(376,plain,
equal(meet(zero,A),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[371,328]),40,160]),1]),
[iquote('para(371,328),demod([40,160]),flip(1)')] ).
cnf(378,plain,
equal(join(top,A),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[367]),376,272]),
[iquote('back_demod(367),demod([376,272])')] ).
cnf(379,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[353]),378]),
[iquote('back_demod(353),demod([378])')] ).
cnf(384,plain,
equal(join(A,join(B,complement(A))),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[100]),379]),
[iquote('back_demod(100),demod([379])')] ).
cnf(450,plain,
equal(converse(top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[378,69]),1]),
[iquote('para(378,69),flip(1)')] ).
cnf(462,plain,
equal(complement(meet(A,B)),join(complement(A),complement(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[65,28]),243,257]),
[iquote('para(65,28),demod([243,257])')] ).
cnf(502,plain,
equal(complement(join(A,B)),meet(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[160,202]),
[iquote('para(160,202)')] ).
cnf(1040,plain,
equal(join(complement(sk2),converse(sk1)),complement(sk2)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[273,462]),160]),1]),
[iquote('para(273,462),demod([160]),flip(1)')] ).
cnf(1167,plain,
equal(join(converse(A),join(converse(B),converse(complement(A)))),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[384,10]),450,10]),1]),
[iquote('para(384,10),demod([450,10]),flip(1)')] ).
cnf(1180,plain,
equal(join(converse(A),join(B,converse(complement(A)))),top),
inference(para,[status(thm),theory(equality)],[9,1167]),
[iquote('para(9,1167)')] ).
cnf(1182,plain,
equal(join(converse(complement(A)),join(B,converse(A))),top),
inference(para,[status(thm),theory(equality)],[160,1180]),
[iquote('para(160,1180)')] ).
cnf(1243,plain,
equal(meet(complement(A),meet(complement(B),A)),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[384,502]),40,502,160]),1]),
[iquote('para(384,502),demod([40,502,160]),flip(1)')] ).
cnf(1244,plain,
equal(meet(complement(A),meet(B,A)),zero),
inference(para,[status(thm),theory(equality)],[160,1243]),
[iquote('para(160,1243)')] ).
cnf(1409,plain,
equal(meet(complement(A),join(complement(B),complement(A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1244,29]),462,272]),
[iquote('para(1244,29),demod([462,272])')] ).
cnf(1410,plain,
equal(meet(A,join(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[160,1409]),160,160]),
[iquote('para(160,1409),demod([160,160])')] ).
cnf(1412,plain,
equal(meet(A,join(B,A)),A),
inference(para,[status(thm),theory(equality)],[160,1410]),
[iquote('para(160,1410)')] ).
cnf(1493,plain,
equal(join(complement(A),meet(complement(B),complement(A))),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1412,462]),502]),1]),
[iquote('para(1412,462),demod([502]),flip(1)')] ).
cnf(1496,plain,
equal(join(A,meet(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[160,1493]),160,160]),
[iquote('para(160,1493),demod([160,160])')] ).
cnf(1497,plain,
equal(join(A,meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[160,1496]),
[iquote('para(160,1496)')] ).
cnf(1783,plain,
equal(join(converse(complement(sk1)),complement(sk2)),top),
inference(para,[status(thm),theory(equality)],[1040,1182]),
[iquote('para(1040,1182)')] ).
cnf(2139,plain,
equal(meet(complement(converse(complement(sk1))),sk2),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1783,502]),40,160]),1]),
[iquote('para(1783,502),demod([40,160]),flip(1)')] ).
cnf(2373,plain,
equal(meet(sk2,converse(complement(sk1))),sk2),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2139,139]),160,272]),
[iquote('para(2139,139),demod([160,272])')] ).
cnf(2390,plain,
equal(join(converse(complement(sk1)),sk2),converse(complement(sk1))),
inference(para,[status(thm),theory(equality)],[2373,1497]),
[iquote('para(2373,1497)')] ).
cnf(4921,plain,
equal(join(complement(sk1),converse(sk2)),complement(sk1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2390,10]),9,9]),1]),
[iquote('para(2390,10),demod([9,9]),flip(1)')] ).
cnf(4937,plain,
equal(meet(converse(sk2),complement(sk1)),converse(sk2)),
inference(para,[status(thm),theory(equality)],[4921,1412]),
[iquote('para(4921,1412)')] ).
cnf(5057,plain,
equal(meet(sk1,converse(sk2)),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4937,1244]),160]),
[iquote('para(4937,1244),demod([160])')] ).
cnf(5058,plain,
$false,
inference(conflict,[status(thm)],[5057,16]),
[iquote('conflict(5057,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : REL006-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 8 09:58:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/2.06 ----- EQP 0.9e, May 2009 -----
% 1.69/2.06 The job began on n020.cluster.edu, Fri Jul 8 09:58:14 2022
% 1.69/2.06 The command was "./eqp09e".
% 1.69/2.06
% 1.69/2.06 set(prolog_style_variables).
% 1.69/2.06 set(lrpo).
% 1.69/2.06 set(basic_paramod).
% 1.69/2.06 set(functional_subsume).
% 1.69/2.06 set(ordered_paramod).
% 1.69/2.06 set(prime_paramod).
% 1.69/2.06 set(para_pairs).
% 1.69/2.06 assign(pick_given_ratio,4).
% 1.69/2.06 clear(print_kept).
% 1.69/2.06 clear(print_new_demod).
% 1.69/2.06 clear(print_back_demod).
% 1.69/2.06 clear(print_given).
% 1.69/2.06 assign(max_mem,64000).
% 1.69/2.06 end_of_commands.
% 1.69/2.06
% 1.69/2.06 Usable:
% 1.69/2.06 end_of_list.
% 1.69/2.06
% 1.69/2.06 Sos:
% 1.69/2.06 0 (wt=-1) [] join(A,B) = join(B,A).
% 1.69/2.06 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 1.69/2.06 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 1.69/2.06 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 1.69/2.06 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 1.69/2.06 0 (wt=-1) [] composition(A,one) = A.
% 1.69/2.06 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 1.69/2.06 0 (wt=-1) [] converse(converse(A)) = A.
% 1.69/2.06 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.69/2.06 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.69/2.07 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.69/2.07 0 (wt=-1) [] top = join(A,complement(A)).
% 1.69/2.07 0 (wt=-1) [] zero = meet(A,complement(A)).
% 1.69/2.07 0 (wt=-1) [] meet(converse(sk1),sk2) = zero.
% 1.69/2.07 0 (wt=-1) [] -(meet(sk1,converse(sk2)) = zero).
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Demodulators:
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Passive:
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Starting to process input.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 1.69/2.07 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 1.69/2.07
% 1.69/2.07 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.69/2.07 2 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 1.69/2.07 3 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.69/2.07 4 is a new demodulator.
% 1.69/2.07 -> 4 back demodulating 3.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.69/2.07 5 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.69/2.07 6 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 1.69/2.07 7 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.69/2.07 8 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 1.69/2.07 9 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.69/2.07 10 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.69/2.07 11 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.69/2.07 12 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.69/2.07 13 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.69/2.07 14 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 15 (wt=6) [] meet(converse(sk1),sk2) = zero.
% 1.69/2.07 15 is a new demodulator.
% 1.69/2.07
% 1.69/2.07 ** KEPT: 16 (wt=6) [] -(meet(sk1,converse(sk2)) = zero).
% 1.69/2.07 ---------------- PROOF FOUND ----------------
% 1.69/2.07 % SZS status Unsatisfiable
% 1.69/2.07
% 1.69/2.07
% 1.69/2.07 After processing input:
% 1.69/2.07
% 1.69/2.07 Usable:
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Sos:
% 1.69/2.07 7 (wt=5) [] composition(A,one) = A.
% 1.69/2.07 9 (wt=5) [] converse(converse(A)) = A.
% 1.69/2.07 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.69/2.07 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.69/2.07 15 (wt=6) [] meet(converse(sk1),sk2) = zero.
% 1.69/2.07 16 (wt=6) [] -(meet(sk1,converse(sk2)) = zero).
% 1.69/2.07 1 (wt=7) [] join(A,B) = join(B,A).
% 1.69/2.07 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.69/2.07 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.69/2.07 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.69/2.07 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.69/2.07 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.69/2.07 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.69/2.07 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.69/2.07 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Demodulators:
% 1.69/2.07 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.69/2.07 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.69/2.07 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.69/2.07 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.69/2.07 7 (wt=5) [] composition(A,one) = A.
% 1.69/2.07 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.69/2.07 9 (wt=5) [] converse(converse(A)) = A.
% 1.69/2.07 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.69/2.07 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.69/2.07 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.69/2.07 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.69/2.07 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.69/2.07 15 (wt=6) [] meet(converse(sk1),sk2) = zero.
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 Passive:
% 1.69/2.07 end_of_list.
% 1.69/2.07
% 1.69/2.07 UNIT CONFLICT from 5057 and 16 at 0.53 seconds.
% 1.69/2.07
% 1.69/2.07 ---------------- PROOF ----------------
% 1.69/2.07 % SZS output start Refutation
% See solution above
% 1.69/2.07 ------------ end of proof -------------
% 1.69/2.07
% 1.69/2.07
% 1.69/2.07 ------------- memory usage ------------
% 1.69/2.07 Memory dynamically allocated (tp_alloc): 9765.
% 1.69/2.07 type (bytes each) gets frees in use avail bytes
% 1.69/2.07 sym_ent ( 96) 61 0 61 0 5.7 K
% 1.69/2.07 term ( 16) 790710 665534 125176 42 2425.9 K
% 1.69/2.07 gen_ptr ( 8) 752581 142000 610581 87 4770.8 K
% 1.69/2.07 context ( 808) 980358 980356 2 5 5.5 K
% 1.69/2.07 trail ( 12) 49206 49206 0 7 0.1 K
% 1.69/2.07 bt_node ( 68) 452177 452174 3 29 2.1 K
% 1.69/2.07 ac_position (285432) 0 0 0 0 0.0 K
% 1.69/2.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.69/2.07 ac_match_free_vars_pos (4020)
% 1.69/2.07 0 0 0 0 0.0 K
% 1.69/2.07 discrim ( 12) 98180 14431 83749 0 981.4 K
% 1.69/2.07 flat ( 40) 1646510 1646510 0 83 3.2 K
% 1.69/2.07 discrim_pos ( 12) 43127 43127 0 1 0.0 K
% 1.69/2.07 fpa_head ( 12) 13754 0 13754 0 161.2 K
% 1.69/2.07 fpa_tree ( 28) 22560 22560 0 47 1.3 K
% 1.69/2.07 fpa_pos ( 36) 8065 8065 0 1 0.0 K
% 1.69/2.07 literal ( 12) 32914 27857 5057 1 59.3 K
% 1.69/2.07 clause ( 24) 32914 27857 5057 1 118.5 K
% 1.69/2.07 list ( 12) 3067 3011 56 4 0.7 K
% 1.69/2.07 list_pos ( 20) 20211 4654 15557 0 303.8 K
% 1.69/2.07 pair_index ( 40) 2 0 2 0 0.1 K
% 1.69/2.07
% 1.69/2.07 -------------- statistics -------------
% 1.69/2.07 Clauses input 15
% 1.69/2.07 Usable input 0
% 1.69/2.07 Sos input 15
% 1.69/2.07 Demodulators input 0
% 1.69/2.07 Passive input 0
% 1.69/2.07
% 1.69/2.07 Processed BS (before search) 17
% 1.69/2.07 Forward subsumed BS 1
% 1.69/2.07 Kept BS 16
% 1.69/2.07 New demodulators BS 14
% 1.69/2.07 Back demodulated BS 1
% 1.69/2.07
% 1.69/2.07 Clauses or pairs given 78972
% 1.69/2.07 Clauses generated 22477
% 1.69/2.07 Forward subsumed 17436
% 1.69/2.07 Deleted by weight 0
% 1.69/2.07 Deleted by variable count 0
% 1.69/2.07 Kept 5041
% 1.69/2.07 New demodulators 2994
% 1.69/2.07 Back demodulated 996
% 1.69/2.07 Ordered paramod prunes 0
% 1.69/2.07 Basic paramod prunes 349478
% 1.69/2.07 Prime paramod prunes 1458
% 1.69/2.07 Semantic prunes 0
% 1.69/2.07
% 1.69/2.07 Rewrite attmepts 305972
% 1.69/2.07 Rewrites 37174
% 1.69/2.07
% 1.69/2.07 FPA overloads 0
% 1.69/2.07 FPA underloads 0
% 1.69/2.07
% 1.69/2.07 Usable size 0
% 1.69/2.07 Sos size 4059
% 1.69/2.07 Demodulators size 2383
% 1.69/2.07 Passive size 0
% 1.69/2.07 Disabled size 997
% 1.69/2.07
% 1.69/2.07 Proofs found 1
% 1.69/2.07
% 1.69/2.07 ----------- times (seconds) ----------- Fri Jul 8 09:58:15 2022
% 1.69/2.07
% 1.69/2.07 user CPU time 0.53 (0 hr, 0 min, 0 sec)
% 1.69/2.07 system CPU time 0.48 (0 hr, 0 min, 0 sec)
% 1.69/2.07 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/2.07 input time 0.00
% 1.69/2.07 paramodulation time 0.11
% 1.69/2.07 demodulation time 0.05
% 1.69/2.07 orient time 0.05
% 1.69/2.07 weigh time 0.01
% 1.69/2.07 forward subsume time 0.02
% 1.69/2.07 back demod find time 0.01
% 1.69/2.07 conflict time 0.00
% 1.69/2.07 LRPO time 0.02
% 1.69/2.07 store clause time 0.12
% 1.69/2.07 disable clause time 0.01
% 1.69/2.07 prime paramod time 0.02
% 1.69/2.07 semantics time 0.00
% 1.69/2.07
% 1.69/2.07 EQP interrupted
%------------------------------------------------------------------------------