TSTP Solution File: GRP683-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP683-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:51 EDT 2022
% Result : Unsatisfiable 0.72s 1.14s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 3 RR)
% Number of literals : 77 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 190 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ld(A,mult(A,A)),A),
file('GRP683-10.p',unknown),
[] ).
cnf(2,plain,
equal(rd(mult(A,A),A),A),
file('GRP683-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,ld(A,B)),ld(A,mult(A,B))),
file('GRP683-10.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),mult(rd(A,B),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(mult(rd(A,A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2]),4]),
[iquote('back_demod(2),demod([4])')] ).
cnf(6,plain,
equal(ld(ld(A,B),mult(ld(A,B),mult(C,D))),mult(ld(A,mult(A,C)),D)),
file('GRP683-10.p',unknown),
[] ).
cnf(7,plain,
equal(mult(ld(A,mult(A,B)),C),ld(ld(A,D),mult(ld(A,D),mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[6]),
[iquote('flip(6)')] ).
cnf(8,plain,
equal(mult(rd(mult(A,B),rd(C,D)),rd(C,D)),mult(A,mult(rd(B,D),D))),
inference(demod,[status(thm),theory(equality)],[4,4]),
[iquote('demod([4,4])')] ).
cnf(9,plain,
equal(mult(rd(rd(A,A),B),B),ld(A,mult(A,ld(B,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),1]),
[iquote('demod([4]),flip(1)')] ).
cnf(10,plain,
~ equal(mult(x3,ld(x4,mult(x4,x5))),mult(x3,x5)),
file('GRP683-10.p',unknown),
[] ).
cnf(12,plain,
equal(rd(A,A),ld(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,4]),9,3,1]),
[iquote('para(5,4),demod([9,3,1])')] ).
cnf(13,plain,
equal(mult(rd(ld(A,A),B),B),ld(A,mult(A,ld(B,B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),12]),
[iquote('back_demod(9),demod([12])')] ).
cnf(14,plain,
equal(mult(ld(A,A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),12]),
[iquote('back_demod(5),demod([12])')] ).
cnf(15,plain,
equal(rd(ld(A,mult(A,B)),ld(A,B)),mult(rd(A,ld(A,B)),ld(A,B))),
inference(para,[status(thm),theory(equality)],[3,4]),
[iquote('para(3,4)')] ).
cnf(16,plain,
equal(mult(ld(A,mult(A,B)),C),ld(A,mult(A,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,6]),1]),1]),
[iquote('para(1,6),demod([1]),flip(1)')] ).
cnf(17,plain,
equal(ld(ld(A,B),mult(ld(A,B),mult(C,D))),ld(A,mult(A,mult(C,D)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),16]),1]),
[iquote('back_demod(7),demod([16]),flip(1)')] ).
cnf(18,plain,
equal(mult(rd(ld(A,mult(A,B)),rd(C,D)),rd(C,D)),mult(A,mult(rd(ld(A,B),D),D))),
inference(para,[status(thm),theory(equality)],[3,8]),
[iquote('para(3,8)')] ).
cnf(21,plain,
equal(mult(rd(mult(A,B),mult(rd(C,D),D)),mult(rd(C,D),D)),mult(A,mult(rd(B,D),D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(22,plain,
equal(mult(mult(rd(A,rd(B,C)),rd(B,C)),rd(B,C)),mult(A,mult(rd(rd(B,C),C),C))),
inference(para,[status(thm),theory(equality)],[4,8]),
[iquote('para(4,8)')] ).
cnf(23,plain,
equal(mult(A,mult(rd(rd(B,C),C),C)),mult(mult(rd(A,rd(B,C)),rd(B,C)),rd(B,C))),
inference(flip,[status(thm),theory(equality)],[22]),
[iquote('flip(22)')] ).
cnf(28,plain,
equal(ld(A,mult(A,mult(A,B))),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,16]),1]),
[iquote('para(1,16),flip(1)')] ).
cnf(32,plain,
equal(mult(A,mult(rd(ld(A,ld(B,B)),C),C)),mult(rd(ld(A,A),B),mult(rd(B,C),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,8]),18]),
[iquote('para(13,8),demod([18])')] ).
cnf(33,plain,
equal(mult(rd(ld(A,A),B),mult(rd(B,C),C)),mult(A,mult(rd(ld(A,ld(B,B)),C),C))),
inference(flip,[status(thm),theory(equality)],[32]),
[iquote('flip(32)')] ).
cnf(40,plain,
equal(mult(rd(A,rd(B,C)),rd(B,C)),mult(ld(A,A),mult(rd(A,C),C))),
inference(para,[status(thm),theory(equality)],[14,8]),
[iquote('para(14,8)')] ).
cnf(41,plain,
equal(mult(A,mult(rd(rd(B,C),C),C)),mult(mult(ld(A,A),mult(rd(A,C),C)),rd(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),40]),
[iquote('back_demod(23),demod([40])')] ).
cnf(42,plain,
equal(mult(mult(ld(A,A),mult(rd(A,B),B)),rd(C,B)),mult(A,mult(rd(rd(C,B),B),B))),
inference(flip,[status(thm),theory(equality)],[41]),
[iquote('flip(41)')] ).
cnf(44,plain,
equal(mult(ld(ld(A,mult(A,B)),ld(A,mult(A,B))),mult(rd(ld(A,mult(A,B)),C),C)),mult(A,mult(rd(ld(A,B),C),C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),40]),
[iquote('back_demod(18),demod([40])')] ).
cnf(47,plain,
equal(mult(rd(A,ld(A,A)),ld(A,A)),rd(A,ld(A,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,15]),1]),
[iquote('para(1,15),flip(1)')] ).
cnf(55,plain,
equal(ld(ld(A,B),mult(ld(A,B),C)),ld(A,mult(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,17]),14]),
[iquote('para(14,17),demod([14])')] ).
cnf(57,plain,
equal(ld(A,ld(A,mult(A,B))),ld(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[55,1]),3]),
[iquote('para(55,1),demod([3])')] ).
cnf(74,plain,
equal(mult(rd(mult(A,B),C),C),mult(A,mult(rd(B,C),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,21]),14,12,14]),
[iquote('para(12,21),demod([14,12,14])')] ).
cnf(81,plain,
equal(mult(ld(A,A),mult(rd(A,B),B)),mult(rd(A,B),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,74]),1]),
[iquote('para(14,74),flip(1)')] ).
cnf(82,plain,
equal(mult(rd(ld(A,mult(A,B)),C),C),mult(A,mult(rd(ld(A,B),C),C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),81]),
[iquote('back_demod(44),demod([81])')] ).
cnf(86,plain,
equal(mult(mult(rd(A,B),B),rd(C,B)),mult(A,mult(rd(rd(C,B),B),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),81]),
[iquote('back_demod(42),demod([81])')] ).
cnf(87,plain,
equal(mult(A,mult(rd(rd(B,C),C),C)),mult(mult(rd(A,C),C),rd(B,C))),
inference(flip,[status(thm),theory(equality)],[86]),
[iquote('flip(86)')] ).
cnf(88,plain,
equal(mult(rd(A,rd(B,C)),rd(B,C)),mult(rd(A,C),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),81]),
[iquote('back_demod(40),demod([81])')] ).
cnf(90,plain,
equal(mult(rd(A,ld(B,B)),ld(B,B)),mult(rd(A,B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,88]),12]),
[iquote('para(12,88),demod([12])')] ).
cnf(93,plain,
equal(rd(A,ld(A,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),90,12,14]),1]),
[iquote('back_demod(47),demod([90,12,14]),flip(1)')] ).
cnf(95,plain,
equal(mult(rd(rd(A,B),B),B),rd(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,88]),14]),1]),
[iquote('para(12,88),demod([14]),flip(1)')] ).
cnf(96,plain,
equal(mult(mult(rd(A,B),B),rd(C,B)),mult(A,rd(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[87]),95]),1]),
[iquote('back_demod(87),demod([95]),flip(1)')] ).
cnf(108,plain,
equal(mult(mult(rd(A,B),B),B),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,96]),90,93]),
[iquote('para(93,96),demod([90,93])')] ).
cnf(124,plain,
equal(ld(mult(A,B),mult(mult(A,B),C)),ld(A,mult(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,55]),28]),
[iquote('para(28,55),demod([28])')] ).
cnf(128,plain,
equal(mult(A,mult(rd(ld(A,ld(mult(B,C),mult(B,C))),C),C)),ld(A,mult(A,ld(mult(B,C),mult(B,C))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,33]),108,13]),1]),
[iquote('para(4,33),demod([108,13]),flip(1)')] ).
cnf(142,plain,
equal(ld(ld(A,B),ld(A,mult(A,C))),ld(ld(A,B),C)),
inference(para,[status(thm),theory(equality)],[55,57]),
[iquote('para(55,57)')] ).
cnf(171,plain,
equal(ld(A,mult(A,ld(mult(rd(A,B),B),mult(rd(A,B),B)))),ld(mult(rd(A,B),B),mult(rd(A,B),B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[81,4]),12,13]),1]),
[iquote('para(81,4),demod([12,13]),flip(1)')] ).
cnf(173,plain,
equal(mult(rd(rd(A,rd(B,C)),C),C),rd(mult(rd(A,C),C),rd(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[88,4]),88]),1]),
[iquote('para(88,4),demod([88]),flip(1)')] ).
cnf(182,plain,
equal(rd(mult(rd(A,B),B),rd(C,B)),rd(A,rd(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[88,95]),173]),
[iquote('para(88,95),demod([173])')] ).
cnf(183,plain,
equal(mult(rd(rd(A,rd(B,C)),C),C),rd(A,rd(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[173]),182]),
[iquote('back_demod(173),demod([182])')] ).
cnf(188,plain,
equal(ld(rd(A,B),mult(rd(A,B),ld(B,B))),ld(rd(A,B),rd(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,183]),13,12]),
[iquote('para(12,183),demod([13,12])')] ).
cnf(195,plain,
equal(ld(ld(A,mult(A,B)),mult(B,C)),ld(A,mult(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,55]),142]),
[iquote('para(16,55),demod([142])')] ).
cnf(196,plain,
equal(ld(A,mult(A,B)),ld(ld(A,mult(A,C)),mult(C,B))),
inference(flip,[status(thm),theory(equality)],[195]),
[iquote('flip(195)')] ).
cnf(222,plain,
equal(mult(ld(A,A),B),ld(A,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,108]),16,14]),1]),
[iquote('para(13,108),demod([16,14]),flip(1)')] ).
cnf(235,plain,
equal(ld(A,mult(A,B)),ld(ld(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[222,28]),222,3,28,142,222]),1]),
[iquote('para(222,28),demod([222,3,28,142,222]),flip(1)')] ).
cnf(246,plain,
equal(mult(ld(A,A),B),ld(ld(A,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[222]),235]),
[iquote('back_demod(222),demod([235])')] ).
cnf(256,plain,
equal(ld(ld(ld(A,A),B),mult(B,C)),ld(ld(A,A),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[196]),235,235]),1]),
[iquote('back_demod(196),demod([235,235]),flip(1)')] ).
cnf(261,plain,
equal(ld(ld(rd(A,B),rd(A,B)),ld(B,B)),ld(rd(A,B),rd(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[188]),235]),
[iquote('back_demod(188),demod([235])')] ).
cnf(269,plain,
equal(ld(ld(A,A),ld(mult(rd(A,B),B),mult(rd(A,B),B))),ld(mult(rd(A,B),B),mult(rd(A,B),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[171]),235]),
[iquote('back_demod(171),demod([235])')] ).
cnf(291,plain,
equal(mult(A,mult(rd(ld(A,ld(mult(B,C),mult(B,C))),C),C)),ld(ld(A,A),ld(mult(B,C),mult(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[128]),235]),
[iquote('back_demod(128),demod([235])')] ).
cnf(293,plain,
equal(ld(ld(mult(A,B),mult(A,B)),C),ld(ld(A,A),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[124]),235,235]),
[iquote('back_demod(124),demod([235,235])')] ).
cnf(303,plain,
equal(mult(rd(ld(ld(A,A),B),C),C),mult(A,mult(rd(ld(A,B),C),C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[82]),235]),
[iquote('back_demod(82),demod([235])')] ).
cnf(307,plain,
equal(ld(A,ld(ld(A,A),B)),ld(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[57]),235]),
[iquote('back_demod(57),demod([235])')] ).
cnf(310,plain,
equal(ld(ld(A,A),mult(A,B)),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),235]),
[iquote('back_demod(28),demod([235])')] ).
cnf(312,plain,
equal(mult(rd(ld(A,A),B),B),ld(ld(A,A),ld(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),235]),
[iquote('back_demod(13),demod([235])')] ).
cnf(313,plain,
~ equal(mult(x3,ld(ld(x4,x4),x5)),mult(x3,x5)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),235]),
[iquote('back_demod(10),demod([235])')] ).
cnf(314,plain,
equal(mult(A,ld(A,B)),ld(ld(A,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),235]),
[iquote('back_demod(3),demod([235])')] ).
cnf(331,plain,
equal(mult(A,ld(ld(A,A),B)),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[235,314]),310]),
[iquote('para(235,314),demod([310])')] ).
cnf(334,plain,
equal(mult(A,mult(rd(ld(A,ld(rd(B,C),rd(B,C))),C),C)),ld(ld(A,A),ld(C,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,33]),88,312]),1]),
[iquote('para(95,33),demod([88,312]),flip(1)')] ).
cnf(360,plain,
equal(mult(A,mult(rd(ld(A,B),C),C)),ld(ld(A,A),mult(rd(B,C),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[246,74]),303,246]),
[iquote('para(246,74),demod([303,246])')] ).
cnf(362,plain,
equal(ld(ld(A,A),ld(rd(B,C),rd(B,C))),ld(ld(A,A),ld(C,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[334]),360,312,261]),
[iquote('back_demod(334),demod([360,312,261])')] ).
cnf(368,plain,
equal(ld(ld(A,A),ld(mult(B,C),mult(B,C))),ld(ld(A,A),ld(ld(B,B),ld(C,C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[291]),360,312,293]),1]),
[iquote('back_demod(291),demod([360,312,293]),flip(1)')] ).
cnf(369,plain,
equal(ld(mult(rd(A,B),B),mult(rd(A,B),B)),ld(ld(A,A),ld(B,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[269]),368,261,362]),1]),
[iquote('back_demod(269),demod([368,261,362]),flip(1)')] ).
cnf(419,plain,
equal(ld(ld(ld(A,A),ld(B,B)),ld(ld(B,B),C)),ld(ld(A,A),C)),
inference(para,[status(thm),theory(equality)],[246,256]),
[iquote('para(246,256)')] ).
cnf(440,plain,
equal(ld(ld(ld(A,A),ld(B,B)),C),ld(ld(A,A),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[108,293]),108,293,369]),1]),
[iquote('para(108,293),demod([108,293,369]),flip(1)')] ).
cnf(441,plain,
equal(ld(ld(A,A),ld(ld(B,B),C)),ld(ld(A,A),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[419]),440]),
[iquote('back_demod(419),demod([440])')] ).
cnf(621,plain,
equal(ld(A,ld(ld(B,B),C)),ld(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[441,307]),307]),1]),
[iquote('para(441,307),demod([307]),flip(1)')] ).
cnf(648,plain,
equal(mult(A,ld(ld(B,B),C)),mult(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[621,331]),331]),1]),
[iquote('para(621,331),demod([331]),flip(1)')] ).
cnf(649,plain,
$false,
inference(conflict,[status(thm)],[648,313]),
[iquote('conflict(648,313)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP683-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 15:06:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.14 ----- EQP 0.9e, May 2009 -----
% 0.72/1.14 The job began on n014.cluster.edu, Mon Jun 13 15:06:37 2022
% 0.72/1.14 The command was "./eqp09e".
% 0.72/1.14
% 0.72/1.14 set(prolog_style_variables).
% 0.72/1.14 set(lrpo).
% 0.72/1.14 set(basic_paramod).
% 0.72/1.14 set(functional_subsume).
% 0.72/1.14 set(ordered_paramod).
% 0.72/1.14 set(prime_paramod).
% 0.72/1.14 set(para_pairs).
% 0.72/1.14 assign(pick_given_ratio,4).
% 0.72/1.14 clear(print_kept).
% 0.72/1.14 clear(print_new_demod).
% 0.72/1.14 clear(print_back_demod).
% 0.72/1.14 clear(print_given).
% 0.72/1.14 assign(max_mem,64000).
% 0.72/1.14 end_of_commands.
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 0 (wt=-1) [] ld(A,mult(A,A)) = A.
% 0.72/1.14 0 (wt=-1) [] rd(mult(A,A),A) = A.
% 0.72/1.14 0 (wt=-1) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.72/1.14 0 (wt=-1) [] mult(rd(A,B),B) = rd(mult(A,B),B).
% 0.72/1.14 0 (wt=-1) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.72/1.14 0 (wt=-1) [] rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)).
% 0.72/1.14 0 (wt=-1) [] ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B).
% 0.72/1.14 0 (wt=-1) [] -(mult(x3,ld(x4,mult(x4,x5))) = mult(x3,x5)).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Starting to process input.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.72/1.14 1 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 2 (wt=7) [] rd(mult(A,A),A) = A.
% 0.72/1.14 2 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.72/1.14 3 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.72/1.14 4 is a new demodulator.
% 0.72/1.14 -> 4 back demodulating 2.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.72/1.14 5 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.72/1.14
% 0.72/1.14 ** KEPT: 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.72/1.14 clause forward subsumed: 0 (wt=19) [flip(7)] ld(ld(A,D),mult(ld(A,D),mult(B,C))) = mult(ld(A,mult(A,B)),C).
% 0.72/1.14
% 0.72/1.14 ** KEPT: 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.72/1.14 8 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.72/1.14 9 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 10 (wt=11) [] -(mult(x3,ld(x4,mult(x4,x5))) = mult(x3,x5)).
% 0.72/1.14 ---------------- PROOF FOUND ----------------
% 0.72/1.14 % SZS status Unsatisfiable
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 After processing input:
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.72/1.14 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.72/1.14 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.72/1.14 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.72/1.14 10 (wt=11) [] -(mult(x3,ld(x4,mult(x4,x5))) = mult(x3,x5)).
% 0.72/1.14 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.72/1.14 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.72/1.14 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.72/1.14 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.72/1.14 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.72/1.14 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.72/1.14 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.72/1.14 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.72/1.14 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 UNIT CONFLICT from 648 and 313 at 0.06 seconds.
% 0.72/1.14
% 0.72/1.14 ---------------- PROOF ----------------
% 0.72/1.14 % SZS output start Refutation
% See solution above
% 0.72/1.14 ------------ end of proof -------------
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 ------------- memory usage ------------
% 0.72/1.14 Memory dynamically allocated (tp_alloc): 1464.
% 0.72/1.14 type (bytes each) gets frees in use avail bytes
% 0.72/1.14 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.14 term ( 16) 70981 55297 15684 32 304.4 K
% 0.72/1.14 gen_ptr ( 8) 92035 27024 65011 76 508.5 K
% 0.72/1.14 context ( 808) 42732 42730 2 6 6.3 K
% 0.72/1.14 trail ( 12) 4779 4779 0 6 0.1 K
% 0.72/1.14 bt_node ( 68) 13264 13261 3 16 1.3 K
% 0.72/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_free_vars_pos (4020)
% 0.72/1.14 0 0 0 0 0.0 K
% 0.72/1.14 discrim ( 12) 14977 12636 2341 1390 43.7 K
% 0.72/1.14 flat ( 40) 142342 142342 0 39 1.5 K
% 0.72/1.14 discrim_pos ( 12) 3461 3461 0 1 0.0 K
% 0.72/1.14 fpa_head ( 12) 4654 0 4654 0 54.5 K
% 0.72/1.14 fpa_tree ( 28) 2107 2107 0 21 0.6 K
% 0.72/1.14 fpa_pos ( 36) 1176 1176 0 1 0.0 K
% 0.72/1.14 literal ( 12) 2573 1925 648 1 7.6 K
% 0.72/1.14 clause ( 24) 2573 1925 648 1 15.2 K
% 0.72/1.14 list ( 12) 587 531 56 7 0.7 K
% 0.72/1.14 list_pos ( 20) 3555 2551 1004 86 21.3 K
% 0.72/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.14
% 0.72/1.14 -------------- statistics -------------
% 0.72/1.14 Clauses input 8
% 0.72/1.14 Usable input 0
% 0.72/1.14 Sos input 8
% 0.72/1.14 Demodulators input 0
% 0.72/1.14 Passive input 0
% 0.72/1.14
% 0.72/1.14 Processed BS (before search) 11
% 0.72/1.14 Forward subsumed BS 1
% 0.72/1.14 Kept BS 10
% 0.72/1.14 New demodulators BS 7
% 0.72/1.14 Back demodulated BS 1
% 0.72/1.14
% 0.72/1.14 Clauses or pairs given 1397
% 0.72/1.14 Clauses generated 1570
% 0.72/1.14 Forward subsumed 932
% 0.72/1.14 Deleted by weight 0
% 0.72/1.14 Deleted by variable count 0
% 0.72/1.14 Kept 638
% 0.72/1.14 New demodulators 521
% 0.72/1.14 Back demodulated 522
% 0.72/1.14 Ordered paramod prunes 0
% 0.72/1.14 Basic paramod prunes 1220
% 0.72/1.14 Prime paramod prunes 96
% 0.72/1.14 Semantic prunes 0
% 0.72/1.14
% 0.72/1.14 Rewrite attmepts 24631
% 0.72/1.14 Rewrites 3261
% 0.72/1.14
% 0.72/1.14 FPA overloads 0
% 0.72/1.14 FPA underloads 0
% 0.72/1.14
% 0.72/1.14 Usable size 0
% 0.72/1.14 Sos size 124
% 0.72/1.14 Demodulators size 109
% 0.72/1.14 Passive size 0
% 0.72/1.14 Disabled size 523
% 0.72/1.14
% 0.72/1.14 Proofs found 1
% 0.72/1.14
% 0.72/1.14 ----------- times (seconds) ----------- Mon Jun 13 15:06:38 2022
% 0.72/1.14
% 0.72/1.14 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.14 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.72/1.14 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.72/1.14 input time 0.00
% 0.72/1.14 paramodulation time 0.01
% 0.72/1.14 demodulation time 0.01
% 0.72/1.14 orient time 0.01
% 0.72/1.14 weigh time 0.01
% 0.72/1.14 forward subsume time 0.00
% 0.72/1.14 back demod find time 0.00
% 0.72/1.14 conflict time 0.00
% 0.72/1.14 LRPO time 0.00
% 0.72/1.14 store clause time 0.01
% 0.72/1.14 disable clause time 0.00
% 0.72/1.14 prime paramod time 0.00
% 0.72/1.14 semantics time 0.00
% 0.72/1.14
% 0.72/1.14 EQP interrupted
%------------------------------------------------------------------------------