TSTP Solution File: GRP686-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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 : Sat Jul 16 08:48:53 EDT 2022
% Result : Unsatisfiable 0.90s 1.27s
% Output : Refutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 8 RR)
% Number of literals : 83 ( 0 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 168 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP686-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP686-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP686-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP686-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP686-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP686-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,B)),C),mult(A,mult(B,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
~ equal(mult(mult(a,mult(a,b)),c),mult(mult(a,a),mult(b,c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(16,plain,
equal(ld(mult(A,mult(B,B)),mult(A,mult(B,mult(B,C)))),C),
inference(para,[status(thm),theory(equality)],[7,2]),
[iquote('para(7,2)')] ).
cnf(17,plain,
equal(mult(rd(A,mult(B,B)),mult(B,mult(B,C))),mult(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),1]),
[iquote('para(3,7),flip(1)')] ).
cnf(18,plain,
equal(rd(mult(A,mult(B,mult(B,C))),C),mult(A,mult(B,B))),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(19,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,7]),6]),
[iquote('para(6,7),demod([6])')] ).
cnf(20,plain,
~ equal(mult(mult(a,mult(a,b)),c),mult(a,mult(a,mult(b,c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),19]),
[iquote('back_demod(8),demod([19])')] ).
cnf(22,plain,
equal(mult(mult(A,mult(B,mult(B,mult(C,C)))),D),mult(A,mult(B,mult(B,mult(C,mult(C,D)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,7]),7]),
[iquote('para(7,7),demod([7])')] ).
cnf(23,plain,
equal(mult(A,mult(A,ld(mult(A,A),B))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,19]),1]),
[iquote('para(1,19),flip(1)')] ).
cnf(25,plain,
equal(rd(mult(A,mult(A,B)),B),mult(A,A)),
inference(para,[status(thm),theory(equality)],[19,4]),
[iquote('para(19,4)')] ).
cnf(26,plain,
equal(mult(A,ld(mult(A,A),B)),ld(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,2]),1]),
[iquote('para(23,2),flip(1)')] ).
cnf(28,plain,
equal(ld(mult(A,mult(B,B)),mult(A,mult(B,C))),ld(B,C)),
inference(para,[status(thm),theory(equality)],[1,16]),
[iquote('para(1,16)')] ).
cnf(31,plain,
equal(mult(rd(A,mult(B,B)),mult(B,C)),mult(A,ld(B,C))),
inference(para,[status(thm),theory(equality)],[1,17]),
[iquote('para(1,17)')] ).
cnf(32,plain,
equal(rd(mult(A,mult(B,C)),ld(B,C)),mult(A,mult(B,B))),
inference(para,[status(thm),theory(equality)],[1,18]),
[iquote('para(1,18)')] ).
cnf(40,plain,
equal(ld(mult(A,A),B),ld(A,ld(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,2]),1]),
[iquote('para(26,2),flip(1)')] ).
cnf(42,plain,
equal(mult(mult(A,mult(A,mult(B,B))),C),mult(A,mult(A,mult(B,mult(B,C))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,7]),19]),
[iquote('para(19,7),demod([19])')] ).
cnf(51,plain,
equal(mult(rd(A,mult(B,B)),B),mult(A,ld(B,unit))),
inference(para,[status(thm),theory(equality)],[5,31]),
[iquote('para(5,31)')] ).
cnf(52,plain,
equal(ld(rd(A,mult(B,B)),mult(A,ld(B,unit))),B),
inference(para,[status(thm),theory(equality)],[51,2]),
[iquote('para(51,2)')] ).
cnf(54,plain,
equal(ld(rd(unit,mult(A,A)),ld(A,unit)),A),
inference(para,[status(thm),theory(equality)],[6,52]),
[iquote('para(6,52)')] ).
cnf(58,plain,
equal(rd(mult(A,ld(B,unit)),B),rd(A,mult(B,B))),
inference(para,[status(thm),theory(equality)],[51,4]),
[iquote('para(51,4)')] ).
cnf(59,plain,
equal(rd(ld(A,unit),A),rd(unit,mult(A,A))),
inference(para,[status(thm),theory(equality)],[6,58]),
[iquote('para(6,58)')] ).
cnf(67,plain,
equal(mult(mult(A,mult(rd(B,mult(C,C)),B)),D),mult(A,mult(rd(B,mult(C,C)),mult(B,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,22]),31,2]),
[iquote('para(3,22),demod([31,2])')] ).
cnf(72,plain,
equal(rd(unit,A),rd(A,mult(A,A))),
inference(para,[status(thm),theory(equality)],[1,58]),
[iquote('para(1,58)')] ).
cnf(73,plain,
equal(rd(A,mult(A,A)),rd(unit,A)),
inference(flip,[status(thm),theory(equality)],[72]),
[iquote('flip(72)')] ).
cnf(75,plain,
equal(mult(rd(unit,A),mult(A,A)),A),
inference(para,[status(thm),theory(equality)],[73,3]),
[iquote('para(73,3)')] ).
cnf(79,plain,
equal(ld(rd(unit,A),A),mult(A,A)),
inference(para,[status(thm),theory(equality)],[75,2]),
[iquote('para(75,2)')] ).
cnf(90,plain,
equal(ld(mult(A,mult(B,B)),mult(A,C)),ld(B,ld(B,C))),
inference(para,[status(thm),theory(equality)],[1,28]),
[iquote('para(1,28)')] ).
cnf(92,plain,
equal(mult(rd(A,mult(B,B)),C),mult(A,ld(B,ld(B,C)))),
inference(para,[status(thm),theory(equality)],[1,31]),
[iquote('para(1,31)')] ).
cnf(93,plain,
equal(mult(mult(A,mult(B,ld(C,ld(C,B)))),D),mult(A,mult(B,ld(C,ld(C,mult(B,D)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),92,92]),
[iquote('back_demod(67),demod([92,92])')] ).
cnf(95,plain,
equal(rd(unit,mult(A,A)),mult(rd(unit,A),rd(unit,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[75,25]),3]),
[iquote('para(75,25),demod([3])')] ).
cnf(96,plain,
equal(rd(ld(A,unit),A),mult(rd(unit,A),rd(unit,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[59]),95]),
[iquote('back_demod(59),demod([95])')] ).
cnf(97,plain,
equal(ld(rd(unit,A),ld(rd(unit,A),ld(A,unit))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[54]),95,40]),
[iquote('back_demod(54),demod([95,40])')] ).
cnf(105,plain,
equal(rd(rd(A,ld(B,unit)),mult(B,B)),rd(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,58]),1]),
[iquote('para(3,58),flip(1)')] ).
cnf(107,plain,
equal(rd(mult(A,mult(A,mult(B,C))),ld(B,C)),mult(A,mult(A,mult(B,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,32]),19]),
[iquote('para(19,32),demod([19])')] ).
cnf(113,plain,
equal(rd(unit,A),ld(A,unit)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[96,3]),19,3,5]),
[iquote('para(96,3),demod([19,3,5])')] ).
cnf(115,plain,
equal(ld(ld(A,unit),unit),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[97]),113,113,9]),
[iquote('back_demod(97),demod([113,113,9])')] ).
cnf(117,plain,
equal(mult(A,A),ld(ld(A,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[79]),113]),1]),
[iquote('back_demod(79),demod([113]),flip(1)')] ).
cnf(122,plain,
equal(rd(mult(A,mult(A,mult(B,C))),ld(B,C)),mult(A,mult(A,ld(ld(B,unit),B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),117]),
[iquote('back_demod(107),demod([117])')] ).
cnf(124,plain,
equal(rd(rd(A,ld(B,unit)),ld(ld(B,unit),B)),rd(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),117]),
[iquote('back_demod(105),demod([117])')] ).
cnf(132,plain,
equal(mult(rd(A,ld(ld(B,unit),B)),C),mult(A,ld(B,ld(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[92]),117]),
[iquote('back_demod(92),demod([117])')] ).
cnf(135,plain,
equal(ld(mult(A,ld(ld(B,unit),B)),mult(A,C)),ld(B,ld(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[90]),117]),
[iquote('back_demod(90),demod([117])')] ).
cnf(157,plain,
equal(rd(mult(A,ld(B,unit)),B),rd(A,ld(ld(B,unit),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[58]),117]),
[iquote('back_demod(58),demod([117])')] ).
cnf(170,plain,
equal(mult(mult(A,mult(A,ld(ld(B,unit),B))),C),mult(A,mult(A,mult(B,mult(B,C))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),117]),
[iquote('back_demod(42),demod([117])')] ).
cnf(179,plain,
equal(rd(mult(A,mult(B,C)),ld(B,C)),mult(A,ld(ld(B,unit),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),117]),
[iquote('back_demod(32),demod([117])')] ).
cnf(185,plain,
equal(mult(mult(A,ld(ld(B,unit),B)),C),mult(A,mult(B,mult(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),117]),
[iquote('back_demod(7),demod([117])')] ).
cnf(192,plain,
equal(mult(mult(A,ld(B,ld(B,unit))),C),mult(A,ld(B,ld(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,93]),6,6]),
[iquote('para(6,93),demod([6,6])')] ).
cnf(199,plain,
equal(mult(A,mult(B,mult(B,C))),mult(A,ld(ld(B,unit),ld(ld(B,unit),C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,93]),6,185,6,6]),
[iquote('para(115,93),demod([6,185,6,6])')] ).
cnf(200,plain,
equal(mult(mult(A,ld(ld(B,unit),B)),C),mult(A,ld(ld(B,unit),ld(ld(B,unit),C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[185]),199]),
[iquote('back_demod(185),demod([199])')] ).
cnf(206,plain,
equal(mult(mult(A,mult(A,ld(ld(B,unit),B))),C),mult(A,mult(A,ld(ld(B,unit),ld(ld(B,unit),C))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[170]),199]),
[iquote('back_demod(170),demod([199])')] ).
cnf(247,plain,
equal(mult(A,mult(A,mult(B,C))),mult(A,mult(A,ld(ld(B,unit),ld(ld(B,unit),ld(B,C)))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[122,3]),206]),1]),
[iquote('para(122,3),demod([206]),flip(1)')] ).
cnf(249,plain,
~ equal(mult(mult(a,mult(a,b)),c),mult(a,mult(a,ld(ld(b,unit),ld(ld(b,unit),ld(b,c)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),247]),
[iquote('back_demod(20),demod([247])')] ).
cnf(251,plain,
equal(rd(A,ld(B,unit)),mult(rd(A,B),ld(ld(B,unit),B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[124,3]),1]),
[iquote('para(124,3),flip(1)')] ).
cnf(268,plain,
equal(rd(A,ld(ld(B,unit),B)),mult(A,ld(B,ld(B,unit)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[132,5]),1]),
[iquote('para(132,5),flip(1)')] ).
cnf(279,plain,
equal(rd(mult(A,ld(B,unit)),B),mult(A,ld(B,ld(B,unit)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[157]),268]),
[iquote('back_demod(157),demod([268])')] ).
cnf(280,plain,
equal(ld(mult(A,ld(ld(B,unit),B)),C),ld(B,ld(B,ld(A,C)))),
inference(para,[status(thm),theory(equality)],[1,135]),
[iquote('para(1,135)')] ).
cnf(295,plain,
equal(mult(A,mult(B,C)),mult(A,ld(ld(B,unit),ld(ld(B,unit),ld(B,C))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[179,3]),200]),1]),
[iquote('para(179,3),demod([200]),flip(1)')] ).
cnf(300,plain,
~ equal(mult(mult(a,ld(ld(a,unit),ld(ld(a,unit),ld(a,b)))),c),mult(a,ld(ld(a,unit),ld(ld(a,unit),ld(a,ld(ld(b,unit),ld(ld(b,unit),ld(b,c)))))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[249]),295,295]),
[iquote('back_demod(249),demod([295,295])')] ).
cnf(335,plain,
equal(mult(ld(A,unit),B),ld(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,192]),1]),
[iquote('para(1,192),demod([1])')] ).
cnf(338,plain,
equal(ld(A,ld(ld(A,unit),B)),B),
inference(para,[status(thm),theory(equality)],[335,1]),
[iquote('para(335,1)')] ).
cnf(340,plain,
equal(ld(ld(A,unit),ld(A,B)),B),
inference(para,[status(thm),theory(equality)],[335,2]),
[iquote('para(335,2)')] ).
cnf(374,plain,
~ equal(mult(mult(a,ld(ld(a,unit),b)),c),mult(a,ld(ld(a,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[300]),340,340,340]),
[iquote('back_demod(300),demod([340,340,340])')] ).
cnf(380,plain,
equal(rd(ld(A,B),B),ld(A,unit)),
inference(para,[status(thm),theory(equality)],[335,4]),
[iquote('para(335,4)')] ).
cnf(381,plain,
equal(mult(A,B),ld(ld(A,unit),B)),
inference(para,[status(thm),theory(equality)],[338,1]),
[iquote('para(338,1)')] ).
cnf(386,plain,
~ equal(ld(ld(ld(ld(a,unit),ld(ld(a,unit),b)),unit),c),ld(ld(a,unit),ld(ld(a,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[374]),381,381,381]),
[iquote('back_demod(374),demod([381,381,381])')] ).
cnf(421,plain,
equal(ld(ld(ld(A,unit),ld(ld(B,unit),B)),C),ld(B,ld(B,ld(A,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[280]),381]),
[iquote('back_demod(280),demod([381])')] ).
cnf(422,plain,
equal(rd(ld(ld(A,unit),ld(B,unit)),B),ld(ld(A,unit),ld(B,ld(B,unit)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[279]),381,381]),
[iquote('back_demod(279),demod([381,381])')] ).
cnf(436,plain,
equal(rd(A,ld(B,unit)),ld(ld(rd(A,B),unit),ld(ld(B,unit),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[251]),381]),
[iquote('back_demod(251),demod([381])')] ).
cnf(456,plain,
equal(ld(ld(rd(A,B),unit),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),381]),
[iquote('back_demod(3),demod([381])')] ).
cnf(482,plain,
equal(ld(ld(A,ld(ld(B,unit),B)),C),ld(B,ld(B,ld(ld(A,unit),C)))),
inference(para,[status(thm),theory(equality)],[115,421]),
[iquote('para(115,421)')] ).
cnf(484,plain,
equal(rd(ld(A,ld(B,unit)),B),ld(A,ld(B,ld(B,unit)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,422]),115]),
[iquote('para(115,422),demod([115])')] ).
cnf(494,plain,
equal(ld(ld(ld(A,ld(B,ld(B,unit))),unit),B),ld(A,ld(B,unit))),
inference(para,[status(thm),theory(equality)],[484,456]),
[iquote('para(484,456)')] ).
cnf(500,plain,
equal(ld(ld(A,ld(A,B)),ld(A,unit)),ld(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,494]),482,115,115]),
[iquote('para(115,494),demod([482,115,115])')] ).
cnf(504,plain,
equal(ld(ld(A,ld(A,B)),unit),ld(B,ld(ld(A,unit),A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[500,380]),436,380,115]),1]),
[iquote('para(500,380),demod([436,380,115]),flip(1)')] ).
cnf(508,plain,
~ equal(ld(ld(b,ld(a,ld(a,unit))),c),ld(ld(a,unit),ld(ld(a,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[386]),504,115]),
[iquote('back_demod(386),demod([504,115])')] ).
cnf(620,plain,
equal(ld(ld(A,ld(B,ld(B,unit))),C),ld(ld(B,unit),ld(ld(B,unit),ld(ld(A,unit),C)))),
inference(para,[status(thm),theory(equality)],[115,482]),
[iquote('para(115,482)')] ).
cnf(621,plain,
$false,
inference(conflict,[status(thm)],[620,508]),
[iquote('conflict(620,508)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 18:42:28 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.90/1.27 ----- EQP 0.9e, May 2009 -----
% 0.90/1.27 The job began on n018.cluster.edu, Mon Jun 13 18:42:28 2022
% 0.90/1.27 The command was "./eqp09e".
% 0.90/1.27
% 0.90/1.27 set(prolog_style_variables).
% 0.90/1.27 set(lrpo).
% 0.90/1.27 set(basic_paramod).
% 0.90/1.27 set(functional_subsume).
% 0.90/1.27 set(ordered_paramod).
% 0.90/1.27 set(prime_paramod).
% 0.90/1.27 set(para_pairs).
% 0.90/1.27 assign(pick_given_ratio,4).
% 0.90/1.27 clear(print_kept).
% 0.90/1.27 clear(print_new_demod).
% 0.90/1.27 clear(print_back_demod).
% 0.90/1.27 clear(print_given).
% 0.90/1.27 assign(max_mem,64000).
% 0.90/1.27 end_of_commands.
% 0.90/1.27
% 0.90/1.27 Usable:
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Sos:
% 0.90/1.27 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.90/1.27 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.90/1.27 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.90/1.27 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.90/1.27 0 (wt=-1) [] mult(A,unit) = A.
% 0.90/1.27 0 (wt=-1) [] mult(unit,A) = A.
% 0.90/1.27 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(A,mult(B,B)),C).
% 0.90/1.27 0 (wt=-1) [] -(mult(mult(a,a),mult(b,c)) = mult(mult(a,mult(a,b)),c)).
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Demodulators:
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Passive:
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Starting to process input.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.90/1.27 1 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.90/1.27 2 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.90/1.27 3 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.90/1.27 4 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.90/1.27 5 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.90/1.27 6 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))).
% 0.90/1.27 7 is a new demodulator.
% 0.90/1.27
% 0.90/1.27 ** KEPT: 8 (wt=15) [flip(1)] -(mult(mult(a,mult(a,b)),c) = mult(mult(a,a),mult(b,c))).
% 0.90/1.27 ---------------- PROOF FOUND ----------------
% 0.90/1.27 % SZS status Unsatisfiable
% 0.90/1.27
% 0.90/1.27
% 0.90/1.27 After processing input:
% 0.90/1.27
% 0.90/1.27 Usable:
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Sos:
% 0.90/1.27 5 (wt=5) [] mult(A,unit) = A.
% 0.90/1.27 6 (wt=5) [] mult(unit,A) = A.
% 0.90/1.27 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.90/1.27 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.90/1.27 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.90/1.27 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.90/1.27 7 (wt=15) [flip(1)] mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))).
% 0.90/1.27 8 (wt=15) [flip(1)] -(mult(mult(a,mult(a,b)),c) = mult(mult(a,a),mult(b,c))).
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Demodulators:
% 0.90/1.27 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.90/1.27 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.90/1.27 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.90/1.27 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.90/1.27 5 (wt=5) [] mult(A,unit) = A.
% 0.90/1.27 6 (wt=5) [] mult(unit,A) = A.
% 0.90/1.27 7 (wt=15) [flip(1)] mult(mult(A,mult(B,B)),C) = mult(A,mult(B,mult(B,C))).
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 Passive:
% 0.90/1.27 end_of_list.
% 0.90/1.27
% 0.90/1.27 UNIT CONFLICT from 620 and 508 at 0.08 seconds.
% 0.90/1.27
% 0.90/1.27 ---------------- PROOF ----------------
% 0.90/1.27 % SZS output start Refutation
% See solution above
% 0.90/1.27 ------------ end of proof -------------
% 0.90/1.27
% 0.90/1.27
% 0.90/1.27 ------------- memory usage ------------
% 0.90/1.27 Memory dynamically allocated (tp_alloc): 2441.
% 0.90/1.27 type (bytes each) gets frees in use avail bytes
% 0.90/1.27 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.90/1.27 term ( 16) 134333 108625 25708 56 500.8 K
% 0.90/1.27 gen_ptr ( 8) 194731 37749 156982 82 1227.1 K
% 0.90/1.27 context ( 808) 83437 83435 2 3 3.9 K
% 0.90/1.27 trail ( 12) 11004 11004 0 6 0.1 K
% 0.90/1.27 bt_node ( 68) 15388 15385 3 24 1.8 K
% 0.90/1.27 ac_position (285432) 0 0 0 0 0.0 K
% 0.90/1.27 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.90/1.27 ac_match_free_vars_pos (4020)
% 0.90/1.27 0 0 0 0 0.0 K
% 0.90/1.27 discrim ( 12) 25773 16392 9381 0 109.9 K
% 0.90/1.27 flat ( 40) 320768 320768 0 71 2.8 K
% 0.90/1.27 discrim_pos ( 12) 7833 7833 0 1 0.0 K
% 0.90/1.27 fpa_head ( 12) 4499 0 4499 0 52.7 K
% 0.90/1.27 fpa_tree ( 28) 4208 4208 0 73 2.0 K
% 0.90/1.27 fpa_pos ( 36) 1222 1222 0 1 0.0 K
% 0.90/1.27 literal ( 12) 2235 1615 620 1 7.3 K
% 0.90/1.27 clause ( 24) 2235 1615 620 1 14.6 K
% 0.90/1.27 list ( 12) 661 605 56 4 0.7 K
% 0.90/1.27 list_pos ( 20) 3349 2197 1152 0 22.5 K
% 0.90/1.27 pair_index ( 40) 2 0 2 0 0.1 K
% 0.90/1.27
% 0.90/1.27 -------------- statistics -------------
% 0.90/1.27 Clauses input 8
% 0.90/1.27 Usable input 0
% 0.90/1.27 Sos input 8
% 0.90/1.27 Demodulators input 0
% 0.90/1.27 Passive input 0
% 0.90/1.27
% 0.90/1.27 Processed BS (before search) 8
% 0.90/1.27 Forward subsumed BS 0
% 0.90/1.27 Kept BS 8
% 0.90/1.27 New demodulators BS 7
% 0.90/1.27 Back demodulated BS 0
% 0.90/1.27
% 0.90/1.27 Clauses or pairs given 1927
% 0.90/1.27 Clauses generated 1566
% 0.90/1.27 Forward subsumed 954
% 0.90/1.27 Deleted by weight 0
% 0.90/1.27 Deleted by variable count 0
% 0.90/1.27 Kept 612
% 0.90/1.27 New demodulators 595
% 0.90/1.27 Back demodulated 439
% 0.90/1.27 Ordered paramod prunes 0
% 0.90/1.27 Basic paramod prunes 4961
% 0.90/1.27 Prime paramod prunes 288
% 0.90/1.27 Semantic prunes 0
% 0.90/1.27
% 0.90/1.27 Rewrite attmepts 60009
% 0.90/1.27 Rewrites 7521
% 0.90/1.27
% 0.90/1.27 FPA overloads 0
% 0.90/1.27 FPA underloads 0
% 0.90/1.27
% 0.90/1.27 Usable size 0
% 0.90/1.27 Sos size 180
% 0.90/1.27 Demodulators size 173
% 0.90/1.27 Passive size 0
% 0.90/1.27 Disabled size 439
% 0.90/1.27
% 0.90/1.27 Proofs found 1
% 0.90/1.27
% 0.90/1.27 ----------- times (seconds) ----------- Mon Jun 13 18:42:28 2022
% 0.90/1.27
% 0.90/1.27 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.90/1.27 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.90/1.27 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.90/1.27 input time 0.00
% 0.90/1.27 paramodulation time 0.01
% 0.90/1.27 demodulation time 0.01
% 0.90/1.27 orient time 0.01
% 0.90/1.27 weigh time 0.00
% 0.90/1.27 forward subsume time 0.00
% 0.90/1.27 back demod find time 0.00
% 0.90/1.27 conflict time 0.00
% 0.90/1.27 LRPO time 0.00
% 0.90/1.27 store clause time 0.02
% 0.90/1.27 disable clause time 0.00
% 0.90/1.27 prime paramod time 0.00
% 0.90/1.27 semantics time 0.00
% 0.90/1.27
% 0.90/1.27 EQP interrupted
%------------------------------------------------------------------------------