TSTP Solution File: GRP683-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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.73s 1.19s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 3 RR)
% Number of literals : 83 ( 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 : 206 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ld(A,mult(A,A)),A),
file('GRP683-11.p',unknown),
[] ).
cnf(2,plain,
equal(rd(mult(A,A),A),A),
file('GRP683-11.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,ld(A,B)),ld(A,mult(A,B))),
file('GRP683-11.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-11.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(mult(rd(x3,x4),x4),x5),mult(x3,x5)),
inference(demod,[status(thm),theory(equality)],[4]),
[iquote('demod([4])')] ).
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(169,plain,
equal(mult(rd(rd(A,B),C),C),mult(rd(rd(A,B),B),mult(rd(B,C),C))),
inference(para,[status(thm),theory(equality)],[95,74]),
[iquote('para(95,74)')] ).
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(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(330,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,313]),310]),
[iquote('para(235,313),demod([310])')] ).
cnf(333,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(341,plain,
equal(mult(mult(A,mult(rd(B,C),C)),C),mult(mult(A,B),C)),
inference(para,[status(thm),theory(equality)],[74,108]),
[iquote('para(74,108)')] ).
cnf(359,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(361,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)],[333]),359,312,261]),
[iquote('back_demod(333),demod([359,312,261])')] ).
cnf(367,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]),359,312,293]),1]),
[iquote('back_demod(291),demod([359,312,293]),flip(1)')] ).
cnf(368,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]),367,261,361]),1]),
[iquote('back_demod(269),demod([367,261,361]),flip(1)')] ).
cnf(418,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(439,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,368]),1]),
[iquote('para(108,293),demod([108,293,368]),flip(1)')] ).
cnf(440,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)],[418]),439]),
[iquote('back_demod(418),demod([439])')] ).
cnf(490,plain,
equal(mult(rd(A,B),B),mult(A,ld(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,169]),93,93,312,330]),
[iquote('para(93,169),demod([93,93,312,330])')] ).
cnf(544,plain,
equal(mult(mult(A,mult(B,ld(C,C))),C),mult(mult(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[341]),490]),
[iquote('back_demod(341),demod([490])')] ).
cnf(581,plain,
equal(mult(mult(A,ld(B,B)),B),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[108]),490]),
[iquote('back_demod(108),demod([490])')] ).
cnf(585,plain,
~ equal(mult(mult(x3,ld(x4,x4)),x5),mult(x3,x5)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),490]),
[iquote('back_demod(10),demod([490])')] ).
cnf(626,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)],[440,307]),307]),1]),
[iquote('para(440,307),demod([307]),flip(1)')] ).
cnf(649,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)],[626,330]),330]),1]),
[iquote('para(626,330),demod([330]),flip(1)')] ).
cnf(663,plain,
equal(mult(mult(A,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)],[246,544]),649,581]),1]),
[iquote('para(246,544),demod([649,581]),flip(1)')] ).
cnf(664,plain,
$false,
inference(conflict,[status(thm)],[663,585]),
[iquote('conflict(663,585)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 00:48:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.19 ----- EQP 0.9e, May 2009 -----
% 0.73/1.19 The job began on n023.cluster.edu, Tue Jun 14 00:48:36 2022
% 0.73/1.19 The command was "./eqp09e".
% 0.73/1.19
% 0.73/1.19 set(prolog_style_variables).
% 0.73/1.19 set(lrpo).
% 0.73/1.19 set(basic_paramod).
% 0.73/1.19 set(functional_subsume).
% 0.73/1.19 set(ordered_paramod).
% 0.73/1.19 set(prime_paramod).
% 0.73/1.19 set(para_pairs).
% 0.73/1.19 assign(pick_given_ratio,4).
% 0.73/1.19 clear(print_kept).
% 0.73/1.19 clear(print_new_demod).
% 0.73/1.19 clear(print_back_demod).
% 0.73/1.19 clear(print_given).
% 0.73/1.19 assign(max_mem,64000).
% 0.73/1.19 end_of_commands.
% 0.73/1.19
% 0.73/1.19 Usable:
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Sos:
% 0.73/1.19 0 (wt=-1) [] ld(A,mult(A,A)) = A.
% 0.73/1.19 0 (wt=-1) [] rd(mult(A,A),A) = A.
% 0.73/1.19 0 (wt=-1) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.73/1.19 0 (wt=-1) [] mult(rd(A,B),B) = rd(mult(A,B),B).
% 0.73/1.19 0 (wt=-1) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.73/1.19 0 (wt=-1) [] rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)).
% 0.73/1.19 0 (wt=-1) [] ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B).
% 0.73/1.19 0 (wt=-1) [] -(mult(rd(mult(x3,x4),x4),x5) = mult(x3,x5)).
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Demodulators:
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Passive:
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Starting to process input.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.73/1.19 1 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 2 (wt=7) [] rd(mult(A,A),A) = A.
% 0.73/1.19 2 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.73/1.19 3 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.73/1.19 4 is a new demodulator.
% 0.73/1.19 -> 4 back demodulating 2.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.73/1.19 5 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.73/1.19
% 0.73/1.19 ** 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.73/1.19 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.73/1.19
% 0.73/1.19 ** 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.73/1.19 8 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.73/1.19 9 is a new demodulator.
% 0.73/1.19
% 0.73/1.19 ** KEPT: 10 (wt=11) [demod([4])] -(mult(mult(rd(x3,x4),x4),x5) = mult(x3,x5)).
% 0.73/1.19 ---------------- PROOF FOUND ----------------
% 0.73/1.19 % SZS status Unsatisfiable
% 0.73/1.19
% 0.73/1.19
% 0.73/1.19 After processing input:
% 0.73/1.19
% 0.73/1.19 Usable:
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Sos:
% 0.73/1.19 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.73/1.19 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.73/1.19 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.73/1.19 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.73/1.19 10 (wt=11) [demod([4])] -(mult(mult(rd(x3,x4),x4),x5) = mult(x3,x5)).
% 0.73/1.19 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.73/1.19 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.73/1.19 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.73/1.19 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.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Demodulators:
% 0.73/1.19 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.73/1.19 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.73/1.19 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.73/1.19 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.73/1.19 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.73/1.19 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 Passive:
% 0.73/1.19 end_of_list.
% 0.73/1.19
% 0.73/1.19 UNIT CONFLICT from 663 and 585 at 0.05 seconds.
% 0.73/1.19
% 0.73/1.19 ---------------- PROOF ----------------
% 0.73/1.19 % SZS output start Refutation
% See solution above
% 0.73/1.19 ------------ end of proof -------------
% 0.73/1.19
% 0.73/1.19
% 0.73/1.19 ------------- memory usage ------------
% 0.73/1.19 Memory dynamically allocated (tp_alloc): 1464.
% 0.73/1.19 type (bytes each) gets frees in use avail bytes
% 0.73/1.19 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.73/1.19 term ( 16) 78898 62989 15909 32 308.7 K
% 0.73/1.19 gen_ptr ( 8) 94334 28631 65703 82 513.9 K
% 0.73/1.19 context ( 808) 46985 46983 2 6 6.3 K
% 0.73/1.19 trail ( 12) 4939 4939 0 6 0.1 K
% 0.73/1.19 bt_node ( 68) 14616 14613 3 16 1.3 K
% 0.73/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.19 ac_match_free_vars_pos (4020)
% 0.73/1.19 0 0 0 0 0.0 K
% 0.73/1.19 discrim ( 12) 15198 12959 2239 1492 43.7 K
% 0.73/1.19 flat ( 40) 156194 156194 0 39 1.5 K
% 0.73/1.19 discrim_pos ( 12) 3989 3989 0 1 0.0 K
% 0.73/1.19 fpa_head ( 12) 4648 0 4648 0 54.5 K
% 0.73/1.19 fpa_tree ( 28) 2157 2157 0 21 0.6 K
% 0.73/1.19 fpa_pos ( 36) 1206 1206 0 1 0.0 K
% 0.73/1.19 literal ( 12) 2735 2072 663 1 7.8 K
% 0.73/1.19 clause ( 24) 2735 2072 663 1 15.6 K
% 0.73/1.19 list ( 12) 602 546 56 7 0.7 K
% 0.73/1.19 list_pos ( 20) 3647 2631 1016 78 21.4 K
% 0.73/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.19
% 0.73/1.19 -------------- statistics -------------
% 0.73/1.19 Clauses input 8
% 0.73/1.19 Usable input 0
% 0.73/1.19 Sos input 8
% 0.73/1.19 Demodulators input 0
% 0.73/1.19 Passive input 0
% 0.73/1.19
% 0.73/1.19 Processed BS (before search) 11
% 0.73/1.19 Forward subsumed BS 1
% 0.73/1.19 Kept BS 10
% 0.73/1.19 New demodulators BS 7
% 0.73/1.19 Back demodulated BS 1
% 0.73/1.19
% 0.73/1.19 Clauses or pairs given 1533
% 0.73/1.19 Clauses generated 1710
% 0.73/1.19 Forward subsumed 1057
% 0.73/1.19 Deleted by weight 0
% 0.73/1.19 Deleted by variable count 0
% 0.73/1.19 Kept 653
% 0.73/1.19 New demodulators 536
% 0.73/1.19 Back demodulated 538
% 0.73/1.19 Ordered paramod prunes 0
% 0.73/1.19 Basic paramod prunes 1355
% 0.73/1.19 Prime paramod prunes 101
% 0.73/1.19 Semantic prunes 0
% 0.73/1.19
% 0.73/1.19 Rewrite attmepts 27195
% 0.73/1.19 Rewrites 3784
% 0.73/1.19
% 0.73/1.19 FPA overloads 0
% 0.73/1.19 FPA underloads 0
% 0.73/1.19
% 0.73/1.19 Usable size 0
% 0.73/1.19 Sos size 123
% 0.73/1.19 Demodulators size 108
% 0.73/1.19 Passive size 0
% 0.73/1.19 Disabled size 539
% 0.73/1.19
% 0.73/1.19 Proofs found 1
% 0.73/1.19
% 0.73/1.19 ----------- times (seconds) ----------- Tue Jun 14 00:48:36 2022
% 0.73/1.19
% 0.73/1.19 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.73/1.19 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.73/1.19 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.19 input time 0.00
% 0.73/1.19 paramodulation time 0.00
% 0.73/1.19 demodulation time 0.01
% 0.73/1.19 orient time 0.01
% 0.73/1.19 weigh time 0.00
% 0.73/1.19 forward subsume time 0.00
% 0.73/1.19 back demod find time 0.01
% 0.73/1.19 conflict time 0.00
% 0.73/1.19 LRPO time 0.00
% 0.73/1.19 store clause time 0.01
% 0.73/1.19 disable clause time 0.00
% 0.73/1.19 prime paramod time 0.00
% 0.73/1.19 semantics time 0.00
% 0.73/1.19
% 0.73/1.19 EQP interrupted
%------------------------------------------------------------------------------