TSTP Solution File: BOO014-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO014-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 14 23:37:07 EDT 2022
% Result : Unsatisfiable 2.92s 3.37s
% Output : Refutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of clauses : 95 ( 95 unt; 0 nHn; 25 RR)
% Number of literals : 95 ( 0 equ; 1 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 150 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO014-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO014-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(add(A,B),add(C,B)),add(multiply(A,C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(multiply(add(A,B),add(A,C)),add(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('BOO014-2.p',unknown),
[] ).
cnf(6,plain,
equal(add(multiply(A,add(A,B)),multiply(C,add(A,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),5]),
[iquote('back_demod(4),demod([5])')] ).
cnf(7,plain,
equal(add(multiply(A,add(B,C)),multiply(C,add(B,C))),add(multiply(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),5]),
[iquote('back_demod(3),demod([5])')] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO014-2.p',unknown),
[] ).
cnf(9,plain,
equal(add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))),add(multiply(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),8,8]),
[iquote('back_demod(7),demod([8,8])')] ).
cnf(10,plain,
equal(add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),8,8]),
[iquote('back_demod(6),demod([8,8])')] ).
cnf(11,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO014-2.p',unknown),
[] ).
cnf(12,plain,
equal(add(inverse(A),A),multiplicative_identity),
file('BOO014-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO014-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO014-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO014-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO014-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO014-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO014-2.p',unknown),
[] ).
cnf(19,plain,
equal(add(a,b),c),
file('BOO014-2.p',unknown),
[] ).
cnf(20,plain,
equal(multiply(inverse(a),inverse(b)),d),
file('BOO014-2.p',unknown),
[] ).
cnf(21,plain,
~ equal(inverse(c),d),
file('BOO014-2.p',unknown),
[] ).
cnf(22,plain,
equal(add(multiply(A,B),multiply(C,B)),add(multiply(B,A),multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,2]),8]),
[iquote('para(5,2),demod([8])')] ).
cnf(24,plain,
equal(inverse(multiplicative_identity),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,15]),1]),
[iquote('para(14,15),flip(1)')] ).
cnf(40,plain,
equal(add(add(add(multiply(A,B),multiply(A,C)),multiply(A,D)),add(add(multiply(D,B),multiply(D,C)),multiply(D,D))),add(add(multiply(A,B),multiply(A,C)),D)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,9]),8,8]),
[iquote('para(8,9),demod([8,8])')] ).
cnf(56,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,5]),16]),1]),
[iquote('para(11,5),demod([16]),flip(1)')] ).
cnf(57,plain,
equal(add(b,a),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,1]),1]),
[iquote('para(19,1),flip(1)')] ).
cnf(58,plain,
equal(add(multiply(A,B),multiply(A,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,8]),15]),1]),
[iquote('para(11,8),demod([15]),flip(1)')] ).
cnf(59,plain,
equal(add(multiply(inverse(A),B),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,5]),16]),1]),
[iquote('para(12,5),demod([16]),flip(1)')] ).
cnf(61,plain,
equal(multiply(inverse(b),inverse(a)),d),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,2]),1]),
[iquote('para(20,2),flip(1)')] ).
cnf(66,plain,
equal(add(A,multiply(B,inverse(A))),add(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),17,58]),1]),
[iquote('para(13,10),demod([17,58]),flip(1)')] ).
cnf(68,plain,
equal(add(add(multiply(A,A),multiply(A,inverse(B))),multiply(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),17,13,17]),
[iquote('para(13,10),demod([17,13,17])')] ).
cnf(69,plain,
equal(add(multiply(inverse(add(A,B)),A),multiply(inverse(add(A,B)),B)),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,8]),1]),
[iquote('para(14,8),flip(1)')] ).
cnf(84,plain,
equal(add(add(A,B),add(multiply(B,A),multiply(B,B))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,9]),16,16]),
[iquote('para(16,9),demod([16,16])')] ).
cnf(87,plain,
equal(add(multiply(A,B),multiply(additive_identity,B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,5]),1]),
[iquote('para(17,5),flip(1)')] ).
cnf(93,plain,
equal(multiply(c,A),add(multiply(a,A),multiply(b,A))),
inference(para,[status(thm),theory(equality)],[19,5]),
[iquote('para(19,5)')] ).
cnf(94,plain,
equal(multiply(A,c),add(multiply(A,a),multiply(A,b))),
inference(para,[status(thm),theory(equality)],[19,8]),
[iquote('para(19,8)')] ).
cnf(101,plain,
equal(add(multiply(A,B),multiply(A,C)),add(multiply(C,A),multiply(B,A))),
inference(para,[status(thm),theory(equality)],[22,1]),
[iquote('para(22,1)')] ).
cnf(107,plain,
equal(add(multiply(A,B),add(multiply(C,B),multiply(D,B))),add(multiply(B,A),add(multiply(B,C),multiply(B,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,22]),8]),
[iquote('para(5,22),demod([8])')] ).
cnf(126,plain,
equal(multiply(A,inverse(inverse(A))),inverse(inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,56]),17]),
[iquote('para(13,56),demod([17])')] ).
cnf(127,plain,
equal(multiply(inverse(inverse(A)),A),inverse(inverse(A))),
inference(para,[status(thm),theory(equality)],[2,126]),
[iquote('para(2,126)')] ).
cnf(132,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,56]),127,18]),
[iquote('para(14,56),demod([127,18])')] ).
cnf(133,plain,
equal(multiply(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[127]),132,132]),
[iquote('back_demod(127),demod([132,132])')] ).
cnf(145,plain,
equal(add(add(A,B),add(multiply(B,A),B)),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[84]),133]),
[iquote('back_demod(84),demod([133])')] ).
cnf(152,plain,
equal(add(add(A,multiply(A,inverse(B))),multiply(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[68]),133]),
[iquote('back_demod(68),demod([133])')] ).
cnf(153,plain,
equal(add(A,multiply(B,inverse(A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),133]),
[iquote('back_demod(66),demod([133])')] ).
cnf(169,plain,
equal(add(add(add(multiply(A,B),multiply(A,C)),multiply(A,D)),add(add(multiply(D,B),multiply(D,C)),D)),add(add(multiply(A,B),multiply(A,C)),D)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),133]),
[iquote('back_demod(40),demod([133])')] ).
cnf(184,plain,
equal(add(A,multiplicative_identity),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,153]),11]),1]),
[iquote('para(16,153),demod([11]),flip(1)')] ).
cnf(281,plain,
equal(add(multiply(inverse(add(A,B)),C),add(multiply(A,C),multiply(B,C))),C),
inference(para,[status(thm),theory(equality)],[5,59]),
[iquote('para(5,59)')] ).
cnf(311,plain,
equal(add(multiply(multiply(inverse(add(A,B)),A),C),multiply(multiply(inverse(add(A,B)),B),C)),multiply(additive_identity,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[69,5]),1]),
[iquote('para(69,5),flip(1)')] ).
cnf(319,plain,
equal(add(a,inverse(b)),add(a,d)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,153]),1]),
[iquote('para(61,153),flip(1)')] ).
cnf(320,plain,
equal(add(inverse(b),a),add(a,d)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[319,1]),1]),
[iquote('para(319,1),flip(1)')] ).
cnf(336,plain,
equal(multiply(additive_identity,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,87]),18,14]),
[iquote('para(14,87),demod([18,14])')] ).
cnf(337,plain,
equal(add(multiply(multiply(inverse(add(A,B)),A),C),multiply(multiply(inverse(add(A,B)),B),C)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[311]),336]),
[iquote('back_demod(311),demod([336])')] ).
cnf(346,plain,
equal(add(multiply(a,inverse(c)),multiply(b,inverse(c))),additive_identity),
inference(para,[status(thm),theory(equality)],[93,13]),
[iquote('para(93,13)')] ).
cnf(370,plain,
equal(add(A,multiply(A,B)),add(multiply(B,A),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,101]),16]),
[iquote('para(15,101),demod([16])')] ).
cnf(371,plain,
equal(add(multiply(A,B),B),add(B,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[370]),
[iquote('flip(370)')] ).
cnf(450,plain,
equal(add(multiply(inverse(c),a),multiply(b,inverse(c))),additive_identity),
inference(para,[status(thm),theory(equality)],[2,346]),
[iquote('para(2,346)')] ).
cnf(493,plain,
equal(add(multiply(b,inverse(c)),multiply(inverse(c),a)),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[450,1]),1]),
[iquote('para(450,1),flip(1)')] ).
cnf(517,plain,
equal(add(multiply(A,B),add(B,multiply(C,B))),add(multiply(B,A),add(B,multiply(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,107]),15]),
[iquote('para(16,107),demod([15])')] ).
cnf(518,plain,
equal(add(multiply(A,B),add(A,multiply(A,C))),add(multiply(B,A),add(A,multiply(C,A)))),
inference(flip,[status(thm),theory(equality)],[517]),
[iquote('flip(517)')] ).
cnf(624,plain,
equal(add(multiply(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[184,5]),16,16]),1]),
[iquote('para(184,5),demod([16,16]),flip(1)')] ).
cnf(635,plain,
equal(add(A,multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[371]),624]),1]),
[iquote('back_demod(371),demod([624]),flip(1)')] ).
cnf(638,plain,
equal(add(multiply(A,B),A),add(multiply(B,A),add(A,multiply(C,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[518]),635]),
[iquote('back_demod(518),demod([635])')] ).
cnf(639,plain,
equal(add(multiply(A,B),add(B,multiply(C,B))),add(multiply(B,A),B)),
inference(flip,[status(thm),theory(equality)],[638]),
[iquote('flip(638)')] ).
cnf(651,plain,
equal(add(A,multiply(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[152]),635]),
[iquote('back_demod(152),demod([635])')] ).
cnf(652,plain,
equal(add(multiply(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[639]),651,624]),1]),
[iquote('back_demod(639),demod([651,624]),flip(1)')] ).
cnf(657,plain,
equal(add(add(A,B),B),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[145]),652]),
[iquote('back_demod(145),demod([652])')] ).
cnf(925,plain,
equal(add(add(multiply(A,a),multiply(A,b)),c),c),
inference(para,[status(thm),theory(equality)],[94,624]),
[iquote('para(94,624)')] ).
cnf(1013,plain,
equal(add(add(add(multiply(A,B),multiply(A,C)),A),add(add(multiply(inverse(add(multiply(A,B),multiply(A,C))),B),multiply(inverse(add(multiply(A,B),multiply(A,C))),C)),inverse(add(multiply(A,B),multiply(A,C))))),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[153,169]),11]),
[iquote('para(153,169),demod([11])')] ).
cnf(1850,plain,
equal(multiply(b,inverse(c)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[346,657]),18,346]),
[iquote('para(346,657),demod([18,346])')] ).
cnf(1851,plain,
equal(multiply(inverse(c),a),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[493]),1850,18]),
[iquote('back_demod(493),demod([1850,18])')] ).
cnf(3122,plain,
equal(add(multiply(multiply(A,B),C),multiply(B,C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[624,5]),1]),
[iquote('para(624,5),flip(1)')] ).
cnf(3127,plain,
equal(add(add(multiply(A,B),multiply(C,B)),B),B),
inference(para,[status(thm),theory(equality)],[5,624]),
[iquote('para(5,624)')] ).
cnf(3145,plain,
equal(add(add(multiply(A,B),multiply(C,A)),A),A),
inference(para,[status(thm),theory(equality)],[2,3127]),
[iquote('para(2,3127)')] ).
cnf(3158,plain,
equal(add(add(multiply(A,B),multiply(A,C)),A),A),
inference(para,[status(thm),theory(equality)],[2,3145]),
[iquote('para(2,3145)')] ).
cnf(3167,plain,
equal(add(A,inverse(add(multiply(A,B),multiply(A,C)))),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1013]),3158,3158]),
[iquote('back_demod(1013),demod([3158,3158])')] ).
cnf(3734,plain,
equal(multiply(multiply(A,B),inverse(B)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,3122]),17,13]),
[iquote('para(13,3122),demod([17,13])')] ).
cnf(3757,plain,
equal(multiply(d,b),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,3734]),132]),
[iquote('para(20,3734),demod([132])')] ).
cnf(3778,plain,
equal(multiply(d,a),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,3734]),132]),
[iquote('para(61,3734),demod([132])')] ).
cnf(3805,plain,
equal(multiply(inverse(d),b),b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3757,56]),18]),
[iquote('para(3757,56),demod([18])')] ).
cnf(3835,plain,
equal(multiply(inverse(d),a),a),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3778,56]),18]),
[iquote('para(3778,56),demod([18])')] ).
cnf(4042,plain,
equal(add(inverse(d),inverse(add(b,multiply(inverse(d),A)))),multiplicative_identity),
inference(para,[status(thm),theory(equality)],[3805,3167]),
[iquote('para(3805,3167)')] ).
cnf(4103,plain,
equal(add(inverse(d),inverse(c)),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3835,4042]),57]),
[iquote('para(3835,4042),demod([57])')] ).
cnf(4210,plain,
equal(add(multiply(inverse(add(inverse(A),B)),A),multiply(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,281]),18]),
[iquote('para(14,281),demod([18])')] ).
cnf(4994,plain,
equal(multiply(inverse(add(A,B)),A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[133,337]),651]),
[iquote('para(133,337),demod([651])')] ).
cnf(5156,plain,
equal(multiply(inverse(add(a,d)),inverse(b)),additive_identity),
inference(para,[status(thm),theory(equality)],[320,4994]),
[iquote('para(320,4994)')] ).
cnf(5323,plain,
equal(multiply(inverse(add(inverse(A),B)),A),inverse(add(inverse(A),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4994,58]),17]),
[iquote('para(4994,58),demod([17])')] ).
cnf(5324,plain,
equal(add(inverse(add(inverse(A),B)),multiply(B,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4210]),5323]),
[iquote('back_demod(4210),demod([5323])')] ).
cnf(6151,plain,
equal(multiply(inverse(c),d),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4103,5324]),24,18]),
[iquote('para(4103,5324),demod([24,18])')] ).
cnf(6336,plain,
equal(multiply(inverse(add(a,d)),b),inverse(add(a,d))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5156,58]),132,18]),
[iquote('para(5156,58),demod([132,18])')] ).
cnf(8159,plain,
equal(add(multiply(inverse(add(a,A)),b),c),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4994,925]),18]),
[iquote('para(4994,925),demod([18])')] ).
cnf(8267,plain,
equal(add(inverse(add(a,d)),c),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[319,8159]),6336]),
[iquote('para(319,8159),demod([6336])')] ).
cnf(8282,plain,
equal(multiply(inverse(c),inverse(add(a,d))),additive_identity),
inference(para,[status(thm),theory(equality)],[8267,4994]),
[iquote('para(8267,4994)')] ).
cnf(10591,plain,
equal(inverse(c),d),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8282,58]),132,8,1851,6151,18,18]),1]),
[iquote('para(8282,58),demod([132,8,1851,6151,18,18]),flip(1)')] ).
cnf(10592,plain,
$false,
inference(conflict,[status(thm)],[10591,21]),
[iquote('conflict(10591,21)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n028.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 : Wed Jun 1 17:04:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.92/3.37 ----- EQP 0.9e, May 2009 -----
% 2.92/3.37 The job began on n028.cluster.edu, Wed Jun 1 17:04:38 2022
% 2.92/3.37 The command was "./eqp09e".
% 2.92/3.37
% 2.92/3.37 set(prolog_style_variables).
% 2.92/3.37 set(lrpo).
% 2.92/3.37 set(basic_paramod).
% 2.92/3.37 set(functional_subsume).
% 2.92/3.37 set(ordered_paramod).
% 2.92/3.37 set(prime_paramod).
% 2.92/3.37 set(para_pairs).
% 2.92/3.37 assign(pick_given_ratio,4).
% 2.92/3.37 clear(print_kept).
% 2.92/3.37 clear(print_new_demod).
% 2.92/3.37 clear(print_back_demod).
% 2.92/3.37 clear(print_given).
% 2.92/3.37 assign(max_mem,64000).
% 2.92/3.37 end_of_commands.
% 2.92/3.37
% 2.92/3.37 Usable:
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Sos:
% 2.92/3.37 0 (wt=-1) [] add(A,B) = add(B,A).
% 2.92/3.37 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 2.92/3.37 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 2.92/3.37 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 2.92/3.37 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 2.92/3.37 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.92/3.37 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 2.92/3.37 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 2.92/3.37 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 2.92/3.37 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 2.92/3.37 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 2.92/3.37 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 2.92/3.37 0 (wt=-1) [] add(A,additive_identity) = A.
% 2.92/3.37 0 (wt=-1) [] add(additive_identity,A) = A.
% 2.92/3.37 0 (wt=-1) [] add(a,b) = c.
% 2.92/3.37 0 (wt=-1) [] multiply(inverse(a),inverse(b)) = d.
% 2.92/3.37 0 (wt=-1) [] -(inverse(c) = d).
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Demodulators:
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Passive:
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Starting to process input.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 2.92/3.37 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 2.92/3.37
% 2.92/3.37 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 2.92/3.37 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 2.92/3.37
% 2.92/3.37 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 2.92/3.37 3 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 2.92/3.37 4 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 2.92/3.37 5 is a new demodulator.
% 2.92/3.37 -> 5 back demodulating 4.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 6 (wt=17) [back_demod(4),demod([5])] add(multiply(A,add(A,B)),multiply(C,add(A,B))) = add(A,multiply(C,B)).
% 2.92/3.37 6 is a new demodulator.
% 2.92/3.37 -> 5 back demodulating 3.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 7 (wt=17) [back_demod(3),demod([5])] add(multiply(A,add(B,C)),multiply(C,add(B,C))) = add(multiply(A,B),C).
% 2.92/3.37 7 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.92/3.37 8 is a new demodulator.
% 2.92/3.37 -> 8 back demodulating 7.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 2.92/3.37 9 is a new demodulator.
% 2.92/3.37 -> 8 back demodulating 6.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 2.92/3.37 10 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.92/3.37 11 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 2.92/3.37 12 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.92/3.37 13 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 2.92/3.37 14 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.92/3.37 15 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 2.92/3.37 16 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 2.92/3.37 17 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 2.92/3.37 18 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 19 (wt=5) [] add(a,b) = c.
% 2.92/3.37 19 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 20 (wt=7) [] multiply(inverse(a),inverse(b)) = d.
% 2.92/3.37 20 is a new demodulator.
% 2.92/3.37
% 2.92/3.37 ** KEPT: 21 (wt=4) [] -(inverse(c) = d).
% 2.92/3.37 ---------------- PROOF FOUND ----------------
% 2.92/3.37 % SZS status Unsatisfiable
% 2.92/3.37
% 2.92/3.37
% 2.92/3.37 After processing input:
% 2.92/3.37
% 2.92/3.37 Usable:
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Sos:
% 2.92/3.37 21 (wt=4) [] -(inverse(c) = d).
% 2.92/3.37 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.92/3.37 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 2.92/3.37 17 (wt=5) [] add(A,additive_identity) = A.
% 2.92/3.37 18 (wt=5) [] add(additive_identity,A) = A.
% 2.92/3.37 19 (wt=5) [] add(a,b) = c.
% 2.92/3.37 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.92/3.37 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 2.92/3.37 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.92/3.37 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 2.92/3.37 1 (wt=7) [] add(A,B) = add(B,A).
% 2.92/3.37 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 2.92/3.37 20 (wt=7) [] multiply(inverse(a),inverse(b)) = d.
% 2.92/3.37 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 2.92/3.37 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.92/3.37 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 2.92/3.37 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Demodulators:
% 2.92/3.37 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 2.92/3.37 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.92/3.37 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 2.92/3.37 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 2.92/3.37 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.92/3.37 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 2.92/3.37 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.92/3.37 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 2.92/3.37 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.92/3.37 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 2.92/3.37 17 (wt=5) [] add(A,additive_identity) = A.
% 2.92/3.37 18 (wt=5) [] add(additive_identity,A) = A.
% 2.92/3.37 19 (wt=5) [] add(a,b) = c.
% 2.92/3.37 20 (wt=7) [] multiply(inverse(a),inverse(b)) = d.
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 Passive:
% 2.92/3.37 end_of_list.
% 2.92/3.37
% 2.92/3.37 UNIT CONFLICT from 10591 and 21 at 1.56 seconds.
% 2.92/3.37
% 2.92/3.37 ---------------- PROOF ----------------
% 2.92/3.37 % SZS output start Refutation
% See solution above
% 2.92/3.37 ------------ end of proof -------------
% 2.92/3.37
% 2.92/3.37
% 2.92/3.37 ------------- memory usage ------------
% 2.92/3.37 Memory dynamically allocated (tp_alloc): 24414.
% 2.92/3.37 type (bytes each) gets frees in use avail bytes
% 2.92/3.37 sym_ent ( 96) 60 0 60 0 5.6 K
% 2.92/3.37 term ( 16) 1801771 1410955 390816 57 7592.9 K
% 2.92/3.37 gen_ptr ( 8) 2012715 290878 1721837 94 13452.6 K
% 2.92/3.37 context ( 808) 2030824 2030822 2 4 4.7 K
% 2.92/3.37 trail ( 12) 524721 524721 0 5 0.1 K
% 2.92/3.37 bt_node ( 68) 1057329 1057326 3 30 2.2 K
% 2.92/3.37 ac_position (285432) 0 0 0 0 0.0 K
% 2.92/3.37 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.92/3.37 ac_match_free_vars_pos (4020)
% 2.92/3.37 0 0 0 0 0.0 K
% 2.92/3.37 discrim ( 12) 199424 32121 167303 0 1960.6 K
% 2.92/3.37 flat ( 40) 4475660 4475660 0 95 3.7 K
% 2.92/3.37 discrim_pos ( 12) 109941 109941 0 1 0.0 K
% 2.92/3.37 fpa_head ( 12) 6646 0 6646 0 77.9 K
% 2.92/3.37 fpa_tree ( 28) 17120 17120 0 35 1.0 K
% 2.92/3.37 fpa_pos ( 36) 13364 13364 0 1 0.0 K
% 2.92/3.37 literal ( 12) 69178 58587 10591 1 124.1 K
% 2.92/3.37 clause ( 24) 69178 58587 10591 1 248.2 K
% 2.92/3.37 list ( 12) 2832 2776 56 6 0.7 K
% 2.92/3.37 list_pos ( 20) 37509 6607 30902 0 603.6 K
% 2.92/3.37 pair_index ( 40) 2 0 2 0 0.1 K
% 2.92/3.37
% 2.92/3.37 -------------- statistics -------------
% 2.92/3.37 Clauses input 17
% 2.92/3.37 Usable input 0
% 2.92/3.37 Sos input 17
% 2.92/3.37 Demodulators input 0
% 2.92/3.37 Passive input 0
% 2.92/3.37
% 2.92/3.37 Processed BS (before search) 23
% 2.92/3.37 Forward subsumed BS 2
% 2.92/3.37 Kept BS 21
% 2.92/3.37 New demodulators BS 18
% 2.92/3.37 Back demodulated BS 4
% 2.92/3.37
% 2.92/3.37 Clauses or pairs given 122841
% 2.92/3.37 Clauses generated 42207
% 2.92/3.37 Forward subsumed 31637
% 2.92/3.37 Deleted by weight 0
% 2.92/3.37 Deleted by variable count 0
% 2.92/3.37 Kept 10570
% 2.92/3.37 New demodulators 2755
% 2.92/3.37 Back demodulated 1361
% 2.92/3.37 Ordered paramod prunes 0
% 2.92/3.37 Basic paramod prunes 596222
% 2.92/3.37 Prime paramod prunes 1357
% 2.92/3.37 Semantic prunes 0
% 2.92/3.37
% 2.92/3.37 Rewrite attmepts 782763
% 2.92/3.37 Rewrites 95877
% 2.92/3.37
% 2.92/3.37 FPA overloads 0
% 2.92/3.37 FPA underloads 0
% 2.92/3.37
% 2.92/3.37 Usable size 0
% 2.92/3.37 Sos size 9225
% 2.92/3.37 Demodulators size 1862
% 2.92/3.37 Passive size 0
% 2.92/3.37 Disabled size 1365
% 2.92/3.37
% 2.92/3.37 Proofs found 1
% 2.92/3.37
% 2.92/3.37 ----------- times (seconds) ----------- Wed Jun 1 17:04:40 2022
% 2.92/3.37
% 2.92/3.37 user CPU time 1.56 (0 hr, 0 min, 1 sec)
% 2.92/3.37 system CPU time 0.75 (0 hr, 0 min, 0 sec)
% 2.92/3.37 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.92/3.37 input time 0.00
% 2.92/3.37 paramodulation time 0.20
% 2.92/3.37 demodulation time 0.17
% 2.92/3.37 orient time 0.07
% 2.92/3.37 weigh time 0.02
% 2.92/3.37 forward subsume time 0.06
% 2.92/3.37 back demod find time 0.13
% 2.92/3.37 conflict time 0.01
% 2.92/3.37 LRPO time 0.04
% 2.92/3.37 store clause time 0.61
% 2.92/3.37 disable clause time 0.05
% 2.92/3.37 prime paramod time 0.04
% 2.92/3.37 semantics time 0.00
% 2.92/3.37
% 2.92/3.37 EQP interrupted
%------------------------------------------------------------------------------