%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP002-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:44:10 EDT 2022
% Result : Unsatisfiable 0.79s 1.19s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 3 RR)
% Number of literals : 59 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 121 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP002-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP002-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP002-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,identity),A),
file('GRP002-4.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(A,multiply(B,multiply(inverse(A),inverse(B)))),commutator(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(multiply(A,multiply(A,A)),identity),
file('GRP002-4.p',unknown),
[] ).
cnf(8,plain,
~ equal(commutator(commutator(a,b),b),identity),
file('GRP002-4.p',unknown),
[] ).
cnf(10,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),1]),1]),
[iquote('para(2,3),demod([1]),flip(1)')] ).
cnf(14,plain,
equal(multiply(commutator(A,B),C),multiply(A,multiply(B,multiply(inverse(A),multiply(inverse(B),C))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,3]),3,3]),
[iquote('para(6,3),demod([3,3])')] ).
cnf(15,plain,
equal(multiply(A,multiply(B,multiply(inverse(A),multiply(inverse(B),C)))),multiply(commutator(A,B),C)),
inference(flip,[status(thm),theory(equality)],[14]),
[iquote('flip(14)')] ).
cnf(16,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(inverse(multiply(A,B)),inverse(C))))),commutator(multiply(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,3]),1]),
[iquote('para(6,3),flip(1)')] ).
cnf(17,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(inverse(A),inverse(multiply(B,C)))))),commutator(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[3,6]),
[iquote('para(3,6)')] ).
cnf(20,plain,
equal(multiply(A,multiply(A,multiply(A,B))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,3]),1,3]),1]),
[iquote('para(7,3),demod([1,3]),flip(1)')] ).
cnf(21,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,multiply(A,B))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),3]),
[iquote('para(3,7),demod([3])')] ).
cnf(25,plain,
equal(multiply(inverse(A),commutator(A,B)),multiply(B,multiply(inverse(A),inverse(B)))),
inference(para,[status(thm),theory(equality)],[6,10]),
[iquote('para(6,10)')] ).
cnf(26,plain,
equal(multiply(A,multiply(inverse(B),inverse(A))),multiply(inverse(B),commutator(B,A))),
inference(flip,[status(thm),theory(equality)],[25]),
[iquote('flip(25)')] ).
cnf(27,plain,
equal(inverse(A),multiply(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,10]),4]),
[iquote('para(7,10),demod([4])')] ).
cnf(28,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,A)))),multiply(B,multiply(B,commutator(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),27,27,3,27,3]),
[iquote('back_demod(26),demod([27,27,3,27,3])')] ).
cnf(29,plain,
equal(multiply(A,multiply(A,commutator(A,B))),multiply(B,multiply(A,multiply(A,multiply(B,B))))),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(32,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(A,multiply(A,multiply(B,multiply(C,multiply(B,C)))))))),commutator(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),27,27,3,3]),
[iquote('back_demod(17),demod([27,27,3,3])')] ).
cnf(33,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(A,multiply(B,multiply(A,multiply(B,multiply(C,C)))))))),commutator(multiply(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),27,3,27,3,3,3]),
[iquote('back_demod(16),demod([27,3,27,3,3,3])')] ).
cnf(34,plain,
equal(multiply(commutator(A,B),C),multiply(A,multiply(B,multiply(A,multiply(A,multiply(B,multiply(B,C))))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),27,27,3,3]),1]),
[iquote('back_demod(15),demod([27,27,3,3]),flip(1)')] ).
cnf(36,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(A,multiply(B,B))))),commutator(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),27,27,3]),
[iquote('back_demod(6),demod([27,27,3])')] ).
cnf(37,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(A,multiply(B,multiply(C,multiply(A,multiply(B,C)))))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,21]),3,3]),
[iquote('para(3,21),demod([3,3])')] ).
cnf(40,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,A)))),multiply(B,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,20]),4]),1]),
[iquote('para(21,20),demod([4]),flip(1)')] ).
cnf(43,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(B,multiply(C,multiply(A,A)))))),multiply(B,multiply(C,multiply(B,multiply(C,commutator(multiply(B,C),A)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,28]),3,3,3]),
[iquote('para(3,28),demod([3,3,3])')] ).
cnf(50,plain,
equal(multiply(A,multiply(A,multiply(B,B))),multiply(B,multiply(A,multiply(B,A)))),
inference(para,[status(thm),theory(equality)],[40,20]),
[iquote('para(40,20)')] ).
cnf(51,plain,
equal(multiply(A,multiply(B,multiply(A,B))),multiply(B,multiply(B,multiply(A,A)))),
inference(flip,[status(thm),theory(equality)],[50]),
[iquote('flip(50)')] ).
cnf(56,plain,
equal(multiply(A,multiply(A,multiply(B,multiply(B,multiply(A,A))))),multiply(B,multiply(A,B))),
inference(para,[status(thm),theory(equality)],[51,20]),
[iquote('para(51,20)')] ).
cnf(57,plain,
equal(multiply(A,multiply(B,A)),multiply(B,multiply(B,multiply(A,multiply(A,multiply(B,B)))))),
inference(flip,[status(thm),theory(equality)],[56]),
[iquote('flip(56)')] ).
cnf(60,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,multiply(A,B))))),commutator(A,multiply(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,32]),4]),
[iquote('para(7,32),demod([4])')] ).
cnf(62,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,multiply(B,A))))),commutator(A,multiply(B,A))),
inference(para,[status(thm),theory(equality)],[20,32]),
[iquote('para(20,32)')] ).
cnf(67,plain,
equal(commutator(A,multiply(B,A)),commutator(multiply(A,B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,33]),4,62]),
[iquote('para(7,33),demod([4,62])')] ).
cnf(68,plain,
equal(commutator(multiply(A,B),B),commutator(A,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[67]),
[iquote('flip(67)')] ).
cnf(71,plain,
equal(multiply(A,multiply(A,multiply(B,multiply(A,multiply(B,B))))),commutator(multiply(A,A),B)),
inference(para,[status(thm),theory(equality)],[20,33]),
[iquote('para(20,33)')] ).
cnf(73,plain,
equal(commutator(A,multiply(B,multiply(C,A))),commutator(multiply(A,multiply(B,C)),multiply(B,C))),
inference(para,[status(thm),theory(equality)],[3,67]),
[iquote('para(3,67)')] ).
cnf(74,plain,
equal(commutator(multiply(A,multiply(B,C)),multiply(B,C)),commutator(A,multiply(B,multiply(C,A)))),
inference(flip,[status(thm),theory(equality)],[73]),
[iquote('flip(73)')] ).
cnf(106,plain,
equal(multiply(A,multiply(A,multiply(B,multiply(B,multiply(A,multiply(A,multiply(B,B))))))),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[57,20]),
[iquote('para(57,20)')] ).
cnf(108,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,multiply(B,multiply(B,A)))))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,20]),4]),1]),
[iquote('para(37,20),demod([4]),flip(1)')] ).
cnf(112,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,multiply(B,multiply(B,multiply(A,C))))))),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[108,3]),3,3,3,3,3]),1]),
[iquote('para(108,3),demod([3,3,3,3,3]),flip(1)')] ).
cnf(118,plain,
equal(commutator(A,multiply(A,multiply(B,multiply(A,B)))),commutator(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,60]),3,3,71,3]),1]),
[iquote('para(20,60),demod([3,3,71,3]),flip(1)')] ).
cnf(119,plain,
equal(commutator(A,multiply(B,A)),commutator(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,32]),36]),1]),
[iquote('para(40,32),demod([36]),flip(1)')] ).
cnf(121,plain,
equal(commutator(multiply(A,B),B),commutator(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[68]),119]),
[iquote('back_demod(68),demod([119])')] ).
cnf(122,plain,
equal(commutator(A,multiply(B,multiply(C,A))),commutator(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[74]),121]),1]),
[iquote('back_demod(74),demod([121]),flip(1)')] ).
cnf(124,plain,
equal(commutator(multiply(A,multiply(A,B)),A),commutator(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,33]),3,71,3]),1]),
[iquote('para(40,33),demod([3,71,3]),flip(1)')] ).
cnf(149,plain,
equal(commutator(multiply(A,B),multiply(A,A)),commutator(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,122]),121]),1]),
[iquote('para(20,122),demod([121]),flip(1)')] ).
cnf(161,plain,
equal(commutator(multiply(A,A),multiply(A,B)),commutator(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,124]),1]),
[iquote('para(20,124),flip(1)')] ).
cnf(175,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,commutator(A,B))))),multiply(B,multiply(A,multiply(B,A)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,43]),4,121]),1]),
[iquote('para(7,43),demod([4,121]),flip(1)')] ).
cnf(176,plain,
equal(commutator(A,multiply(B,B)),commutator(multiply(A,B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,118]),3,3,20,161]),
[iquote('para(20,118),demod([3,3,20,161])')] ).
cnf(177,plain,
equal(commutator(multiply(A,B),A),commutator(A,multiply(B,B))),
inference(flip,[status(thm),theory(equality)],[176]),
[iquote('flip(176)')] ).
cnf(222,plain,
equal(commutator(multiply(A,A),B),commutator(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,177]),3,3,3,40,7,4,119]),
[iquote('para(40,177),demod([3,3,3,40,7,4,119])')] ).
cnf(223,plain,
equal(commutator(A,B),commutator(multiply(B,B),A)),
inference(flip,[status(thm),theory(equality)],[222]),
[iquote('flip(222)')] ).
cnf(230,plain,
~ equal(commutator(commutator(multiply(b,b),a),b),identity),
inference(para,[status(thm),theory(equality)],[223,8]),
[iquote('para(223,8)')] ).
cnf(276,plain,
equal(commutator(A,multiply(A,B)),commutator(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[223,149]),3,7,4]),
[iquote('para(223,149),demod([3,7,4])')] ).
cnf(487,plain,
equal(multiply(A,multiply(B,multiply(B,multiply(A,multiply(A,multiply(B,commutator(B,A))))))),commutator(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,60]),3,3,3,20,20,3,3,3,3,3,3,106,276]),
[iquote('para(28,60),demod([3,3,3,20,20,3,3,3,3,3,3,106,276])')] ).
cnf(491,plain,
equal(commutator(A,commutator(B,A)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,60]),36,3,34,3,34,112,175,40,7,4,7,3,34,487,276,276]),1]),
[iquote('para(29,60),demod([36,3,34,3,34,112,175,40,7,4,7,3,34,487,276,276]),flip(1)')] ).
cnf(502,plain,
equal(commutator(A,commutator(A,B)),identity),
inference(para,[status(thm),theory(equality)],[222,491]),
[iquote('para(222,491)')] ).
cnf(527,plain,
equal(commutator(commutator(multiply(A,A),B),A),identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[502,222]),1]),
[iquote('para(502,222),flip(1)')] ).
cnf(528,plain,
$false,
inference(conflict,[status(thm)],[527,230]),
[iquote('conflict(527,230)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP002-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.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 16:22:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.79/1.19 ----- EQP 0.9e, May 2009 -----
% 0.79/1.19 The job began on n011.cluster.edu, Mon Jun 13 16:22:34 2022
% 0.79/1.19 The command was "./eqp09e".
% 0.79/1.19
% 0.79/1.19 set(prolog_style_variables).
% 0.79/1.19 set(lrpo).
% 0.79/1.19 set(basic_paramod).
% 0.79/1.19 set(functional_subsume).
% 0.79/1.19 set(ordered_paramod).
% 0.79/1.19 set(prime_paramod).
% 0.79/1.19 set(para_pairs).
% 0.79/1.19 assign(pick_given_ratio,4).
% 0.79/1.19 clear(print_kept).
% 0.79/1.19 clear(print_new_demod).
% 0.79/1.19 clear(print_back_demod).
% 0.79/1.19 clear(print_given).
% 0.79/1.19 assign(max_mem,64000).
% 0.79/1.19 end_of_commands.
% 0.79/1.19
% 0.79/1.19 Usable:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Sos:
% 0.79/1.19 0 (wt=-1) [] multiply(identity,A) = A.
% 0.79/1.19 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.79/1.19 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.19 0 (wt=-1) [] multiply(A,identity) = A.
% 0.79/1.19 0 (wt=-1) [] multiply(A,inverse(A)) = identity.
% 0.79/1.19 0 (wt=-1) [] commutator(A,B) = multiply(A,multiply(B,multiply(inverse(A),inverse(B)))).
% 0.79/1.19 0 (wt=-1) [] multiply(A,multiply(A,A)) = identity.
% 0.79/1.19 0 (wt=-1) [] -(commutator(commutator(a,b),b) = identity).
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Demodulators:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Passive:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Starting to process input.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.79/1.19 1 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.79/1.19 2 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.19 3 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 4 (wt=5) [] multiply(A,identity) = A.
% 0.79/1.19 4 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.79/1.19 5 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 6 (wt=13) [flip(1)] multiply(A,multiply(B,multiply(inverse(A),inverse(B)))) = commutator(A,B).
% 0.79/1.19 6 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 7 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.79/1.19 7 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 8 (wt=7) [] -(commutator(commutator(a,b),b) = identity).
% 0.79/1.19 ---------------- PROOF FOUND ----------------
% 0.79/1.19 % SZS status Unsatisfiable
% 0.79/1.19
% 0.79/1.19
% 0.79/1.19 After processing input:
% 0.79/1.19
% 0.79/1.19 Usable:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Sos:
% 0.79/1.19 1 (wt=5) [] multiply(identity,A) = A.
% 0.79/1.19 4 (wt=5) [] multiply(A,identity) = A.
% 0.79/1.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.79/1.19 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.79/1.19 7 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.79/1.19 8 (wt=7) [] -(commutator(commutator(a,b),b) = identity).
% 0.79/1.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.19 6 (wt=13) [flip(1)] multiply(A,multiply(B,multiply(inverse(A),inverse(B)))) = commutator(A,B).
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Demodulators:
% 0.79/1.19 1 (wt=5) [] multiply(identity,A) = A.
% 0.79/1.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.79/1.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.19 4 (wt=5) [] multiply(A,identity) = A.
% 0.79/1.19 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.79/1.19 6 (wt=13) [flip(1)] multiply(A,multiply(B,multiply(inverse(A),inverse(B)))) = commutator(A,B).
% 0.79/1.19 7 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Passive:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 UNIT CONFLICT from 527 and 230 at 0.09 seconds.
% 0.79/1.19
% 0.79/1.19 ---------------- PROOF ----------------
% 0.79/1.19 % SZS output start Refutation
% See solution above
% 0.79/1.19 ------------ end of proof -------------
% 0.79/1.19
% 0.79/1.19
% 0.79/1.19 ------------- memory usage ------------
% 0.79/1.19 Memory dynamically allocated (tp_alloc): 1464.
% 0.79/1.19 type (bytes each) gets frees in use avail bytes
% 0.79/1.19 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.79/1.19 term ( 16) 126247 110398 15849 62 308.7 K
% 0.79/1.19 gen_ptr ( 8) 105654 12592 93062 58 727.5 K
% 0.79/1.19 context ( 808) 54447 54445 2 11 10.3 K
% 0.79/1.19 trail ( 12) 335823 335823 0 6 0.1 K
% 0.79/1.19 bt_node ( 68) 25498 25495 3 20 1.5 K
% 0.79/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.19 ac_match_free_vars_pos (4020)
% 0.79/1.19 0 0 0 0 0.0 K
% 0.79/1.19 discrim ( 12) 12512 1068 11444 0 134.1 K
% 0.79/1.19 flat ( 40) 245523 245523 0 111 4.3 K
% 0.79/1.19 discrim_pos ( 12) 7662 7662 0 1 0.0 K
% 0.79/1.19 fpa_head ( 12) 1175 0 1175 0 13.8 K
% 0.79/1.19 fpa_tree ( 28) 691 691 0 29 0.8 K
% 0.79/1.19 fpa_pos ( 36) 832 832 0 1 0.0 K
% 0.79/1.19 literal ( 12) 2517 1990 527 1 6.2 K
% 0.79/1.19 clause ( 24) 2517 1990 527 1 12.4 K
% 0.79/1.19 list ( 12) 364 308 56 3 0.7 K
% 0.79/1.19 list_pos ( 20) 2071 409 1662 0 32.5 K
% 0.79/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.19
% 0.79/1.19 -------------- statistics -------------
% 0.79/1.19 Clauses input 8
% 0.79/1.19 Usable input 0
% 0.79/1.19 Sos input 8
% 0.79/1.19 Demodulators input 0
% 0.79/1.19 Passive input 0
% 0.79/1.19
% 0.79/1.19 Processed BS (before search) 8
% 0.79/1.19 Forward subsumed BS 0
% 0.79/1.19 Kept BS 8
% 0.79/1.19 New demodulators BS 7
% 0.79/1.19 Back demodulated BS 0
% 0.79/1.19
% 0.79/1.19 Clauses or pairs given 2242
% 0.79/1.19 Clauses generated 1688
% 0.79/1.19 Forward subsumed 1169
% 0.79/1.19 Deleted by weight 0
% 0.79/1.19 Deleted by variable count 0
% 0.79/1.19 Kept 519
% 0.79/1.19 New demodulators 298
% 0.79/1.19 Back demodulated 86
% 0.79/1.19 Ordered paramod prunes 0
% 0.79/1.19 Basic paramod prunes 3522
% 0.79/1.19 Prime paramod prunes 511
% 0.79/1.19 Semantic prunes 0
% 0.79/1.19
% 0.79/1.19 Rewrite attmepts 30517
% 0.79/1.19 Rewrites 6902
% 0.79/1.19
% 0.79/1.19 FPA overloads 0
% 0.79/1.19 FPA underloads 0
% 0.79/1.19
% 0.79/1.19 Usable size 0
% 0.79/1.19 Sos size 440
% 0.79/1.19 Demodulators size 256
% 0.79/1.19 Passive size 0
% 0.79/1.19 Disabled size 86
% 0.79/1.19
% 0.79/1.19 Proofs found 1
% 0.79/1.19
% 0.79/1.19 ----------- times (seconds) ----------- Mon Jun 13 16:22:34 2022
% 0.79/1.19
% 0.79/1.19 user CPU time 0.09 (0 hr, 0 min, 0 sec)
% 0.79/1.19 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.79/1.19 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.19 input time 0.00
% 0.79/1.19 paramodulation time 0.01
% 0.79/1.19 demodulation time 0.02
% 0.79/1.19 orient time 0.00
% 0.79/1.19 weigh time 0.00
% 0.79/1.19 forward subsume time 0.00
% 0.79/1.19 back demod find time 0.02
% 0.79/1.19 conflict time 0.00
% 0.79/1.19 LRPO time 0.00
% 0.79/1.19 store clause time 0.01
% 0.79/1.19 disable clause time 0.00
% 0.79/1.19 prime paramod time 0.01
% 0.79/1.19 semantics time 0.00
% 0.79/1.19
% 0.79/1.19 EQP interrupted
%------------------------------------------------------------------------------