TSTP Solution File: GRP682-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP682-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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.74s 1.16s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 76 ( 76 unt; 0 nHn; 4 RR)
% Number of literals : 76 ( 0 equ; 3 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 : 180 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ld(A,mult(A,A)),A),
file('GRP682-11.p',unknown),
[] ).
cnf(2,plain,
equal(rd(mult(A,A),A),A),
file('GRP682-11.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,ld(A,B)),ld(A,mult(A,B))),
file('GRP682-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('GRP682-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(ld(rd(x0,x1),mult(rd(x0,x1),x2)),ld(x0,mult(x0,x2))),
file('GRP682-11.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(19,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(22,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(23,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(24,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)],[23]),
[iquote('flip(23)')] ).
cnf(26,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(35,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]),19]),
[iquote('para(13,8),demod([19])')] ).
cnf(36,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)],[35]),
[iquote('flip(35)')] ).
cnf(41,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(42,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)],[24]),41]),
[iquote('back_demod(24),demod([41])')] ).
cnf(43,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)],[42]),
[iquote('flip(42)')] ).
cnf(45,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)],[19]),41]),
[iquote('back_demod(19),demod([41])')] ).
cnf(49,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(56,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(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)],[26,55]),26]),
[iquote('para(26,55),demod([26])')] ).
cnf(75,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,22]),14,12,14]),
[iquote('para(12,22),demod([14,12,14])')] ).
cnf(82,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,75]),1]),
[iquote('para(14,75),flip(1)')] ).
cnf(83,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)],[45]),82]),
[iquote('back_demod(45),demod([82])')] ).
cnf(87,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)],[43]),82]),
[iquote('back_demod(43),demod([82])')] ).
cnf(88,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)],[87]),
[iquote('flip(87)')] ).
cnf(89,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)],[41]),82]),
[iquote('back_demod(41),demod([82])')] ).
cnf(91,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,89]),12]),
[iquote('para(12,89),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)],[49]),91,12,14]),1]),
[iquote('back_demod(49),demod([91,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,89]),14]),1]),
[iquote('para(12,89),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)],[88]),95]),1]),
[iquote('back_demod(88),demod([95]),flip(1)')] ).
cnf(107,plain,
equal(mult(mult(rd(A,B),B),ld(B,B)),mult(A,ld(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,96]),12]),
[iquote('para(12,96),demod([12])')] ).
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]),91,93]),
[iquote('para(93,96),demod([91,93])')] ).
cnf(129,plain,
equal(ld(ld(A,B),ld(A,mult(A,C))),ld(ld(A,B),C)),
inference(para,[status(thm),theory(equality)],[55,56]),
[iquote('para(55,56)')] ).
cnf(170,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,36]),108,13]),1]),
[iquote('para(4,36),demod([108,13]),flip(1)')] ).
cnf(187,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,75]),
[iquote('para(95,75)')] ).
cnf(189,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)],[82,4]),12,13]),1]),
[iquote('para(82,4),demod([12,13]),flip(1)')] ).
cnf(191,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)],[89,4]),89]),1]),
[iquote('para(89,4),demod([89]),flip(1)')] ).
cnf(201,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)],[89,95]),191]),
[iquote('para(89,95),demod([191])')] ).
cnf(202,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)],[191]),201]),
[iquote('back_demod(191),demod([201])')] ).
cnf(206,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,202]),13,12]),
[iquote('para(12,202),demod([13,12])')] ).
cnf(225,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(239,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)],[225,26]),225,3,26,129,225]),1]),
[iquote('para(225,26),demod([225,3,26,129,225]),flip(1)')] ).
cnf(252,plain,
equal(mult(ld(A,A),B),ld(ld(A,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[225]),239]),
[iquote('back_demod(225),demod([239])')] ).
cnf(259,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)],[206]),239]),
[iquote('back_demod(206),demod([239])')] ).
cnf(267,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)],[189]),239]),
[iquote('back_demod(189),demod([239])')] ).
cnf(277,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)],[170]),239]),
[iquote('back_demod(170),demod([239])')] ).
cnf(311,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)],[83]),239]),
[iquote('back_demod(83),demod([239])')] ).
cnf(312,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)],[74]),239,239]),
[iquote('back_demod(74),demod([239,239])')] ).
cnf(319,plain,
equal(ld(ld(A,A),mult(A,B)),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),239]),
[iquote('back_demod(26),demod([239])')] ).
cnf(321,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]),239]),
[iquote('back_demod(13),demod([239])')] ).
cnf(322,plain,
~ equal(ld(ld(rd(x0,x1),rd(x0,x1)),x2),ld(ld(x0,x0),x2)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),239,239]),
[iquote('back_demod(10),demod([239,239])')] ).
cnf(323,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]),239]),
[iquote('back_demod(3),demod([239])')] ).
cnf(341,plain,
equal(mult(A,ld(ld(A,A),B)),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[239,323]),319]),
[iquote('para(239,323),demod([319])')] ).
cnf(346,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,36]),89,321]),1]),
[iquote('para(95,36),demod([89,321]),flip(1)')] ).
cnf(362,plain,
equal(ld(mult(rd(A,B),B),mult(A,ld(B,B))),ld(rd(A,B),rd(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,239]),312,259]),
[iquote('para(107,239),demod([312,259])')] ).
cnf(373,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)],[252,75]),311,252]),
[iquote('para(252,75),demod([311,252])')] ).
cnf(375,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)],[346]),373,321,259]),
[iquote('back_demod(346),demod([373,321,259])')] ).
cnf(383,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)],[277]),373,321,312]),1]),
[iquote('back_demod(277),demod([373,321,312]),flip(1)')] ).
cnf(384,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)],[267]),383,259,375]),1]),
[iquote('back_demod(267),demod([383,259,375]),flip(1)')] ).
cnf(454,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,312]),108,312,384]),1]),
[iquote('para(108,312),demod([108,312,384]),flip(1)')] ).
cnf(491,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,187]),93,93,321,341]),
[iquote('para(93,187),demod([93,93,321,341])')] ).
cnf(533,plain,
equal(ld(mult(A,ld(B,B)),mult(A,ld(B,B))),ld(ld(A,A),ld(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[384]),491,491]),
[iquote('back_demod(384),demod([491,491])')] ).
cnf(542,plain,
equal(ld(rd(A,B),rd(A,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)],[362]),491,533]),1]),
[iquote('back_demod(362),demod([491,533]),flip(1)')] ).
cnf(554,plain,
~ equal(ld(ld(x0,x0),x2),ld(ld(x0,x0),x2)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[322]),542,454]),
[iquote('back_demod(322),demod([542,454])')] ).
cnf(555,plain,
$false,
inference(conflict,[status(thm)],[554]),
[iquote('xx_conflict(554)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP682-11 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 07:41:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.16 ----- EQP 0.9e, May 2009 -----
% 0.74/1.16 The job began on n016.cluster.edu, Tue Jun 14 07:41:16 2022
% 0.74/1.16 The command was "./eqp09e".
% 0.74/1.16
% 0.74/1.16 set(prolog_style_variables).
% 0.74/1.16 set(lrpo).
% 0.74/1.16 set(basic_paramod).
% 0.74/1.16 set(functional_subsume).
% 0.74/1.16 set(ordered_paramod).
% 0.74/1.16 set(prime_paramod).
% 0.74/1.16 set(para_pairs).
% 0.74/1.16 assign(pick_given_ratio,4).
% 0.74/1.16 clear(print_kept).
% 0.74/1.16 clear(print_new_demod).
% 0.74/1.16 clear(print_back_demod).
% 0.74/1.16 clear(print_given).
% 0.74/1.16 assign(max_mem,64000).
% 0.74/1.16 end_of_commands.
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 0 (wt=-1) [] ld(A,mult(A,A)) = A.
% 0.74/1.16 0 (wt=-1) [] rd(mult(A,A),A) = A.
% 0.74/1.16 0 (wt=-1) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.74/1.16 0 (wt=-1) [] mult(rd(A,B),B) = rd(mult(A,B),B).
% 0.74/1.16 0 (wt=-1) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.74/1.16 0 (wt=-1) [] rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)).
% 0.74/1.16 0 (wt=-1) [] ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B).
% 0.74/1.16 0 (wt=-1) [] -(ld(rd(x0,x1),mult(rd(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Starting to process input.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.74/1.16 1 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 2 (wt=7) [] rd(mult(A,A),A) = A.
% 0.74/1.16 2 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.74/1.16 3 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.74/1.16 4 is a new demodulator.
% 0.74/1.16 -> 4 back demodulating 2.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.74/1.16 5 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.74/1.16
% 0.74/1.16 ** 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.74/1.16 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.74/1.16
% 0.74/1.16 ** 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.74/1.16 8 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.74/1.16 9 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 10 (wt=15) [] -(ld(rd(x0,x1),mult(rd(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.74/1.16 ---------------- PROOF FOUND ----------------
% 0.74/1.16 % SZS status Unsatisfiable
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 After processing input:
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.74/1.16 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.74/1.16 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.74/1.16 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.74/1.16 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.74/1.16 10 (wt=15) [] -(ld(rd(x0,x1),mult(rd(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.74/1.16 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.74/1.16 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.74/1.16 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.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.74/1.16 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.74/1.16 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.74/1.16 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.74/1.16 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.74/1.16 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 UNIT CONFLICT from 554 and x=x at 0.04 seconds.
% 0.74/1.16
% 0.74/1.16 ---------------- PROOF ----------------
% 0.74/1.16 % SZS output start Refutation
% See solution above
% 0.74/1.16 ------------ end of proof -------------
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------------- memory usage ------------
% 0.74/1.16 Memory dynamically allocated (tp_alloc): 1464.
% 0.74/1.16 type (bytes each) gets frees in use avail bytes
% 0.74/1.16 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.16 term ( 16) 51521 37363 14158 32 275.0 K
% 0.74/1.16 gen_ptr ( 8) 80260 20211 60049 75 469.7 K
% 0.74/1.16 context ( 808) 32025 32023 2 5 5.5 K
% 0.74/1.16 trail ( 12) 3951 3951 0 6 0.1 K
% 0.74/1.16 bt_node ( 68) 9890 9887 3 16 1.3 K
% 0.74/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_free_vars_pos (4020)
% 0.74/1.16 0 0 0 0 0.0 K
% 0.74/1.16 discrim ( 12) 14198 10307 3891 291 49.0 K
% 0.74/1.16 flat ( 40) 105357 105357 0 43 1.7 K
% 0.74/1.16 discrim_pos ( 12) 2193 2193 0 1 0.0 K
% 0.74/1.16 fpa_head ( 12) 4862 0 4862 0 57.0 K
% 0.74/1.16 fpa_tree ( 28) 2021 2021 0 25 0.7 K
% 0.74/1.16 fpa_pos ( 36) 1008 1008 0 1 0.0 K
% 0.74/1.16 literal ( 12) 1993 1439 554 0 6.5 K
% 0.74/1.16 clause ( 24) 1993 1439 554 0 13.0 K
% 0.74/1.16 list ( 12) 514 456 58 2 0.7 K
% 0.74/1.16 list_pos ( 20) 2967 1861 1106 23 22.1 K
% 0.74/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.16
% 0.74/1.16 -------------- statistics -------------
% 0.74/1.16 Clauses input 8
% 0.74/1.16 Usable input 0
% 0.74/1.16 Sos input 8
% 0.74/1.16 Demodulators input 0
% 0.74/1.16 Passive input 0
% 0.74/1.16
% 0.74/1.16 Processed BS (before search) 11
% 0.74/1.16 Forward subsumed BS 1
% 0.74/1.16 Kept BS 10
% 0.74/1.16 New demodulators BS 7
% 0.74/1.16 Back demodulated BS 1
% 0.74/1.16
% 0.74/1.16 Clauses or pairs given 1095
% 0.74/1.16 Clauses generated 1168
% 0.74/1.16 Forward subsumed 624
% 0.74/1.16 Deleted by weight 0
% 0.74/1.16 Deleted by variable count 0
% 0.74/1.16 Kept 544
% 0.74/1.16 New demodulators 448
% 0.74/1.16 Back demodulated 381
% 0.74/1.16 Ordered paramod prunes 0
% 0.74/1.16 Basic paramod prunes 1101
% 0.74/1.16 Prime paramod prunes 49
% 0.74/1.16 Semantic prunes 0
% 0.74/1.16
% 0.74/1.16 Rewrite attmepts 17968
% 0.74/1.16 Rewrites 2066
% 0.74/1.16
% 0.74/1.16 FPA overloads 0
% 0.74/1.16 FPA underloads 0
% 0.74/1.16
% 0.74/1.16 Usable size 0
% 0.74/1.16 Sos size 171
% 0.74/1.16 Demodulators size 151
% 0.74/1.16 Passive size 0
% 0.74/1.16 Disabled size 382
% 0.74/1.16
% 0.74/1.16 Proofs found 1
% 0.74/1.16
% 0.74/1.16 ----------- times (seconds) ----------- Tue Jun 14 07:41:16 2022
% 0.74/1.16
% 0.74/1.16 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.74/1.16 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.74/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.16 input time 0.00
% 0.74/1.16 paramodulation time 0.01
% 0.74/1.16 demodulation time 0.01
% 0.74/1.16 orient time 0.00
% 0.74/1.16 weigh time 0.00
% 0.74/1.16 forward subsume time 0.00
% 0.74/1.16 back demod find time 0.00
% 0.74/1.16 conflict time 0.00
% 0.74/1.16 LRPO time 0.00
% 0.74/1.16 store clause time 0.01
% 0.74/1.16 disable clause time 0.00
% 0.74/1.16 prime paramod time 0.00
% 0.74/1.16 semantics time 0.00
% 0.74/1.16
% 0.74/1.16 EQP interrupted
%------------------------------------------------------------------------------