TSTP Solution File: REL004-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL004-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:10 EDT 2022
% Result : Unsatisfiable 2.10s 2.47s
% Output : Refutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of clauses : 95 ( 95 unt; 0 nHn; 8 RR)
% Number of literals : 95 ( 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 : 127 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL004-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('REL004-1.p',unknown),
[] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL004-1.p',unknown),
[] ).
cnf(10,plain,
equal(converse(join(A,B)),join(converse(A),converse(B))),
file('REL004-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL004-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL004-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(converse(complement(sk1)),complement(converse(sk1))),
file('REL004-1.p',unknown),
[] ).
cnf(18,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(19,plain,
equal(join(complement(A),A),top),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
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(21,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(22,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(24,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(25,plain,
equal(meet(complement(A),A),zero),
inference(para,[status(thm),theory(equality)],[20,14]),
[iquote('para(20,14)')] ).
cnf(28,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(29,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(30,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,29]),9]),
[iquote('para(9,29),demod([9])')] ).
cnf(31,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,7]),1]),
[iquote('para(30,7),flip(1)')] ).
cnf(32,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),31]),
[iquote('back_demod(30),demod([31])')] ).
cnf(37,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(44,plain,
equal(complement(join(zero,complement(A))),meet(top,A)),
inference(para,[status(thm),theory(equality)],[37,4]),
[iquote('para(37,4)')] ).
cnf(46,plain,
equal(complement(join(zero,zero)),meet(top,top)),
inference(para,[status(thm),theory(equality)],[37,44]),
[iquote('para(37,44)')] ).
cnf(61,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),37]),
[iquote('para(13,5),demod([37])')] ).
cnf(62,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(join(A,converse(complement(converse(A)))),converse(top)),
inference(para,[status(thm),theory(equality)],[9,62]),
[iquote('para(9,62)')] ).
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(97,plain,
equal(join(A,join(B,complement(A))),join(B,top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,18]),1]),
[iquote('para(13,18),flip(1)')] ).
cnf(101,plain,
equal(join(complement(A),join(A,B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,2]),1]),
[iquote('para(19,2),flip(1)')] ).
cnf(102,plain,
equal(join(converse(complement(A)),converse(A)),converse(top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,10]),1]),
[iquote('para(19,10),flip(1)')] ).
cnf(103,plain,
equal(join(converse(complement(converse(A))),A),converse(top)),
inference(para,[status(thm),theory(equality)],[9,102]),
[iquote('para(9,102)')] ).
cnf(119,plain,
equal(join(meet(A,meet(B,C)),meet(A,join(complement(B),complement(C)))),A),
inference(para,[status(thm),theory(equality)],[22,5]),
[iquote('para(22,5)')] ).
cnf(134,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[20,61]),
[iquote('para(20,61)')] ).
cnf(135,plain,
equal(join(meet(A,complement(B)),meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,24]),
[iquote('para(4,24)')] ).
cnf(139,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[134,1]),1]),
[iquote('para(134,1),flip(1)')] ).
cnf(141,plain,
equal(join(meet(A,B),complement(join(A,complement(B)))),B),
inference(para,[status(thm),theory(equality)],[20,24]),
[iquote('para(20,24)')] ).
cnf(145,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,28]),139]),1]),
[iquote('para(25,28),demod([139]),flip(1)')] ).
cnf(147,plain,
equal(join(zero,complement(join(A,A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,5]),145]),
[iquote('para(25,5),demod([145])')] ).
cnf(148,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[145,44]),
[iquote('para(145,44)')] ).
cnf(151,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),148]),
[iquote('back_demod(46),demod([148])')] ).
cnf(171,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[145,4]),
[iquote('para(145,4)')] ).
cnf(172,plain,
equal(join(meet(A,B),meet(complement(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[141]),171]),
[iquote('back_demod(141),demod([171])')] ).
cnf(178,plain,
equal(join(meet(A,B),meet(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),171]),
[iquote('back_demod(24),demod([171])')] ).
cnf(179,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)],[21]),171]),
[iquote('back_demod(21),demod([171])')] ).
cnf(196,plain,
equal(join(meet(top,A),meet(zero,A)),A),
inference(para,[status(thm),theory(equality)],[37,172]),
[iquote('para(37,172)')] ).
cnf(200,plain,
equal(join(meet(A,top),meet(zero,A)),A),
inference(para,[status(thm),theory(equality)],[37,178]),
[iquote('para(37,178)')] ).
cnf(209,plain,
equal(complement(zero),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,196]),151,67]),1]),
[iquote('para(14,196),demod([151,67]),flip(1)')] ).
cnf(210,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,12]),32,32]),
[iquote('para(31,12),demod([32,32])')] ).
cnf(224,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,210]),145,145]),
[iquote('para(145,210),demod([145,145])')] ).
cnf(225,plain,
equal(join(zero,complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[147]),224]),
[iquote('back_demod(147),demod([224])')] ).
cnf(234,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,225]),145]),
[iquote('para(145,225),demod([145])')] ).
cnf(240,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),234]),
[iquote('back_demod(66),demod([234])')] ).
cnf(241,plain,
equal(join(A,zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),240]),
[iquote('back_demod(67),demod([240])')] ).
cnf(285,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[209,171]),
[iquote('para(209,171)')] ).
cnf(287,plain,
equal(join(meet(zero,A),meet(top,A)),A),
inference(para,[status(thm),theory(equality)],[209,172]),
[iquote('para(209,172)')] ).
cnf(315,plain,
equal(join(A,join(top,meet(complement(A),zero))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[285,13]),2]),
[iquote('para(285,13),demod([2])')] ).
cnf(330,plain,
equal(complement(join(A,B)),meet(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[145,171]),
[iquote('para(145,171)')] ).
cnf(357,plain,
equal(join(top,A),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[224,101]),19]),1]),
[iquote('para(224,101),demod([19]),flip(1)')] ).
cnf(359,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[315]),357]),
[iquote('back_demod(315),demod([357])')] ).
cnf(363,plain,
equal(join(A,join(B,complement(A))),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[97]),359]),
[iquote('back_demod(97),demod([359])')] ).
cnf(375,plain,
equal(converse(top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[357,65]),1]),
[iquote('para(357,65),flip(1)')] ).
cnf(378,plain,
equal(join(converse(complement(converse(A))),A),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[103]),375]),
[iquote('back_demod(103),demod([375])')] ).
cnf(381,plain,
equal(join(A,converse(complement(converse(A)))),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[65]),375]),
[iquote('back_demod(65),demod([375])')] ).
cnf(511,plain,
equal(meet(zero,complement(A)),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[357,330]),37,37]),1]),
[iquote('para(357,330),demod([37,37]),flip(1)')] ).
cnf(631,plain,
equal(meet(zero,A),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[511,28]),234]),
[iquote('para(511,28),demod([234])')] ).
cnf(632,plain,
equal(meet(top,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[287]),631,234]),
[iquote('back_demod(287),demod([631,234])')] ).
cnf(635,plain,
equal(meet(A,top),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[200]),631,241]),
[iquote('back_demod(200),demod([631,241])')] ).
cnf(1042,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)],[25,119]),179,240,234]),1]),
[iquote('para(25,119),demod([179,240,234]),flip(1)')] ).
cnf(1122,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)],[363,330]),37,330,145]),1]),
[iquote('para(363,330),demod([37,330,145]),flip(1)')] ).
cnf(1123,plain,
equal(meet(complement(A),meet(B,A)),zero),
inference(para,[status(thm),theory(equality)],[145,1122]),
[iquote('para(145,1122)')] ).
cnf(1260,plain,
equal(meet(complement(A),join(complement(B),complement(A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1123,28]),1042,241]),
[iquote('para(1123,28),demod([1042,241])')] ).
cnf(1261,plain,
equal(meet(A,join(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,1260]),145,145]),
[iquote('para(145,1260),demod([145,145])')] ).
cnf(1263,plain,
equal(meet(A,join(B,A)),A),
inference(para,[status(thm),theory(equality)],[145,1261]),
[iquote('para(145,1261)')] ).
cnf(1271,plain,
equal(meet(A,join(A,B)),A),
inference(para,[status(thm),theory(equality)],[1,1263]),
[iquote('para(1,1263)')] ).
cnf(4577,plain,
equal(meet(join(complement(A),B),join(complement(B),complement(A))),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[135,330]),1042,145,1042]),1]),
[iquote('para(135,330),demod([1042,145,1042]),flip(1)')] ).
cnf(4696,plain,
equal(meet(join(A,B),join(complement(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,4577]),145,145]),
[iquote('para(145,4577),demod([145,145])')] ).
cnf(4756,plain,
equal(join(complement(A),converse(complement(converse(A)))),converse(complement(converse(A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[378,4696]),632]),
[iquote('para(378,4696),demod([632])')] ).
cnf(4757,plain,
equal(join(complement(converse(A)),converse(complement(A))),converse(complement(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,4756]),9]),
[iquote('para(9,4756),demod([9])')] ).
cnf(4758,plain,
equal(join(complement(converse(complement(A))),converse(A)),converse(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,4757]),145]),
[iquote('para(145,4757),demod([145])')] ).
cnf(4761,plain,
equal(join(complement(converse(complement(converse(A)))),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,4758]),9]),
[iquote('para(9,4758),demod([9])')] ).
cnf(4789,plain,
equal(join(converse(complement(converse(complement(A)))),A),converse(complement(converse(complement(A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[381,4696]),635]),
[iquote('para(381,4696),demod([635])')] ).
cnf(4854,plain,
equal(meet(complement(converse(A)),converse(complement(A))),complement(converse(A))),
inference(para,[status(thm),theory(equality)],[4757,1271]),
[iquote('para(4757,1271)')] ).
cnf(4857,plain,
equal(meet(converse(complement(A)),complement(converse(A))),complement(converse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4854,20]),1]),
[iquote('para(4854,20),flip(1)')] ).
cnf(5638,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)],[4761,10]),4789]),1]),
[iquote('para(4761,10),demod([4789]),flip(1)')] ).
cnf(5640,plain,
equal(converse(complement(converse(complement(A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,5638]),9]),
[iquote('para(9,5638),demod([9])')] ).
cnf(5641,plain,
equal(complement(converse(complement(A))),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5640,9]),1]),
[iquote('para(5640,9),flip(1)')] ).
cnf(5656,plain,
equal(meet(converse(complement(A)),converse(A)),zero),
inference(para,[status(thm),theory(equality)],[5641,14]),
[iquote('para(5641,14)')] ).
cnf(6878,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)],[5656,28]),4857,241]),1]),
[iquote('para(5656,28),demod([4857,241]),flip(1)')] ).
cnf(6879,plain,
$false,
inference(conflict,[status(thm)],[6878,15]),
[iquote('conflict(6878,15)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL004-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n020.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 11:51:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.10/2.47 ----- EQP 0.9e, May 2009 -----
% 2.10/2.47 The job began on n020.cluster.edu, Fri Jul 8 11:51:29 2022
% 2.10/2.47 The command was "./eqp09e".
% 2.10/2.47
% 2.10/2.47 set(prolog_style_variables).
% 2.10/2.47 set(lrpo).
% 2.10/2.47 set(basic_paramod).
% 2.10/2.47 set(functional_subsume).
% 2.10/2.47 set(ordered_paramod).
% 2.10/2.47 set(prime_paramod).
% 2.10/2.47 set(para_pairs).
% 2.10/2.47 assign(pick_given_ratio,4).
% 2.10/2.47 clear(print_kept).
% 2.10/2.47 clear(print_new_demod).
% 2.10/2.47 clear(print_back_demod).
% 2.10/2.47 clear(print_given).
% 2.10/2.47 assign(max_mem,64000).
% 2.10/2.47 end_of_commands.
% 2.10/2.47
% 2.10/2.47 Usable:
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Sos:
% 2.10/2.47 0 (wt=-1) [] join(A,B) = join(B,A).
% 2.10/2.47 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 2.10/2.47 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 2.10/2.47 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 2.10/2.47 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 2.10/2.47 0 (wt=-1) [] composition(A,one) = A.
% 2.10/2.47 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 2.10/2.47 0 (wt=-1) [] converse(converse(A)) = A.
% 2.10/2.47 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.10/2.47 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.10/2.47 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.10/2.47 0 (wt=-1) [] top = join(A,complement(A)).
% 2.10/2.47 0 (wt=-1) [] zero = meet(A,complement(A)).
% 2.10/2.47 0 (wt=-1) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Demodulators:
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Passive:
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Starting to process input.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 2.10/2.47 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 2.10/2.47
% 2.10/2.47 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 2.10/2.47 2 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 2.10/2.47 3 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 2.10/2.47 4 is a new demodulator.
% 2.10/2.47 -> 4 back demodulating 3.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 2.10/2.47 5 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 2.10/2.47 6 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 2.10/2.47 7 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 2.10/2.47 8 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 2.10/2.47 9 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.10/2.47 10 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.10/2.47 11 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.10/2.47 12 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 2.10/2.47 13 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 2.10/2.47 14 is a new demodulator.
% 2.10/2.47
% 2.10/2.47 ** KEPT: 15 (wt=7) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 2.10/2.47 ---------------- PROOF FOUND ----------------
% 2.10/2.47 % SZS status Unsatisfiable
% 2.10/2.47
% 2.10/2.47
% 2.10/2.47 After processing input:
% 2.10/2.47
% 2.10/2.47 Usable:
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Sos:
% 2.10/2.47 7 (wt=5) [] composition(A,one) = A.
% 2.10/2.47 9 (wt=5) [] converse(converse(A)) = A.
% 2.10/2.47 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 2.10/2.47 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 2.10/2.47 1 (wt=7) [] join(A,B) = join(B,A).
% 2.10/2.47 15 (wt=7) [] -(converse(complement(sk1)) = complement(converse(sk1))).
% 2.10/2.47 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 2.10/2.47 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.10/2.47 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.10/2.47 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 2.10/2.47 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 2.10/2.47 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 2.10/2.47 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 2.10/2.47 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Demodulators:
% 2.10/2.47 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 2.10/2.47 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 2.10/2.47 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 2.10/2.47 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 2.10/2.47 7 (wt=5) [] composition(A,one) = A.
% 2.10/2.47 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 2.10/2.47 9 (wt=5) [] converse(converse(A)) = A.
% 2.10/2.47 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 2.10/2.47 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 2.10/2.47 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 2.10/2.47 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 2.10/2.47 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 Passive:
% 2.10/2.47 end_of_list.
% 2.10/2.47
% 2.10/2.47 UNIT CONFLICT from 6878 and 15 at 0.82 seconds.
% 2.10/2.47
% 2.10/2.47 ---------------- PROOF ----------------
% 2.10/2.47 % SZS output start Refutation
% See solution above
% 2.10/2.47 ------------ end of proof -------------
% 2.10/2.47
% 2.10/2.47
% 2.10/2.47 ------------- memory usage ------------
% 2.10/2.47 Memory dynamically allocated (tp_alloc): 13671.
% 2.10/2.47 type (bytes each) gets frees in use avail bytes
% 2.10/2.47 sym_ent ( 96) 60 0 60 0 5.6 K
% 2.10/2.47 term ( 16) 1022295 840271 182024 51 3529.3 K
% 2.10/2.47 gen_ptr ( 8) 1129358 207403 921955 94 7203.5 K
% 2.10/2.47 context ( 808) 1178461 1178459 2 5 5.5 K
% 2.10/2.47 trail ( 12) 76469 76469 0 8 0.1 K
% 2.10/2.47 bt_node ( 68) 514764 514761 3 29 2.1 K
% 2.10/2.47 ac_position (285432) 0 0 0 0 0.0 K
% 2.10/2.47 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.10/2.47 ac_match_free_vars_pos (4020)
% 2.10/2.47 0 0 0 0 0.0 K
% 2.10/2.47 discrim ( 12) 143243 34858 108385 0 1270.1 K
% 2.10/2.47 flat ( 40) 2225415 2225415 0 93 3.6 K
% 2.10/2.47 discrim_pos ( 12) 56775 56775 0 1 0.0 K
% 2.10/2.47 fpa_head ( 12) 17826 0 17826 0 208.9 K
% 2.10/2.47 fpa_tree ( 28) 32419 32419 0 55 1.5 K
% 2.10/2.47 fpa_pos ( 36) 10854 10854 0 1 0.0 K
% 2.10/2.47 literal ( 12) 43207 36329 6878 1 80.6 K
% 2.10/2.47 clause ( 24) 43207 36329 6878 1 161.2 K
% 2.10/2.47 list ( 12) 4035 3979 56 5 0.7 K
% 2.10/2.47 list_pos ( 20) 27689 7149 20540 0 401.2 K
% 2.10/2.47 pair_index ( 40) 2 0 2 0 0.1 K
% 2.10/2.47
% 2.10/2.47 -------------- statistics -------------
% 2.10/2.47 Clauses input 14
% 2.10/2.47 Usable input 0
% 2.10/2.47 Sos input 14
% 2.10/2.47 Demodulators input 0
% 2.10/2.47 Passive input 0
% 2.10/2.47
% 2.10/2.47 Processed BS (before search) 16
% 2.10/2.47 Forward subsumed BS 1
% 2.10/2.47 Kept BS 15
% 2.10/2.47 New demodulators BS 13
% 2.10/2.47 Back demodulated BS 1
% 2.10/2.47
% 2.10/2.47 Clauses or pairs given 84998
% 2.10/2.47 Clauses generated 29031
% 2.10/2.47 Forward subsumed 22168
% 2.10/2.47 Deleted by weight 0
% 2.10/2.47 Deleted by variable count 0
% 2.10/2.47 Kept 6863
% 2.10/2.47 New demodulators 3963
% 2.10/2.47 Back demodulated 1515
% 2.10/2.47 Ordered paramod prunes 0
% 2.10/2.47 Basic paramod prunes 317399
% 2.10/2.47 Prime paramod prunes 2201
% 2.10/2.47 Semantic prunes 0
% 2.10/2.47
% 2.10/2.47 Rewrite attmepts 396749
% 2.10/2.47 Rewrites 48374
% 2.10/2.47
% 2.10/2.47 FPA overloads 0
% 2.10/2.47 FPA underloads 0
% 2.10/2.47
% 2.10/2.47 Usable size 0
% 2.10/2.47 Sos size 5361
% 2.10/2.47 Demodulators size 2941
% 2.10/2.47 Passive size 0
% 2.10/2.47 Disabled size 1516
% 2.10/2.47
% 2.10/2.47 Proofs found 1
% 2.10/2.47
% 2.10/2.47 ----------- times (seconds) ----------- Fri Jul 8 11:51:30 2022
% 2.10/2.47
% 2.10/2.47 user CPU time 0.82 (0 hr, 0 min, 0 sec)
% 2.10/2.47 system CPU time 0.55 (0 hr, 0 min, 0 sec)
% 2.10/2.47 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.10/2.47 input time 0.00
% 2.10/2.47 paramodulation time 0.15
% 2.10/2.47 demodulation time 0.09
% 2.10/2.47 orient time 0.05
% 2.10/2.47 weigh time 0.01
% 2.10/2.47 forward subsume time 0.03
% 2.10/2.47 back demod find time 0.04
% 2.10/2.47 conflict time 0.01
% 2.10/2.47 LRPO time 0.03
% 2.10/2.47 store clause time 0.26
% 2.10/2.47 disable clause time 0.04
% 2.10/2.47 prime paramod time 0.03
% 2.10/2.47 semantics time 0.00
% 2.10/2.47
% 2.10/2.47 EQP interrupted
%------------------------------------------------------------------------------