TSTP Solution File: REL004-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL004-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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:11 EDT 2022
% Result : Unsatisfiable 2.14s 2.50s
% Output : Refutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of clauses : 96 ( 96 unt; 0 nHn; 10 RR)
% Number of literals : 96 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 125 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL004-2.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('REL004-2.p',unknown),
[] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL004-2.p',unknown),
[] ).
cnf(10,plain,
equal(converse(join(A,B)),join(converse(A),converse(B))),
file('REL004-2.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL004-2.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL004-2.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(18,plain,
~ equal(converse(complement(sk1)),complement(converse(sk1))),
file('REL004-2.p',unknown),
[] ).
cnf(21,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(22,plain,
equal(join(complement(A),A),top),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
cnf(23,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(24,plain,
equal(complement(join(meet(A,B),complement(C))),meet(join(complement(A),complement(B)),C)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(25,plain,
equal(complement(join(complement(A),meet(B,C))),meet(A,join(complement(B),complement(C)))),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(27,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(28,plain,
equal(meet(complement(A),A),zero),
inference(para,[status(thm),theory(equality)],[23,14]),
[iquote('para(23,14)')] ).
cnf(31,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(32,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(33,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,32]),9]),
[iquote('para(9,32),demod([9])')] ).
cnf(34,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,7]),1]),
[iquote('para(33,7),flip(1)')] ).
cnf(35,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[33]),34]),
[iquote('back_demod(33),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(41,plain,
equal(join(top,zero),top),
inference(para,[status(thm),theory(equality)],[40,13]),
[iquote('para(40,13)')] ).
cnf(47,plain,
equal(complement(join(zero,complement(A))),meet(top,A)),
inference(para,[status(thm),theory(equality)],[40,4]),
[iquote('para(40,4)')] ).
cnf(49,plain,
equal(complement(join(zero,zero)),meet(top,top)),
inference(para,[status(thm),theory(equality)],[40,47]),
[iquote('para(40,47)')] ).
cnf(62,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(64,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(69,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(70,plain,
equal(join(meet(A,A),zero),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[69,1]),1]),
[iquote('para(69,1),flip(1)')] ).
cnf(143,plain,
equal(join(A,join(B,complement(A))),join(B,top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,21]),1]),
[iquote('para(13,21),flip(1)')] ).
cnf(154,plain,
equal(join(converse(complement(A)),converse(A)),converse(top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,10]),1]),
[iquote('para(22,10),flip(1)')] ).
cnf(155,plain,
equal(join(converse(complement(converse(A))),A),converse(top)),
inference(para,[status(thm),theory(equality)],[9,154]),
[iquote('para(9,154)')] ).
cnf(159,plain,
equal(join(meet(A,B),complement(join(complement(B),A))),B),
inference(para,[status(thm),theory(equality)],[23,5]),
[iquote('para(23,5)')] ).
cnf(199,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[23,64]),
[iquote('para(23,64)')] ).
cnf(203,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[199,1]),1]),
[iquote('para(199,1),flip(1)')] ).
cnf(205,plain,
equal(join(meet(A,meet(B,C)),meet(A,join(complement(B),complement(C)))),A),
inference(para,[status(thm),theory(equality)],[25,5]),
[iquote('para(25,5)')] ).
cnf(206,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,31]),203]),1]),
[iquote('para(28,31),demod([203]),flip(1)')] ).
cnf(209,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[206,47]),
[iquote('para(206,47)')] ).
cnf(212,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[49]),209]),
[iquote('back_demod(49),demod([209])')] ).
cnf(217,plain,
equal(meet(complement(zero),top),meet(top,top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[212,23]),1]),
[iquote('para(212,23),flip(1)')] ).
cnf(225,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[206,4]),
[iquote('para(206,4)')] ).
cnf(226,plain,
equal(join(meet(A,B),meet(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[27]),225]),
[iquote('back_demod(27),demod([225])')] ).
cnf(227,plain,
equal(meet(complement(meet(A,B)),C),meet(join(complement(A),complement(B)),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),225]),
[iquote('back_demod(24),demod([225])')] ).
cnf(228,plain,
equal(complement(join(complement(A),B)),meet(A,complement(B))),
inference(para,[status(thm),theory(equality)],[206,4]),
[iquote('para(206,4)')] ).
cnf(231,plain,
equal(join(meet(A,B),meet(B,complement(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[159]),228]),
[iquote('back_demod(159),demod([228])')] ).
cnf(238,plain,
equal(join(meet(A,top),meet(zero,A)),A),
inference(para,[status(thm),theory(equality)],[40,226]),
[iquote('para(40,226)')] ).
cnf(241,plain,
equal(join(meet(top,A),meet(A,zero)),A),
inference(para,[status(thm),theory(equality)],[40,231]),
[iquote('para(40,231)')] ).
cnf(246,plain,
equal(complement(zero),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,238]),217,70]),1]),
[iquote('para(14,238),demod([217,70]),flip(1)')] ).
cnf(254,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[246,225]),
[iquote('para(246,225)')] ).
cnf(258,plain,
equal(join(meet(A,zero),meet(top,A)),A),
inference(para,[status(thm),theory(equality)],[246,226]),
[iquote('para(246,226)')] ).
cnf(259,plain,
equal(complement(join(top,A)),meet(zero,complement(A))),
inference(para,[status(thm),theory(equality)],[246,228]),
[iquote('para(246,228)')] ).
cnf(264,plain,
equal(join(A,join(top,meet(complement(A),zero))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[254,13]),2]),
[iquote('para(254,13),demod([2])')] ).
cnf(265,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(280,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[206,265]),206,206]),
[iquote('para(206,265),demod([206,206])')] ).
cnf(304,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)],[280,62]),13]),1]),
[iquote('para(280,62),demod([13]),flip(1)')] ).
cnf(315,plain,
equal(meet(zero,A),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[304,259]),40,206]),1]),
[iquote('para(304,259),demod([40,206]),flip(1)')] ).
cnf(320,plain,
equal(join(meet(A,top),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[238]),315]),
[iquote('back_demod(238),demod([315])')] ).
cnf(326,plain,
equal(meet(A,zero),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[315,23]),1]),
[iquote('para(315,23),flip(1)')] ).
cnf(327,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[264]),326,41]),
[iquote('back_demod(264),demod([326,41])')] ).
cnf(330,plain,
equal(join(A,join(B,complement(A))),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[143]),327]),
[iquote('back_demod(143),demod([327])')] ).
cnf(332,plain,
equal(join(zero,meet(top,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[258]),326]),
[iquote('back_demod(258),demod([326])')] ).
cnf(333,plain,
equal(join(meet(top,A),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[241]),326]),
[iquote('back_demod(241),demod([326])')] ).
cnf(349,plain,
equal(converse(top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[327,155]),1]),
[iquote('para(327,155),flip(1)')] ).
cnf(351,plain,
equal(join(converse(complement(converse(A))),A),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[155]),349]),
[iquote('back_demod(155),demod([349])')] ).
cnf(403,plain,
equal(complement(join(A,B)),meet(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[206,225]),
[iquote('para(206,225)')] ).
cnf(419,plain,
equal(meet(complement(A),complement(A)),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[280,403]),1]),
[iquote('para(280,403),flip(1)')] ).
cnf(421,plain,
equal(join(zero,complement(A)),complement(A)),
inference(para,[status(thm),theory(equality)],[419,69]),
[iquote('para(419,69)')] ).
cnf(423,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[206,421]),206]),
[iquote('para(206,421),demod([206])')] ).
cnf(424,plain,
equal(meet(top,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[332]),423]),
[iquote('back_demod(332),demod([423])')] ).
cnf(425,plain,
equal(join(A,zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[333]),424]),
[iquote('back_demod(333),demod([424])')] ).
cnf(428,plain,
equal(meet(A,top),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[320]),425]),
[iquote('back_demod(320),demod([425])')] ).
cnf(429,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),425]),
[iquote('back_demod(70),demod([425])')] ).
cnf(1405,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)],[330,403]),40,403,206]),1]),
[iquote('para(330,403),demod([40,403,206]),flip(1)')] ).
cnf(1408,plain,
equal(meet(complement(A),meet(B,A)),zero),
inference(para,[status(thm),theory(equality)],[206,1405]),
[iquote('para(206,1405)')] ).
cnf(1894,plain,
equal(complement(meet(A,B)),join(complement(A),complement(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,205]),227,429,423]),1]),
[iquote('para(28,205),demod([227,429,423]),flip(1)')] ).
cnf(1909,plain,
equal(meet(complement(A),join(complement(B),complement(A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1408,31]),1894,425]),
[iquote('para(1408,31),demod([1894,425])')] ).
cnf(1914,plain,
equal(meet(A,join(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[206,1909]),206,206]),
[iquote('para(206,1909),demod([206,206])')] ).
cnf(1916,plain,
equal(meet(A,join(B,A)),A),
inference(para,[status(thm),theory(equality)],[206,1914]),
[iquote('para(206,1914)')] ).
cnf(5955,plain,
equal(meet(join(complement(A),complement(B)),join(B,complement(A))),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[226,403]),1894,1894,206]),1]),
[iquote('para(226,403),demod([1894,1894,206]),flip(1)')] ).
cnf(5960,plain,
equal(meet(join(A,complement(B)),join(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[206,5955]),206,206]),
[iquote('para(206,5955),demod([206,206])')] ).
cnf(6085,plain,
equal(join(A,converse(complement(converse(complement(A))))),converse(complement(converse(complement(A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[351,5960]),424]),
[iquote('para(351,5960),demod([424])')] ).
cnf(6086,plain,
equal(join(A,complement(converse(complement(converse(A))))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[351,5960]),428]),
[iquote('para(351,5960),demod([428])')] ).
cnf(6087,plain,
equal(join(converse(A),complement(converse(complement(A)))),converse(A)),
inference(para,[status(thm),theory(equality)],[9,6086]),
[iquote('para(9,6086)')] ).
cnf(6088,plain,
equal(join(converse(complement(A)),complement(converse(A))),converse(complement(A))),
inference(para,[status(thm),theory(equality)],[206,6087]),
[iquote('para(206,6087)')] ).
cnf(6175,plain,
equal(meet(complement(converse(A)),converse(complement(A))),complement(converse(A))),
inference(para,[status(thm),theory(equality)],[6088,1916]),
[iquote('para(6088,1916)')] ).
cnf(6182,plain,
equal(meet(converse(complement(A)),complement(converse(A))),complement(converse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6175,23]),1]),
[iquote('para(6175,23),flip(1)')] ).
cnf(6567,plain,
equal(converse(complement(converse(complement(converse(A))))),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6086,10]),6085]),1]),
[iquote('para(6086,10),demod([6085]),flip(1)')] ).
cnf(6570,plain,
equal(converse(complement(converse(complement(A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,6567]),9]),
[iquote('para(9,6567),demod([9])')] ).
cnf(6573,plain,
equal(complement(converse(complement(A))),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6570,9]),1]),
[iquote('para(6570,9),flip(1)')] ).
cnf(6588,plain,
equal(meet(converse(complement(A)),converse(A)),zero),
inference(para,[status(thm),theory(equality)],[6573,14]),
[iquote('para(6573,14)')] ).
cnf(6939,plain,
equal(converse(complement(A)),complement(converse(A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6588,31]),6182,425]),1]),
[iquote('para(6588,31),demod([6182,425]),flip(1)')] ).
cnf(6940,plain,
$false,
inference(conflict,[status(thm)],[6939,18]),
[iquote('conflict(6939,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL004-2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 09:10:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.05 ----- EQP 0.9e, May 2009 -----
% 0.42/1.05 The job began on n016.cluster.edu, Fri Jul 8 09:10:53 2022
% 0.42/1.05 The command was "./eqp09e".
% 0.42/1.05
% 0.42/1.05 set(prolog_style_variables).
% 0.42/1.05 set(lrpo).
% 0.42/1.05 set(basic_paramod).
% 0.42/1.05 set(functional_subsume).
% 0.42/1.05 set(ordered_paramod).
% 0.42/1.05 set(prime_paramod).
% 0.42/1.05 set(para_pairs).
% 0.42/1.05 assign(pick_given_ratio,4).
% 0.42/1.05 clear(print_kept).
% 0.42/1.05 clear(print_new_demod).
% 0.42/1.05 clear(print_back_demod).
% 0.42/1.05 clear(print_given).
% 0.42/1.05 assign(max_mem,64000).
% 0.42/1.05 end_of_commands.
% 0.42/1.05
% 0.42/1.05 Usable:
% 0.42/1.05 end_of_list.
% 0.42/1.05
% 0.42/1.05 Sos:
% 0.42/1.05 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.42/1.05 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.42/1.05 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.42/1.05 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.42/1.05 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.42/1.05 0 (wt=-1) [] composition(A,one) = A.
% 0.42/1.05 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.42/1.05 0 (wt=-1) [] converse(converse(A)) = A.
% 0.42/1.05 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.42/1.05 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.42/1.05 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.42/1.05 0 (wt=-1) [] top = join(A,complement(A)).
% 0.42/1.05 0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.42/1.05 0 (wt=-1) [] 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))).
% 0.42/1.05 0 (wt=-1) [] 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).
% 0.42/1.05 0 (wt=-1) [] 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).
% 0.42/1.05 0 (wt=-1) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 0.42/1.05 end_of_list.
% 0.42/1.05
% 0.42/1.05 Demodulators:
% 0.42/1.05 end_of_list.
% 0.42/1.05
% 0.42/1.05 Passive:
% 0.42/1.05 end_of_list.
% 0.42/1.05
% 0.42/1.05 Starting to process input.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.42/1.05 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.42/1.05
% 0.42/1.05 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.42/1.05 2 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.42/1.05 3 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.42/1.05 4 is a new demodulator.
% 0.42/1.05 -> 4 back demodulating 3.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.42/1.05 5 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.42/1.05 6 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.42/1.05 7 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.42/1.05 8 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.42/1.05 9 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.42/1.05 10 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.42/1.05 11 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.42/1.05 12 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.42/1.05 13 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.42/1.05 14 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 15 (wt=33) [] 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))).
% 0.42/1.05 15 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 16 (wt=27) [] 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).
% 0.42/1.05 16 is a new demodulator.
% 0.42/1.05
% 0.42/1.05 ** KEPT: 17 (wt=27) [] 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).
% 2.14/2.50 17 is a new demodulator.
% 2.14/2.50
% 2.14/2.50 ** KEPT: 18 (wt=7) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 2.14/2.50 ---------------- PROOF FOUND ----------------
% 2.14/2.50 % SZS status Unsatisfiable
% 2.14/2.50
% 2.14/2.50
% 2.14/2.50 After processing input:
% 2.14/2.50
% 2.14/2.50 Usable:
% 2.14/2.50 end_of_list.
% 2.14/2.50
% 2.14/2.50 Sos:
% 2.14/2.50 7 (wt=5) [] composition(A,one) = A.
% 2.14/2.50 9 (wt=5) [] converse(converse(A)) = A.
% 2.14/2.50 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 2.14/2.50 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 2.14/2.50 1 (wt=7) [] join(A,B) = join(B,A).
% 2.14/2.50 18 (wt=7) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 2.14/2.50 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 2.14/2.50 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.14/2.50 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.14/2.50 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 2.14/2.50 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 2.14/2.50 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 2.14/2.50 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 2.14/2.50 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.14/2.50 16 (wt=27) [] 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).
% 2.14/2.50 17 (wt=27) [] 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).
% 2.14/2.50 15 (wt=33) [] 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))).
% 2.14/2.50 end_of_list.
% 2.14/2.50
% 2.14/2.50 Demodulators:
% 2.14/2.50 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 2.14/2.50 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 2.14/2.50 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 2.14/2.50 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 2.14/2.50 7 (wt=5) [] composition(A,one) = A.
% 2.14/2.50 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 2.14/2.50 9 (wt=5) [] converse(converse(A)) = A.
% 2.14/2.50 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.14/2.50 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.14/2.50 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.14/2.50 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 2.14/2.50 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 2.14/2.50 15 (wt=33) [] 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))).
% 2.14/2.50 16 (wt=27) [] 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).
% 2.14/2.50 17 (wt=27) [] 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).
% 2.14/2.50 end_of_list.
% 2.14/2.50
% 2.14/2.50 Passive:
% 2.14/2.50 end_of_list.
% 2.14/2.50
% 2.14/2.50 UNIT CONFLICT from 6939 and 18 at 0.87 seconds.
% 2.14/2.50
% 2.14/2.50 ---------------- PROOF ----------------
% 2.14/2.50 % SZS output start Refutation
% See solution above
% 2.14/2.50 ------------ end of proof -------------
% 2.14/2.50
% 2.14/2.50
% 2.14/2.50 ------------- memory usage ------------
% 2.14/2.50 Memory dynamically allocated (tp_alloc): 15625.
% 2.14/2.50 type (bytes each) gets frees in use avail bytes
% 2.14/2.50 sym_ent ( 96) 60 0 60 0 5.6 K
% 2.14/2.50 term ( 16) 1092538 892698 199840 61 3877.2 K
% 2.14/2.50 gen_ptr ( 8) 1253209 224525 1028684 95 8037.3 K
% 2.14/2.50 context ( 808) 1338616 1338614 2 5 5.5 K
% 2.14/2.50 trail ( 12) 57775 57775 0 7 0.1 K
% 2.14/2.50 bt_node ( 68) 587633 587630 3 33 2.4 K
% 2.14/2.50 ac_position (285432) 0 0 0 0 0.0 K
% 2.14/2.50 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.14/2.50 ac_match_free_vars_pos (4020)
% 2.14/2.50 0 0 0 0 0.0 K
% 2.14/2.50 discrim ( 12) 176827 43922 132905 0 1557.5 K
% 2.14/2.50 flat ( 40) 2292863 2292863 0 112 4.4 K
% 2.14/2.50 discrim_pos ( 12) 60426 60426 0 1 0.0 K
% 2.14/2.50 fpa_head ( 12) 28494 0 28494 0 333.9 K
% 2.14/2.50 fpa_tree ( 28) 37850 37850 0 55 1.5 K
% 2.14/2.50 fpa_pos ( 36) 11494 11494 0 1 0.0 K
% 2.14/2.50 literal ( 12) 41809 34870 6939 1 81.3 K
% 2.14/2.50 clause ( 24) 41809 34870 6939 1 162.7 K
% 2.14/2.50 list ( 12) 4614 4558 56 4 0.7 K
% 2.14/2.50 list_pos ( 20) 28667 7733 20934 0 408.9 K
% 2.14/2.50 pair_index ( 40) 2 0 2 0 0.1 K
% 2.14/2.50
% 2.14/2.50 -------------- statistics -------------
% 2.14/2.50 Clauses input 17
% 2.14/2.50 Usable input 0
% 2.14/2.50 Sos input 17
% 2.14/2.50 Demodulators input 0
% 2.14/2.50 Passive input 0
% 2.14/2.50
% 2.14/2.50 Processed BS (before search) 19
% 2.14/2.50 Forward subsumed BS 1
% 2.14/2.50 Kept BS 18
% 2.14/2.50 New demodulators BS 16
% 2.14/2.50 Back demodulated BS 1
% 2.14/2.50
% 2.14/2.50 Clauses or pairs given 93854
% 2.14/2.50 Clauses generated 29069
% 2.14/2.50 Forward subsumed 22148
% 2.14/2.50 Deleted by weight 0
% 2.14/2.50 Deleted by variable count 0
% 2.14/2.50 Kept 6921
% 2.14/2.50 New demodulators 4539
% 2.14/2.50 Back demodulated 1623
% 2.14/2.50 Ordered paramod prunes 0
% 2.14/2.50 Basic paramod prunes 362953
% 2.14/2.50 Prime paramod prunes 2346
% 2.14/2.50 Semantic prunes 0
% 2.14/2.50
% 2.14/2.50 Rewrite attmepts 432696
% 2.14/2.50 Rewrites 53295
% 2.14/2.50
% 2.14/2.50 FPA overloads 0
% 2.14/2.50 FPA underloads 0
% 2.14/2.50
% 2.14/2.50 Usable size 0
% 2.14/2.50 Sos size 5314
% 2.14/2.50 Demodulators size 3368
% 2.14/2.50 Passive size 0
% 2.14/2.50 Disabled size 1624
% 2.14/2.50
% 2.14/2.50 Proofs found 1
% 2.14/2.50
% 2.14/2.50 ----------- times (seconds) ----------- Fri Jul 8 09:10:55 2022
% 2.14/2.50
% 2.14/2.50 user CPU time 0.87 (0 hr, 0 min, 0 sec)
% 2.14/2.50 system CPU time 0.58 (0 hr, 0 min, 0 sec)
% 2.14/2.50 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.14/2.50 input time 0.00
% 2.14/2.50 paramodulation time 0.15
% 2.14/2.50 demodulation time 0.09
% 2.14/2.50 orient time 0.05
% 2.14/2.50 weigh time 0.01
% 2.14/2.50 forward subsume time 0.04
% 2.14/2.50 back demod find time 0.02
% 2.14/2.50 conflict time 0.01
% 2.14/2.50 LRPO time 0.02
% 2.14/2.50 store clause time 0.26
% 2.14/2.50 disable clause time 0.06
% 2.14/2.50 prime paramod time 0.03
% 2.14/2.50 semantics time 0.00
% 2.14/2.50
% 2.14/2.50 EQP interrupted
%------------------------------------------------------------------------------