TSTP Solution File: BOO028-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO028-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:30 EDT 2022
% Result : Unsatisfiable 1.09s 1.48s
% Output : Refutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 8
% Syntax : Number of clauses : 103 ( 103 unt; 0 nHn; 4 RR)
% Number of literals : 103 ( 0 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 235 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,multiply(B,multiply(A,C))),A),
file('BOO028-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(add(A,B),add(A,inverse(B))),A),
file('BOO028-1.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,add(B,add(A,C))),A),
file('BOO028-1.p',unknown),
[] ).
cnf(6,plain,
equal(add(multiply(A,B),multiply(A,inverse(B))),A),
file('BOO028-1.p',unknown),
[] ).
cnf(7,plain,
equal(add(A,B),add(B,A)),
file('BOO028-1.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO028-1.p',unknown),
[] ).
cnf(9,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('BOO028-1.p',unknown),
[] ).
cnf(11,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('BOO028-1.p',unknown),
[] ).
cnf(13,plain,
~ equal(add(multiply(b,a),multiply(c,a)),multiply(a,add(b,c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(add(A,multiply(B,multiply(C,A))),A),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(20,plain,
equal(add(A,add(B,multiply(C,A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),9]),
[iquote('para(3,1),demod([9])')] ).
cnf(26,plain,
equal(add(A,multiply(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(27,plain,
equal(multiply(A,add(B,A)),A),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(28,plain,
equal(add(multiply(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,7]),1]),
[iquote('para(26,7),flip(1)')] ).
cnf(29,plain,
equal(add(A,multiply(A,B)),A),
inference(para,[status(thm),theory(equality)],[8,26]),
[iquote('para(8,26)')] ).
cnf(30,plain,
equal(multiply(A,add(A,B)),A),
inference(para,[status(thm),theory(equality)],[7,27]),
[iquote('para(7,27)')] ).
cnf(31,plain,
equal(multiply(add(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,8]),1]),
[iquote('para(27,8),flip(1)')] ).
cnf(38,plain,
equal(multiply(A,multiply(B,add(C,A))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,4]),11]),
[iquote('para(6,4),demod([11])')] ).
cnf(39,plain,
equal(multiply(add(A,B),add(B,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(40,plain,
equal(multiply(add(A,B),add(inverse(B),A)),A),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(42,plain,
equal(add(multiply(A,inverse(B)),multiply(A,B)),A),
inference(para,[status(thm),theory(equality)],[7,6]),
[iquote('para(7,6)')] ).
cnf(44,plain,
equal(multiply(A,multiply(B,A)),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,27]),11]),
[iquote('para(29,27),demod([11])')] ).
cnf(45,plain,
equal(add(multiply(A,B),multiply(B,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(46,plain,
equal(add(multiply(A,B),multiply(inverse(B),A)),A),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(50,plain,
equal(add(A,add(multiply(B,multiply(A,C)),D)),add(A,D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,9]),1]),
[iquote('para(1,9),flip(1)')] ).
cnf(55,plain,
equal(add(A,add(B,C)),add(C,add(A,B))),
inference(para,[status(thm),theory(equality)],[9,7]),
[iquote('para(9,7)')] ).
cnf(64,plain,
equal(multiply(A,multiply(B,C)),multiply(C,multiply(A,B))),
inference(para,[status(thm),theory(equality)],[11,8]),
[iquote('para(11,8)')] ).
cnf(67,plain,
~ equal(add(multiply(a,b),multiply(c,a)),multiply(a,add(b,c))),
inference(para,[status(thm),theory(equality)],[8,13]),
[iquote('para(8,13)')] ).
cnf(70,plain,
equal(add(multiply(A,B),multiply(B,A)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[44,26]),
[iquote('para(44,26)')] ).
cnf(89,plain,
equal(multiply(add(A,multiply(B,inverse(A))),inverse(A)),multiply(B,inverse(A))),
inference(para,[status(thm),theory(equality)],[28,39]),
[iquote('para(28,39)')] ).
cnf(92,plain,
equal(add(multiply(add(A,inverse(B)),B),inverse(B)),add(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[31,6]),
[iquote('para(31,6)')] ).
cnf(95,plain,
equal(multiply(add(inverse(A),B),add(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,8]),1]),
[iquote('para(40,8),flip(1)')] ).
cnf(96,plain,
equal(multiply(A,add(inverse(A),multiply(B,A))),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[28,40]),
[iquote('para(28,40)')] ).
cnf(101,plain,
equal(add(inverse(A),multiply(B,A)),add(inverse(A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,20]),1]),
[iquote('para(6,20),flip(1)')] ).
cnf(102,plain,
equal(multiply(A,add(inverse(A),B)),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[96]),101]),
[iquote('back_demod(96),demod([101])')] ).
cnf(105,plain,
equal(add(A,add(B,multiply(A,C))),add(A,B)),
inference(para,[status(thm),theory(equality)],[8,20]),
[iquote('para(8,20)')] ).
cnf(114,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),B),
inference(para,[status(thm),theory(equality)],[8,45]),
[iquote('para(8,45)')] ).
cnf(115,plain,
equal(add(multiply(A,add(B,inverse(A))),inverse(A)),add(B,inverse(A))),
inference(para,[status(thm),theory(equality)],[31,45]),
[iquote('para(31,45)')] ).
cnf(118,plain,
equal(add(A,multiply(inverse(A),add(B,A))),add(B,A)),
inference(para,[status(thm),theory(equality)],[31,46]),
[iquote('para(31,46)')] ).
cnf(124,plain,
equal(multiply(A,add(B,inverse(A))),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[7,102]),
[iquote('para(7,102)')] ).
cnf(125,plain,
equal(multiply(A,B),multiply(B,add(A,inverse(B)))),
inference(flip,[status(thm),theory(equality)],[124]),
[iquote('flip(124)')] ).
cnf(129,plain,
equal(multiply(A,multiply(inverse(B),B)),multiply(B,inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,102]),11]),1]),
[iquote('para(26,102),demod([11]),flip(1)')] ).
cnf(138,plain,
equal(add(A,add(B,multiply(C,add(A,B)))),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,9]),1]),
[iquote('para(26,9),flip(1)')] ).
cnf(139,plain,
equal(multiply(add(A,inverse(B)),B),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[124,8]),1]),
[iquote('para(124,8),flip(1)')] ).
cnf(140,plain,
equal(add(multiply(A,B),inverse(B)),add(A,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[92]),139]),
[iquote('back_demod(92),demod([139])')] ).
cnf(142,plain,
equal(multiply(A,multiply(B,add(C,multiply(A,B)))),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,11]),1]),
[iquote('para(27,11),flip(1)')] ).
cnf(143,plain,
equal(multiply(A,add(B,inverse(A))),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[125,8]),
[iquote('para(125,8)')] ).
cnf(145,plain,
equal(add(multiply(A,B),inverse(A)),add(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[115]),143]),
[iquote('back_demod(115),demod([143])')] ).
cnf(196,plain,
equal(multiply(inverse(A),add(B,A)),multiply(inverse(A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,38]),1]),
[iquote('para(3,38),flip(1)')] ).
cnf(197,plain,
equal(add(A,multiply(inverse(A),B)),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[118]),196]),
[iquote('back_demod(118),demod([196])')] ).
cnf(202,plain,
equal(add(A,multiply(B,inverse(A))),add(B,A)),
inference(para,[status(thm),theory(equality)],[8,197]),
[iquote('para(8,197)')] ).
cnf(203,plain,
equal(multiply(add(A,B),inverse(B)),multiply(A,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[89]),202]),
[iquote('back_demod(89),demod([202])')] ).
cnf(207,plain,
equal(add(A,add(inverse(B),B)),add(B,inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,197]),9]),1]),
[iquote('para(27,197),demod([9]),flip(1)')] ).
cnf(222,plain,
equal(add(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[129,29]),
[iquote('para(129,29)')] ).
cnf(244,plain,
equal(multiply(A,add(inverse(multiply(A,B)),multiply(A,inverse(B)))),multiply(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[42,40]),
[iquote('para(42,40)')] ).
cnf(246,plain,
equal(multiply(A,inverse(inverse(A))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,222]),1]),
[iquote('para(42,222),flip(1)')] ).
cnf(253,plain,
equal(add(multiply(A,B),add(C,multiply(B,A))),add(multiply(A,B),C)),
inference(para,[status(thm),theory(equality)],[44,20]),
[iquote('para(44,20)')] ).
cnf(254,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[246,114]),222]),1]),
[iquote('para(246,114),demod([222]),flip(1)')] ).
cnf(318,plain,
equal(add(A,multiply(B,inverse(multiply(A,C)))),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,50]),1]),
[iquote('para(6,50),flip(1)')] ).
cnf(344,plain,
equal(multiply(add(A,B),inverse(A)),multiply(B,inverse(A))),
inference(para,[status(thm),theory(equality)],[7,203]),
[iquote('para(7,203)')] ).
cnf(358,plain,
equal(multiply(A,add(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[207,30]),
[iquote('para(207,30)')] ).
cnf(359,plain,
equal(multiply(A,add(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[7,358]),
[iquote('para(7,358)')] ).
cnf(622,plain,
equal(multiply(A,multiply(B,C)),multiply(C,multiply(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,64]),11,44]),
[iquote('para(44,64),demod([11,44])')] ).
cnf(623,plain,
equal(add(multiply(A,B),multiply(B,multiply(A,C))),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[622,26]),
[iquote('para(622,26)')] ).
cnf(677,plain,
~ equal(multiply(a,add(b,c)),add(multiply(a,b),multiply(a,c))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,67]),1]),
[iquote('para(8,67),flip(1)')] ).
cnf(684,plain,
equal(add(multiply(A,inverse(multiply(B,C))),B),add(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[318,7]),1]),
[iquote('para(318,7),flip(1)')] ).
cnf(722,plain,
equal(add(A,multiply(B,C)),add(multiply(C,B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[70,55]),253]),
[iquote('para(70,55),demod([253])')] ).
cnf(725,plain,
equal(multiply(A,add(multiply(B,C),inverse(multiply(C,B)))),A),
inference(para,[status(thm),theory(equality)],[722,359]),
[iquote('para(722,359)')] ).
cnf(727,plain,
equal(multiply(add(multiply(A,B),inverse(multiply(B,A))),C),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[725,8]),1]),
[iquote('para(725,8),flip(1)')] ).
cnf(765,plain,
equal(add(multiply(A,B),multiply(inverse(add(B,inverse(A))),A)),A),
inference(para,[status(thm),theory(equality)],[143,46]),
[iquote('para(143,46)')] ).
cnf(773,plain,
equal(multiply(add(A,B),add(inverse(multiply(A,inverse(B))),B)),B),
inference(para,[status(thm),theory(equality)],[202,40]),
[iquote('para(202,40)')] ).
cnf(849,plain,
equal(add(multiply(A,B),inverse(multiply(B,A))),add(A,inverse(multiply(B,A)))),
inference(para,[status(thm),theory(equality)],[44,140]),
[iquote('para(44,140)')] ).
cnf(852,plain,
equal(multiply(add(A,inverse(multiply(B,A))),C),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[727]),849]),
[iquote('back_demod(727),demod([849])')] ).
cnf(960,plain,
equal(add(inverse(multiply(A,B)),inverse(B)),inverse(multiply(A,B))),
inference(para,[status(thm),theory(equality)],[852,39]),
[iquote('para(852,39)')] ).
cnf(962,plain,
equal(multiply(inverse(A),inverse(multiply(B,A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[960,27]),
[iquote('para(960,27)')] ).
cnf(968,plain,
equal(add(inverse(multiply(A,B)),multiply(C,inverse(B))),inverse(multiply(A,B))),
inference(para,[status(thm),theory(equality)],[962,17]),
[iquote('para(962,17)')] ).
cnf(969,plain,
equal(multiply(A,inverse(multiply(A,B))),multiply(A,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[244]),968]),
[iquote('back_demod(244),demod([968])')] ).
cnf(974,plain,
equal(multiply(A,inverse(multiply(B,A))),multiply(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[8,969]),
[iquote('para(8,969)')] ).
cnf(978,plain,
equal(multiply(inverse(multiply(A,B)),B),multiply(B,inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[974,8]),1]),
[iquote('para(974,8),flip(1)')] ).
cnf(984,plain,
equal(add(inverse(multiply(A,inverse(B))),B),inverse(multiply(A,inverse(B)))),
inference(para,[status(thm),theory(equality)],[852,95]),
[iquote('para(852,95)')] ).
cnf(985,plain,
equal(multiply(add(A,B),inverse(multiply(A,inverse(B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[773]),984]),
[iquote('back_demod(773),demod([984])')] ).
cnf(986,plain,
equal(multiply(add(A,inverse(B)),inverse(multiply(A,B))),inverse(B)),
inference(para,[status(thm),theory(equality)],[254,985]),
[iquote('para(254,985)')] ).
cnf(996,plain,
equal(multiply(inverse(add(A,B)),inverse(B)),inverse(add(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,986]),344]),
[iquote('para(27,986),demod([344])')] ).
cnf(998,plain,
equal(multiply(inverse(add(A,inverse(B))),B),inverse(add(A,inverse(B)))),
inference(para,[status(thm),theory(equality)],[254,996]),
[iquote('para(254,996)')] ).
cnf(999,plain,
equal(add(multiply(A,B),inverse(add(B,inverse(A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[765]),998]),
[iquote('back_demod(765),demod([998])')] ).
cnf(1002,plain,
equal(add(multiply(inverse(A),B),inverse(add(B,A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[254,999]),
[iquote('para(254,999)')] ).
cnf(1062,plain,
equal(inverse(multiply(A,B)),add(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,1002]),978,145]),1]),
[iquote('para(26,1002),demod([978,145]),flip(1)')] ).
cnf(1087,plain,
equal(add(multiply(A,add(inverse(B),inverse(C))),B),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[684]),1062]),
[iquote('back_demod(684),demod([1062])')] ).
cnf(1157,plain,
equal(add(multiply(A,add(inverse(B),C)),B),add(B,A)),
inference(para,[status(thm),theory(equality)],[254,1087]),
[iquote('para(254,1087)')] ).
cnf(1158,plain,
equal(add(multiply(A,add(B,C)),inverse(B)),add(inverse(B),A)),
inference(para,[status(thm),theory(equality)],[254,1157]),
[iquote('para(254,1157)')] ).
cnf(1159,plain,
equal(add(inverse(A),B),add(multiply(B,add(A,C)),inverse(A))),
inference(flip,[status(thm),theory(equality)],[1158]),
[iquote('flip(1158)')] ).
cnf(1202,plain,
equal(multiply(add(A,B),add(B,add(C,inverse(A)))),add(B,multiply(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[105,39]),9,145]),
[iquote('para(105,39),demod([9,145])')] ).
cnf(1508,plain,
equal(add(multiply(A,add(B,multiply(C,A))),multiply(C,A)),multiply(A,add(B,multiply(C,A)))),
inference(para,[status(thm),theory(equality)],[142,26]),
[iquote('para(142,26)')] ).
cnf(1571,plain,
equal(add(multiply(A,add(B,multiply(A,C))),multiply(A,C)),multiply(A,add(B,multiply(A,C)))),
inference(para,[status(thm),theory(equality)],[31,623]),
[iquote('para(31,623)')] ).
cnf(1590,plain,
equal(add(multiply(A,add(B,C)),inverse(B)),add(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[1159,7]),
[iquote('para(1159,7)')] ).
cnf(1853,plain,
equal(add(A,multiply(B,C)),add(A,multiply(C,add(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[138,39]),9,1590,1202]),
[iquote('para(138,39),demod([9,1590,1202])')] ).
cnf(1859,plain,
equal(add(A,multiply(B,add(C,A))),add(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,1853]),1]),
[iquote('para(8,1853),flip(1)')] ).
cnf(1861,plain,
equal(add(multiply(A,add(B,C)),C),add(C,multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1859,7]),1]),
[iquote('para(1859,7),flip(1)')] ).
cnf(1862,plain,
equal(multiply(A,add(B,multiply(A,C))),add(multiply(A,C),multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1571]),1861]),1]),
[iquote('back_demod(1571),demod([1861]),flip(1)')] ).
cnf(1864,plain,
equal(multiply(A,add(B,multiply(C,A))),add(multiply(C,A),multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1508]),1861]),1]),
[iquote('back_demod(1508),demod([1861]),flip(1)')] ).
cnf(1865,plain,
equal(multiply(A,add(multiply(A,B),multiply(B,C))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[142]),1864]),
[iquote('back_demod(142),demod([1864])')] ).
cnf(1877,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,1865]),1861,1862]),1]),
[iquote('para(31,1865),demod([1861,1862]),flip(1)')] ).
cnf(1878,plain,
$false,
inference(conflict,[status(thm)],[1877,677]),
[iquote('conflict(1877,677)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO028-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n026.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:42:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.09/1.48 ----- EQP 0.9e, May 2009 -----
% 1.09/1.48 The job began on n026.cluster.edu, Wed Jun 1 20:42:43 2022
% 1.09/1.48 The command was "./eqp09e".
% 1.09/1.48
% 1.09/1.48 set(prolog_style_variables).
% 1.09/1.48 set(lrpo).
% 1.09/1.48 set(basic_paramod).
% 1.09/1.48 set(functional_subsume).
% 1.09/1.48 set(ordered_paramod).
% 1.09/1.48 set(prime_paramod).
% 1.09/1.48 set(para_pairs).
% 1.09/1.48 assign(pick_given_ratio,4).
% 1.09/1.48 clear(print_kept).
% 1.09/1.48 clear(print_new_demod).
% 1.09/1.48 clear(print_back_demod).
% 1.09/1.48 clear(print_given).
% 1.09/1.48 assign(max_mem,64000).
% 1.09/1.48 end_of_commands.
% 1.09/1.48
% 1.09/1.48 Usable:
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Sos:
% 1.09/1.48 0 (wt=-1) [] add(A,multiply(B,multiply(A,C))) = A.
% 1.09/1.48 0 (wt=-1) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 1.09/1.48 0 (wt=-1) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 1.09/1.48 0 (wt=-1) [] multiply(A,add(B,add(A,C))) = A.
% 1.09/1.48 0 (wt=-1) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 1.09/1.48 0 (wt=-1) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 1.09/1.48 0 (wt=-1) [] add(A,B) = add(B,A).
% 1.09/1.48 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 1.09/1.48 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 1.09/1.48 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 1.09/1.48 0 (wt=-1) [] -(multiply(a,add(b,c)) = add(multiply(b,a),multiply(c,a))).
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Demodulators:
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Passive:
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Starting to process input.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 1.09/1.48 1 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 2 (wt=11) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 1.09/1.48 2 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 1.09/1.48 3 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 1.09/1.48 4 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 5 (wt=11) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 1.09/1.48 5 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 1.09/1.48 6 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 7 (wt=7) [] add(A,B) = add(B,A).
% 1.09/1.48 clause forward subsumed: 0 (wt=7) [flip(7)] add(B,A) = add(A,B).
% 1.09/1.48
% 1.09/1.48 ** KEPT: 8 (wt=7) [] multiply(A,B) = multiply(B,A).
% 1.09/1.48 clause forward subsumed: 0 (wt=7) [flip(8)] multiply(B,A) = multiply(A,B).
% 1.09/1.48
% 1.09/1.48 ** KEPT: 9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 1.09/1.48 9 is a new demodulator.
% 1.09/1.48 -> 9 back demodulating 2.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 1.09/1.48 10 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 1.09/1.48 11 is a new demodulator.
% 1.09/1.48 -> 11 back demodulating 5.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 1.09/1.48 12 is a new demodulator.
% 1.09/1.48
% 1.09/1.48 ** KEPT: 13 (wt=13) [flip(1)] -(add(multiply(b,a),multiply(c,a)) = multiply(a,add(b,c))).
% 1.09/1.48 ---------------- PROOF FOUND ----------------
% 1.09/1.48 % SZS status Unsatisfiable
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 After processing input:
% 1.09/1.48
% 1.09/1.48 Usable:
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Sos:
% 1.09/1.48 7 (wt=7) [] add(A,B) = add(B,A).
% 1.09/1.48 8 (wt=7) [] multiply(A,B) = multiply(B,A).
% 1.09/1.48 1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 1.09/1.48 4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 1.09/1.48 3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 1.09/1.48 6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 1.09/1.48 9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 1.09/1.48 10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 1.09/1.48 11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 1.09/1.48 12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 1.09/1.48 13 (wt=13) [flip(1)] -(add(multiply(b,a),multiply(c,a)) = multiply(a,add(b,c))).
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Demodulators:
% 1.09/1.48 1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 1.09/1.48 3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 1.09/1.48 4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 1.09/1.48 6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 1.09/1.48 9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 1.09/1.48 10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 1.09/1.48 11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 1.09/1.48 12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 Passive:
% 1.09/1.48 end_of_list.
% 1.09/1.48
% 1.09/1.48 UNIT CONFLICT from 1877 and 677 at 0.13 seconds.
% 1.09/1.48
% 1.09/1.48 ---------------- PROOF ----------------
% 1.09/1.48 % SZS output start Refutation
% See solution above
% 1.09/1.48 ------------ end of proof -------------
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 ------------- memory usage ------------
% 1.09/1.48 Memory dynamically allocated (tp_alloc): 2441.
% 1.09/1.48 type (bytes each) gets frees in use avail bytes
% 1.09/1.48 sym_ent ( 96) 57 0 57 0 5.3 K
% 1.09/1.48 term ( 16) 272801 241764 31037 26 599.4 K
% 1.09/1.48 gen_ptr ( 8) 193727 73152 120575 102 942.8 K
% 1.09/1.48 context ( 808) 195159 195157 2 7 7.1 K
% 1.09/1.48 trail ( 12) 21202 21202 0 6 0.1 K
% 1.09/1.48 bt_node ( 68) 79401 79398 3 9 0.8 K
% 1.09/1.48 ac_position (285432) 0 0 0 0 0.0 K
% 1.09/1.48 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.09/1.48 ac_match_free_vars_pos (4020)
% 1.09/1.48 0 0 0 0 0.0 K
% 1.09/1.48 discrim ( 12) 22251 9791 12460 65 146.8 K
% 1.09/1.48 flat ( 40) 461625 461625 0 50 2.0 K
% 1.09/1.48 discrim_pos ( 12) 17080 17080 0 1 0.0 K
% 1.09/1.48 fpa_head ( 12) 4721 0 4721 0 55.3 K
% 1.09/1.48 fpa_tree ( 28) 5235 5235 0 21 0.6 K
% 1.09/1.48 fpa_pos ( 36) 3440 3440 0 1 0.0 K
% 1.09/1.48 literal ( 12) 13842 11965 1877 1 22.0 K
% 1.09/1.48 clause ( 24) 13842 11965 1877 1 44.0 K
% 1.09/1.48 list ( 12) 1622 1566 56 4 0.7 K
% 1.09/1.48 list_pos ( 20) 8927 4131 4796 25 94.2 K
% 1.09/1.48 pair_index ( 40) 2 0 2 0 0.1 K
% 1.09/1.48
% 1.09/1.48 -------------- statistics -------------
% 1.09/1.48 Clauses input 11
% 1.09/1.48 Usable input 0
% 1.09/1.48 Sos input 11
% 1.09/1.48 Demodulators input 0
% 1.09/1.48 Passive input 0
% 1.09/1.48
% 1.09/1.48 Processed BS (before search) 15
% 1.09/1.48 Forward subsumed BS 2
% 1.09/1.48 Kept BS 13
% 1.09/1.48 New demodulators BS 10
% 1.09/1.48 Back demodulated BS 2
% 1.09/1.48
% 1.09/1.48 Clauses or pairs given 15394
% 1.09/1.48 Clauses generated 9645
% 1.09/1.48 Forward subsumed 7781
% 1.09/1.48 Deleted by weight 0
% 1.09/1.48 Deleted by variable count 0
% 1.09/1.48 Kept 1864
% 1.09/1.48 New demodulators 1553
% 1.09/1.48 Back demodulated 859
% 1.09/1.48 Ordered paramod prunes 0
% 1.09/1.48 Basic paramod prunes 42507
% 1.09/1.48 Prime paramod prunes 846
% 1.09/1.48 Semantic prunes 0
% 1.09/1.48
% 1.09/1.48 Rewrite attmepts 84729
% 1.09/1.48 Rewrites 14680
% 1.09/1.48
% 1.09/1.48 FPA overloads 0
% 1.09/1.48 FPA underloads 0
% 1.09/1.48
% 1.09/1.48 Usable size 0
% 1.09/1.48 Sos size 1015
% 1.09/1.48 Demodulators size 890
% 1.09/1.48 Passive size 0
% 1.09/1.48 Disabled size 861
% 1.09/1.48
% 1.09/1.48 Proofs found 1
% 1.09/1.48
% 1.09/1.48 ----------- times (seconds) ----------- Wed Jun 1 20:42:43 2022
% 1.09/1.48
% 1.09/1.48 user CPU time 0.13 (0 hr, 0 min, 0 sec)
% 1.09/1.48 system CPU time 0.21 (0 hr, 0 min, 0 sec)
% 1.09/1.48 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.09/1.48 input time 0.00
% 1.09/1.48 paramodulation time 0.04
% 1.09/1.48 demodulation time 0.01
% 1.09/1.48 orient time 0.01
% 1.09/1.48 weigh time 0.00
% 1.09/1.48 forward subsume time 0.01
% 1.09/1.48 back demod find time 0.00
% 1.09/1.48 conflict time 0.00
% 1.09/1.48 LRPO time 0.01
% 1.09/1.48 store clause time 0.01
% 1.09/1.48 disable clause time 0.00
% 1.09/1.48 prime paramod time 0.01
% 1.09/1.48 semantics time 0.00
% 1.09/1.48
% 1.09/1.48 EQP interrupted
%------------------------------------------------------------------------------