TSTP Solution File: BOO024-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO024-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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 : Thu Jul 14 23:37:09 EDT 2022
% Result : Unsatisfiable 0.71s 1.27s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 5
% Syntax : Number of clauses : 122 ( 122 unt; 0 nHn; 15 RR)
% Number of literals : 122 ( 0 equ; 2 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 217 ( 79 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(add(A,B),B),B),
file('BOO024-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,add(B,C)),add(multiply(B,A),multiply(C,A))),
file('BOO024-1.p',unknown),
[] ).
cnf(3,plain,
equal(add(multiply(A,B),multiply(C,B)),multiply(B,add(A,C))),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(add(A,inverse(A)),n1),
file('BOO024-1.p',unknown),
[] ).
cnf(5,plain,
equal(add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))),pixley(A,B,C)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(pixley(A,A,B),B),
file('BOO024-1.p',unknown),
[] ).
cnf(9,plain,
~ equal(add(multiply(a,b),b),b),
file('BOO024-1.p',unknown),
[] ).
cnf(10,plain,
equal(add(multiply(A,add(B,add(A,C))),multiply(C,add(B,add(A,C)))),add(A,C)),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(11,plain,
equal(multiply(n1,inverse(A)),inverse(A)),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(multiply(multiply(A,add(B,C)),multiply(C,A)),multiply(C,A)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(13,plain,
equal(add(A,multiply(B,A)),multiply(A,add(add(C,A),B))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(14,plain,
equal(multiply(A,add(add(B,A),C)),add(A,multiply(C,A))),
inference(flip,[status(thm),theory(equality)],[13]),
[iquote('flip(13)')] ).
cnf(15,plain,
equal(add(multiply(A,B),B),multiply(B,add(A,add(C,B)))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(16,plain,
equal(multiply(A,add(B,add(C,A))),add(multiply(B,A),A)),
inference(flip,[status(thm),theory(equality)],[15]),
[iquote('flip(15)')] ).
cnf(19,plain,
equal(add(add(multiply(A,B),multiply(C,B)),multiply(D,add(A,C))),multiply(add(A,C),add(B,D))),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(23,plain,
equal(multiply(A,n1),add(multiply(B,A),multiply(inverse(B),A))),
inference(para,[status(thm),theory(equality)],[4,2]),
[iquote('para(4,2)')] ).
cnf(24,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),multiply(B,n1)),
inference(flip,[status(thm),theory(equality)],[23]),
[iquote('flip(23)')] ).
cnf(32,plain,
equal(add(multiply(A,add(B,n1)),multiply(inverse(A),add(B,n1))),n1),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,23]),1]),
[iquote('para(1,23),flip(1)')] ).
cnf(35,plain,
equal(add(multiply(A,inverse(B)),multiply(C,add(A,inverse(B)))),pixley(A,B,C)),
inference(para,[status(thm),theory(equality)],[3,5]),
[iquote('para(3,5)')] ).
cnf(36,plain,
equal(add(inverse(A),multiply(inverse(n1),inverse(A))),multiply(inverse(A),n1)),
inference(para,[status(thm),theory(equality)],[11,24]),
[iquote('para(11,24)')] ).
cnf(37,plain,
equal(multiply(inverse(A),n1),add(inverse(A),multiply(inverse(n1),inverse(A)))),
inference(flip,[status(thm),theory(equality)],[36]),
[iquote('flip(36)')] ).
cnf(38,plain,
equal(multiply(add(A,B),multiply(B,add(C,add(A,B)))),multiply(B,add(C,add(A,B)))),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(43,plain,
equal(add(inverse(A),multiply(B,inverse(A))),multiply(inverse(A),add(n1,B))),
inference(para,[status(thm),theory(equality)],[11,3]),
[iquote('para(11,3)')] ).
cnf(45,plain,
equal(add(multiply(A,inverse(B)),inverse(B)),multiply(inverse(B),add(A,n1))),
inference(para,[status(thm),theory(equality)],[11,3]),
[iquote('para(11,3)')] ).
cnf(46,plain,
equal(multiply(inverse(A),add(B,n1)),add(multiply(B,inverse(A)),inverse(A))),
inference(flip,[status(thm),theory(equality)],[45]),
[iquote('flip(45)')] ).
cnf(49,plain,
equal(multiply(A,add(add(B,A),add(C,A))),add(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,13]),1]),
[iquote('para(1,13),flip(1)')] ).
cnf(51,plain,
equal(multiply(multiply(A,add(B,add(C,A))),A),A),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(65,plain,
equal(multiply(A,multiply(B,add(add(C,B),D))),add(multiply(B,A),multiply(multiply(D,B),A))),
inference(para,[status(thm),theory(equality)],[13,2]),
[iquote('para(13,2)')] ).
cnf(70,plain,
equal(multiply(inverse(A),add(n1,n1)),add(inverse(A),inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,43]),1]),
[iquote('para(11,43),flip(1)')] ).
cnf(97,plain,
equal(add(multiply(A,inverse(A)),multiply(B,n1)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,35]),6]),
[iquote('para(4,35),demod([6])')] ).
cnf(100,plain,
equal(multiply(A,multiply(A,n1)),multiply(A,n1)),
inference(para,[status(thm),theory(equality)],[97,1]),
[iquote('para(97,1)')] ).
cnf(103,plain,
equal(add(inverse(n1),multiply(A,n1)),A),
inference(para,[status(thm),theory(equality)],[11,97]),
[iquote('para(11,97)')] ).
cnf(104,plain,
equal(add(inverse(n1),n1),add(A,n1)),
inference(para,[status(thm),theory(equality)],[1,103]),
[iquote('para(1,103)')] ).
cnf(118,plain,
equal(add(A,n1),add(B,n1)),
inference(para,[status(thm),theory(equality)],[104,104]),
[iquote('para(104,104)')] ).
cnf(134,plain,
equal(add(inverse(n1),n1),multiply(n1,add(A,add(B,n1)))),
inference(para,[status(thm),theory(equality)],[51,103]),
[iquote('para(51,103)')] ).
cnf(135,plain,
equal(multiply(n1,add(A,add(B,n1))),add(inverse(n1),n1)),
inference(flip,[status(thm),theory(equality)],[134]),
[iquote('flip(134)')] ).
cnf(136,plain,
equal(multiply(inverse(A),add(B,n1)),add(inverse(A),inverse(A))),
inference(para,[status(thm),theory(equality)],[118,70]),
[iquote('para(118,70)')] ).
cnf(138,plain,
equal(add(multiply(A,inverse(B)),inverse(B)),add(inverse(B),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),136]),1]),
[iquote('back_demod(46),demod([136]),flip(1)')] ).
cnf(140,plain,
equal(add(multiply(A,add(B,n1)),add(inverse(A),inverse(A))),n1),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),136]),
[iquote('back_demod(32),demod([136])')] ).
cnf(151,plain,
equal(add(inverse(n1),add(multiply(A,B),multiply(inverse(A),B))),B),
inference(para,[status(thm),theory(equality)],[23,103]),
[iquote('para(23,103)')] ).
cnf(162,plain,
equal(add(A,n1),multiply(n1,add(B,add(C,n1)))),
inference(para,[status(thm),theory(equality)],[104,134]),
[iquote('para(104,134)')] ).
cnf(163,plain,
equal(multiply(n1,add(A,add(B,n1))),add(C,n1)),
inference(flip,[status(thm),theory(equality)],[162]),
[iquote('flip(162)')] ).
cnf(170,plain,
equal(multiply(add(A,B),add(C,D)),add(add(multiply(A,C),multiply(B,C)),add(multiply(A,D),multiply(B,D)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,19]),1]),
[iquote('para(2,19),flip(1)')] ).
cnf(189,plain,
equal(multiply(A,add(B,n1)),add(multiply(C,A),multiply(n1,A))),
inference(para,[status(thm),theory(equality)],[118,2]),
[iquote('para(118,2)')] ).
cnf(190,plain,
equal(add(multiply(A,B),multiply(n1,B)),multiply(B,add(C,n1))),
inference(flip,[status(thm),theory(equality)],[189]),
[iquote('flip(189)')] ).
cnf(191,plain,
equal(multiply(A,add(B,n1)),add(A,multiply(n1,A))),
inference(para,[status(thm),theory(equality)],[118,14]),
[iquote('para(118,14)')] ).
cnf(192,plain,
equal(add(A,multiply(n1,A)),multiply(A,add(B,n1))),
inference(flip,[status(thm),theory(equality)],[191]),
[iquote('flip(191)')] ).
cnf(198,plain,
equal(add(add(A,add(B,n1)),multiply(n1,add(A,add(B,n1)))),add(B,n1)),
inference(para,[status(thm),theory(equality)],[191,1]),
[iquote('para(191,1)')] ).
cnf(205,plain,
equal(multiply(multiply(n1,n1),add(A,n1)),add(multiply(n1,n1),multiply(n1,n1))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[100,192]),1]),
[iquote('para(100,192),flip(1)')] ).
cnf(225,plain,
equal(multiply(multiply(inverse(A),n1),n1),add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[100,24]),1]),
[iquote('para(100,24),flip(1)')] ).
cnf(227,plain,
equal(multiply(A,B),add(multiply(inverse(n1),A),multiply(multiply(B,n1),A))),
inference(para,[status(thm),theory(equality)],[103,2]),
[iquote('para(103,2)')] ).
cnf(231,plain,
equal(multiply(multiply(A,B),multiply(multiply(B,n1),A)),multiply(multiply(B,n1),A)),
inference(para,[status(thm),theory(equality)],[103,12]),
[iquote('para(103,12)')] ).
cnf(243,plain,
equal(add(multiply(inverse(n1),n1),add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[227,11]),225]),
[iquote('para(227,11),demod([225])')] ).
cnf(247,plain,
equal(add(add(A,add(B,n1)),add(C,n1)),add(add(multiply(A,D),multiply(add(B,n1),D)),add(multiply(A,n1),n1))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,192]),170,1]),
[iquote('para(163,192),demod([170,1])')] ).
cnf(248,plain,
equal(add(add(multiply(A,B),multiply(add(C,n1),B)),add(multiply(A,n1),n1)),add(add(A,add(C,n1)),add(D,n1))),
inference(flip,[status(thm),theory(equality)],[247]),
[iquote('flip(247)')] ).
cnf(249,plain,
equal(add(add(multiply(A,B),multiply(n1,B)),add(multiply(A,n1),multiply(n1,n1))),add(add(A,n1),add(n1,multiply(n1,n1)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[191,192]),170]),1]),
[iquote('para(191,192),demod([170]),flip(1)')] ).
cnf(268,plain,
equal(add(inverse(n1),add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1))),multiply(inverse(A),n1)),
inference(para,[status(thm),theory(equality)],[100,151]),
[iquote('para(100,151)')] ).
cnf(269,plain,
equal(add(multiply(A,multiply(n1,n1)),multiply(n1,n1)),add(multiply(n1,n1),multiply(n1,n1))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[100,190]),205]),
[iquote('para(100,190),demod([205])')] ).
cnf(276,plain,
equal(multiply(inverse(A),add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1))),add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,231]),225,225]),
[iquote('para(11,231),demod([225,225])')] ).
cnf(426,plain,
equal(multiply(multiply(inverse(A),n1),inverse(A)),inverse(A)),
inference(para,[status(thm),theory(equality)],[140,51]),
[iquote('para(140,51)')] ).
cnf(437,plain,
equal(multiply(inverse(A),add(B,multiply(inverse(A),n1))),add(inverse(A),inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[426,3]),138]),1]),
[iquote('para(426,3),demod([138]),flip(1)')] ).
cnf(438,plain,
equal(add(multiply(A,multiply(inverse(A),n1)),multiply(inverse(A),n1)),add(inverse(A),inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[276]),437]),1]),
[iquote('back_demod(276),demod([437]),flip(1)')] ).
cnf(440,plain,
equal(add(inverse(n1),add(inverse(A),inverse(A))),multiply(inverse(A),n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[268]),438]),
[iquote('back_demod(268),demod([438])')] ).
cnf(441,plain,
equal(multiply(inverse(A),n1),add(inverse(n1),add(inverse(A),inverse(A)))),
inference(flip,[status(thm),theory(equality)],[440]),
[iquote('flip(440)')] ).
cnf(442,plain,
equal(add(multiply(inverse(n1),n1),add(inverse(A),inverse(A))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[243]),438]),
[iquote('back_demod(243),demod([438])')] ).
cnf(475,plain,
equal(multiply(add(inverse(n1),add(inverse(A),inverse(A))),inverse(A)),inverse(A)),
inference(para,[status(thm),theory(equality)],[441,426]),
[iquote('para(441,426)')] ).
cnf(479,plain,
equal(multiply(inverse(A),inverse(A)),add(inverse(A),inverse(A))),
inference(para,[status(thm),theory(equality)],[103,437]),
[iquote('para(103,437)')] ).
cnf(494,plain,
equal(add(multiply(A,add(B,add(C,n1))),add(D,n1)),add(add(multiply(B,A),multiply(add(C,n1),A)),add(multiply(B,n1),n1))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,3]),170,1]),
[iquote('para(163,3),demod([170,1])')] ).
cnf(495,plain,
equal(add(add(multiply(A,B),multiply(add(C,n1),B)),add(multiply(A,n1),n1)),add(multiply(B,add(A,add(C,n1))),add(D,n1))),
inference(flip,[status(thm),theory(equality)],[494]),
[iquote('flip(494)')] ).
cnf(501,plain,
equal(add(multiply(A,B),multiply(n1,B)),add(B,multiply(n1,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[191,2]),1]),
[iquote('para(191,2),flip(1)')] ).
cnf(507,plain,
equal(add(multiply(A,multiply(n1,n1)),multiply(n1,n1)),add(n1,multiply(n1,n1))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[269]),501]),
[iquote('back_demod(269),demod([501])')] ).
cnf(508,plain,
equal(add(add(A,multiply(n1,A)),add(n1,multiply(n1,n1))),add(add(B,n1),add(n1,multiply(n1,n1)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[249]),501,501]),
[iquote('back_demod(249),demod([501,501])')] ).
cnf(509,plain,
equal(add(add(A,n1),add(n1,multiply(n1,n1))),add(add(B,multiply(n1,B)),add(n1,multiply(n1,n1)))),
inference(flip,[status(thm),theory(equality)],[508]),
[iquote('flip(508)')] ).
cnf(553,plain,
equal(add(multiply(A,add(B,add(C,n1))),add(D,n1)),add(C,n1)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,501]),198]),
[iquote('para(163,501),demod([198])')] ).
cnf(554,plain,
equal(add(add(multiply(A,B),multiply(add(C,n1),B)),add(multiply(A,n1),n1)),add(C,n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[495]),553]),
[iquote('back_demod(495),demod([553])')] ).
cnf(555,plain,
equal(add(add(A,add(B,n1)),add(C,n1)),add(B,n1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[248]),554]),1]),
[iquote('back_demod(248),demod([554]),flip(1)')] ).
cnf(558,plain,
equal(add(add(A,multiply(n1,A)),add(n1,multiply(n1,n1))),add(A,n1)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[555,1]),170,501,501]),
[iquote('para(555,1),demod([170,501,501])')] ).
cnf(559,plain,
equal(add(add(A,n1),add(n1,multiply(n1,n1))),add(B,n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[509]),558]),
[iquote('back_demod(509),demod([558])')] ).
cnf(560,plain,
equal(add(A,n1),add(add(B,n1),add(n1,multiply(n1,n1)))),
inference(flip,[status(thm),theory(equality)],[559]),
[iquote('flip(559)')] ).
cnf(563,plain,
equal(add(n1,multiply(n1,n1)),add(n1,n1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[559,1]),170,501,100,507,558]),1]),
[iquote('para(559,1),demod([170,501,100,507,558]),flip(1)')] ).
cnf(564,plain,
equal(add(A,n1),add(add(B,n1),add(n1,n1))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[560]),563]),
[iquote('back_demod(560),demod([563])')] ).
cnf(593,plain,
equal(multiply(n1,add(A,n1)),add(n1,n1)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[563,192]),1]),
[iquote('para(563,192),flip(1)')] ).
cnf(625,plain,
equal(add(add(n1,n1),add(inverse(n1),inverse(n1))),n1),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[593,24]),136,1]),
[iquote('para(593,24),demod([136,1])')] ).
cnf(628,plain,
equal(add(add(A,n1),add(inverse(n1),inverse(n1))),n1),
inference(para,[status(thm),theory(equality)],[118,625]),
[iquote('para(118,625)')] ).
cnf(721,plain,
equal(add(add(A,n1),add(n1,n1)),multiply(n1,add(B,add(C,n1)))),
inference(para,[status(thm),theory(equality)],[564,134]),
[iquote('para(564,134)')] ).
cnf(725,plain,
equal(add(add(A,n1),add(B,n1)),multiply(n1,add(C,add(D,n1)))),
inference(para,[status(thm),theory(equality)],[118,721]),
[iquote('para(118,721)')] ).
cnf(726,plain,
equal(multiply(n1,add(A,add(B,n1))),add(add(C,n1),add(D,n1))),
inference(flip,[status(thm),theory(equality)],[725]),
[iquote('flip(725)')] ).
cnf(850,plain,
equal(multiply(A,add(add(B,n1),add(n1,n1))),add(A,multiply(n1,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[564,2]),501]),
[iquote('para(564,2),demod([501])')] ).
cnf(859,plain,
equal(multiply(A,add(add(B,n1),add(C,n1))),add(A,multiply(n1,A))),
inference(para,[status(thm),theory(equality)],[118,850]),
[iquote('para(118,850)')] ).
cnf(860,plain,
equal(add(A,multiply(n1,A)),multiply(A,add(add(B,n1),add(C,n1)))),
inference(flip,[status(thm),theory(equality)],[859]),
[iquote('flip(859)')] ).
cnf(920,plain,
equal(add(n1,multiply(add(inverse(n1),inverse(n1)),n1)),multiply(n1,n1)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[628,14]),1]),
[iquote('para(628,14),flip(1)')] ).
cnf(921,plain,
equal(multiply(inverse(n1),n1),add(inverse(n1),inverse(n1))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[628,16]),138]),
[iquote('para(628,16),demod([138])')] ).
cnf(922,plain,
equal(add(add(inverse(n1),inverse(n1)),add(inverse(A),inverse(A))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[442]),921]),
[iquote('back_demod(442),demod([921])')] ).
cnf(925,plain,
equal(add(inverse(n1),add(inverse(n1),inverse(n1))),inverse(n1)),
inference(para,[status(thm),theory(equality)],[921,103]),
[iquote('para(921,103)')] ).
cnf(951,plain,
equal(add(add(inverse(n1),inverse(n1)),multiply(inverse(inverse(n1)),n1)),multiply(n1,n1)),
inference(para,[status(thm),theory(equality)],[921,24]),
[iquote('para(921,24)')] ).
cnf(957,plain,
equal(add(add(inverse(n1),inverse(n1)),multiply(A,n1)),multiply(n1,add(inverse(n1),A))),
inference(para,[status(thm),theory(equality)],[921,3]),
[iquote('para(921,3)')] ).
cnf(958,plain,
equal(multiply(n1,add(inverse(n1),A)),add(add(inverse(n1),inverse(n1)),multiply(A,n1))),
inference(flip,[status(thm),theory(equality)],[957]),
[iquote('flip(957)')] ).
cnf(968,plain,
equal(add(inverse(n1),inverse(n1)),inverse(n1)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[921,37]),479,925]),
[iquote('para(921,37),demod([479,925])')] ).
cnf(973,plain,
equal(multiply(n1,add(inverse(n1),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[958]),968,103]),
[iquote('back_demod(958),demod([968,103])')] ).
cnf(976,plain,
equal(inverse(inverse(n1)),multiply(n1,n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[951]),968,103]),
[iquote('back_demod(951),demod([968,103])')] ).
cnf(981,plain,
equal(add(inverse(n1),add(inverse(A),inverse(A))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[922]),968]),
[iquote('back_demod(922),demod([968])')] ).
cnf(982,plain,
equal(add(inverse(A),inverse(A)),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[475]),981,479]),
[iquote('back_demod(475),demod([981,479])')] ).
cnf(984,plain,
equal(multiply(inverse(n1),n1),inverse(n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[921]),982]),
[iquote('back_demod(921),demod([982])')] ).
cnf(985,plain,
equal(multiply(n1,n1),n1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[920]),982,984,4]),1]),
[iquote('back_demod(920),demod([982,984,4]),flip(1)')] ).
cnf(986,plain,
equal(inverse(inverse(n1)),n1),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[976]),985]),
[iquote('back_demod(976),demod([985])')] ).
cnf(1089,plain,
equal(add(inverse(n1),n1),n1),
inference(para,[status(thm),theory(equality)],[986,4]),
[iquote('para(986,4)')] ).
cnf(1090,plain,
equal(multiply(n1,add(A,add(B,n1))),n1),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[135]),1089]),
[iquote('back_demod(135),demod([1089])')] ).
cnf(1091,plain,
equal(add(add(A,n1),add(B,n1)),n1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[726]),1090]),1]),
[iquote('back_demod(726),demod([1090]),flip(1)')] ).
cnf(1096,plain,
equal(add(A,multiply(n1,A)),multiply(A,n1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[860]),1091]),
[iquote('back_demod(860),demod([1091])')] ).
cnf(1097,plain,
equal(multiply(A,n1),add(A,multiply(n1,A))),
inference(flip,[status(thm),theory(equality)],[1096]),
[iquote('flip(1096)')] ).
cnf(1141,plain,
equal(multiply(n1,A),multiply(A,n1)),
inference(para,[status(thm),theory(equality)],[103,973]),
[iquote('para(103,973)')] ).
cnf(1142,plain,
equal(multiply(A,n1),multiply(n1,A)),
inference(flip,[status(thm),theory(equality)],[1141]),
[iquote('flip(1141)')] ).
cnf(1160,plain,
equal(add(A,multiply(n1,A)),multiply(n1,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1142,1097]),1]),
[iquote('para(1142,1097),flip(1)')] ).
cnf(1162,plain,
equal(add(multiply(A,B),multiply(n1,B)),multiply(n1,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[501]),1160]),
[iquote('back_demod(501),demod([1160])')] ).
cnf(1192,plain,
equal(add(add(inverse(n1),A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[973,1160]),973]),
[iquote('para(973,1160),demod([973])')] ).
cnf(1193,plain,
equal(multiply(A,A),A),
inference(para,[status(thm),theory(equality)],[1192,1]),
[iquote('para(1192,1)')] ).
cnf(1270,plain,
equal(add(multiply(A,add(B,A)),multiply(A,add(B,A))),add(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[65,38]),1,49]),
[iquote('para(65,38),demod([1,49])')] ).
cnf(1390,plain,
equal(add(multiply(A,B),B),multiply(B,add(A,B))),
inference(para,[status(thm),theory(equality)],[1193,3]),
[iquote('para(1193,3)')] ).
cnf(1400,plain,
~ equal(multiply(b,add(a,b)),b),
inference(para,[status(thm),theory(equality)],[1390,9]),
[iquote('para(1390,9)')] ).
cnf(1461,plain,
equal(add(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[973,1162]),973,973]),
[iquote('para(973,1162),demod([973,973])')] ).
cnf(1487,plain,
equal(multiply(A,add(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1270]),1461,1461]),
[iquote('back_demod(1270),demod([1461,1461])')] ).
cnf(1488,plain,
$false,
inference(conflict,[status(thm)],[1487,1400]),
[iquote('conflict(1487,1400)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO024-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n025.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 : 600
% 0.13/0.33 % DateTime : Wed Jun 1 20:01:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.27 ----- EQP 0.9e, May 2009 -----
% 0.71/1.27 The job began on n025.cluster.edu, Wed Jun 1 20:01:15 2022
% 0.71/1.27 The command was "./eqp09e".
% 0.71/1.27
% 0.71/1.27 set(prolog_style_variables).
% 0.71/1.27 set(lrpo).
% 0.71/1.27 set(basic_paramod).
% 0.71/1.27 set(functional_subsume).
% 0.71/1.27 set(ordered_paramod).
% 0.71/1.27 set(prime_paramod).
% 0.71/1.27 set(para_pairs).
% 0.71/1.27 assign(pick_given_ratio,4).
% 0.71/1.27 clear(print_kept).
% 0.71/1.27 clear(print_new_demod).
% 0.71/1.27 clear(print_back_demod).
% 0.71/1.27 clear(print_given).
% 0.71/1.27 assign(max_mem,64000).
% 0.71/1.27 end_of_commands.
% 0.71/1.27
% 0.71/1.27 Usable:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Sos:
% 0.71/1.27 0 (wt=-1) [] multiply(add(A,B),B) = B.
% 0.71/1.27 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 0.71/1.27 0 (wt=-1) [] add(A,inverse(A)) = n1.
% 0.71/1.27 0 (wt=-1) [] pixley(A,B,C) = add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))).
% 0.71/1.27 0 (wt=-1) [] pixley(A,A,B) = B.
% 0.71/1.27 0 (wt=-1) [] pixley(A,B,B) = A.
% 0.71/1.27 0 (wt=-1) [] pixley(A,B,A) = A.
% 0.71/1.27 0 (wt=-1) [] -(add(multiply(a,b),b) = b).
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Demodulators:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Passive:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Starting to process input.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 1 (wt=7) [] multiply(add(A,B),B) = B.
% 0.71/1.27 1 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 2 (wt=13) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 0.71/1.27
% 0.71/1.27 ** KEPT: 3 (wt=13) [flip(2)] add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)).
% 0.71/1.27 clause forward subsumed: 0 (wt=13) [flip(3)] multiply(B,add(A,C)) = add(multiply(A,B),multiply(C,B)).
% 0.71/1.27
% 0.71/1.27 ** KEPT: 4 (wt=6) [] add(A,inverse(A)) = n1.
% 0.71/1.27 4 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 5 (wt=18) [flip(1)] add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))) = pixley(A,B,C).
% 0.71/1.27 5 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 6 (wt=6) [] pixley(A,A,B) = B.
% 0.71/1.27 6 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 7 (wt=6) [] pixley(A,B,B) = A.
% 0.71/1.27 7 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 8 (wt=6) [] pixley(A,B,A) = A.
% 0.71/1.27 8 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 9 (wt=7) [] -(add(multiply(a,b),b) = b).
% 0.71/1.27 ---------------- PROOF FOUND ----------------
% 0.71/1.27 % SZS status Unsatisfiable
% 0.71/1.27
% 0.71/1.27
% 0.71/1.27 After processing input:
% 0.71/1.27
% 0.71/1.27 Usable:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Sos:
% 0.71/1.27 4 (wt=6) [] add(A,inverse(A)) = n1.
% 0.71/1.27 6 (wt=6) [] pixley(A,A,B) = B.
% 0.71/1.27 7 (wt=6) [] pixley(A,B,B) = A.
% 0.71/1.27 8 (wt=6) [] pixley(A,B,A) = A.
% 0.71/1.27 1 (wt=7) [] multiply(add(A,B),B) = B.
% 0.71/1.27 9 (wt=7) [] -(add(multiply(a,b),b) = b).
% 0.71/1.27 2 (wt=13) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 0.71/1.27 3 (wt=13) [flip(2)] add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)).
% 0.71/1.27 5 (wt=18) [flip(1)] add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))) = pixley(A,B,C).
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Demodulators:
% 0.71/1.27 1 (wt=7) [] multiply(add(A,B),B) = B.
% 0.71/1.27 4 (wt=6) [] add(A,inverse(A)) = n1.
% 0.71/1.27 5 (wt=18) [flip(1)] add(multiply(A,inverse(B)),add(multiply(A,C),multiply(inverse(B),C))) = pixley(A,B,C).
% 0.71/1.27 6 (wt=6) [] pixley(A,A,B) = B.
% 0.71/1.27 7 (wt=6) [] pixley(A,B,B) = A.
% 0.71/1.27 8 (wt=6) [] pixley(A,B,A) = A.
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Passive:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 UNIT CONFLICT from 1487 and 1400 at 0.11 seconds.
% 0.71/1.27
% 0.71/1.27 ---------------- PROOF ----------------
% 0.71/1.27 % SZS output start Refutation
% See solution above
% 0.71/1.27 ------------ end of proof -------------
% 0.71/1.27
% 0.71/1.27
% 0.71/1.27 ------------- memory usage ------------
% 0.71/1.27 Memory dynamically allocated (tp_alloc): 3417.
% 0.71/1.27 type (bytes each) gets frees in use avail bytes
% 0.71/1.27 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.71/1.27 term ( 16) 105584 65054 40530 35 786.5 K
% 0.71/1.27 gen_ptr ( 8) 203001 24435 178566 121 1396.0 K
% 0.71/1.27 context ( 808) 110181 110179 2 5 5.5 K
% 0.71/1.27 trail ( 12) 20083 20083 0 6 0.1 K
% 0.71/1.27 bt_node ( 68) 43744 43741 3 18 1.4 K
% 0.71/1.27 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.27 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.27 ac_match_free_vars_pos (4020)
% 0.71/1.27 0 0 0 0 0.0 K
% 0.71/1.27 discrim ( 12) 37898 8669 29229 142 344.2 K
% 0.71/1.27 flat ( 40) 244644 244644 0 74 2.9 K
% 0.71/1.27 discrim_pos ( 12) 3568 3568 0 1 0.0 K
% 0.71/1.27 fpa_head ( 12) 9562 0 9562 0 112.1 K
% 0.71/1.27 fpa_tree ( 28) 6127 6127 0 25 0.7 K
% 0.71/1.27 fpa_pos ( 36) 2291 2291 0 1 0.0 K
% 0.71/1.27 literal ( 12) 5429 3942 1487 1 17.4 K
% 0.71/1.27 clause ( 24) 5429 3942 1487 1 34.9 K
% 0.71/1.27 list ( 12) 863 806 57 6 0.7 K
% 0.71/1.27 list_pos ( 20) 6441 2462 3979 15 78.0 K
% 0.71/1.27 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.27
% 0.71/1.27 -------------- statistics -------------
% 0.71/1.27 Clauses input 8
% 0.71/1.27 Usable input 0
% 0.71/1.27 Sos input 8
% 0.71/1.27 Demodulators input 0
% 0.71/1.27 Passive input 0
% 0.71/1.27
% 0.71/1.27 Processed BS (before search) 10
% 0.71/1.27 Forward subsumed BS 1
% 0.71/1.27 Kept BS 9
% 0.71/1.27 New demodulators BS 6
% 0.71/1.27 Back demodulated BS 0
% 0.71/1.27
% 0.71/1.27 Clauses or pairs given 7053
% 0.71/1.27 Clauses generated 3175
% 0.71/1.27 Forward subsumed 1697
% 0.71/1.27 Deleted by weight 0
% 0.71/1.27 Deleted by variable count 0
% 0.71/1.27 Kept 1478
% 0.71/1.27 New demodulators 798
% 0.71/1.27 Back demodulated 515
% 0.71/1.27 Ordered paramod prunes 0
% 0.71/1.27 Basic paramod prunes 25014
% 0.71/1.27 Prime paramod prunes 123
% 0.71/1.27 Semantic prunes 0
% 0.71/1.27
% 0.71/1.27 Rewrite attmepts 47696
% 0.71/1.27 Rewrites 2793
% 0.71/1.27
% 0.71/1.27 FPA overloads 0
% 0.71/1.27 FPA underloads 0
% 0.71/1.27
% 0.71/1.27 Usable size 0
% 0.71/1.27 Sos size 971
% 0.71/1.27 Demodulators size 486
% 0.71/1.27 Passive size 0
% 0.71/1.27 Disabled size 515
% 0.71/1.27
% 0.71/1.27 Proofs found 1
% 0.71/1.27
% 0.71/1.27 ----------- times (seconds) ----------- Wed Jun 1 20:01:15 2022
% 0.71/1.27
% 0.71/1.27 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.71/1.27 system CPU time 0.09 (0 hr, 0 min, 0 sec)
% 0.71/1.27 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.27 input time 0.00
% 0.71/1.27 paramodulation time 0.02
% 0.71/1.27 demodulation time 0.01
% 0.71/1.27 orient time 0.01
% 0.71/1.27 weigh time 0.00
% 0.71/1.27 forward subsume time 0.01
% 0.71/1.27 back demod find time 0.00
% 0.71/1.27 conflict time 0.00
% 0.71/1.27 LRPO time 0.01
% 0.71/1.27 store clause time 0.02
% 0.71/1.27 disable clause time 0.01
% 0.71/1.27 prime paramod time 0.00
% 0.71/1.27 semantics time 0.00
% 0.71/1.27
% 0.71/1.27 EQP interrupted
%------------------------------------------------------------------------------