%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO031-1 : TPTP v8.1.0. Released v2.2.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 : Thu Jul 14 23:37:31 EDT 2022
% Result : Unsatisfiable 4.85s 5.23s
% Output : Refutation 4.85s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(add(A,B),multiply(add(B,C),add(C,A))),add(multiply(A,B),add(multiply(B,C),multiply(C,A)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(2,plain,
equal(add(A,multiply(B,multiply(A,C))),A),
file('BOO031-1.p',unknown),
[] ).
cnf(3,plain,
equal(add(add(multiply(A,B),multiply(B,C)),B),B),
file('BOO031-1.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(add(A,inverse(A)),B),B),
file('BOO031-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(A,add(B,add(A,C))),A),
file('BOO031-1.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(multiply(add(A,B),add(B,C)),B),B),
file('BOO031-1.p',unknown),
[] ).
cnf(7,plain,
equal(add(multiply(A,inverse(A)),B),B),
file('BOO031-1.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),n1),
file('BOO031-1.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(n1,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),8]),
[iquote('back_demod(4),demod([8])')] ).
cnf(10,plain,
equal(multiply(A,inverse(A)),n0),
file('BOO031-1.p',unknown),
[] ).
cnf(11,plain,
equal(add(n0,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),10]),
[iquote('back_demod(7),demod([10])')] ).
cnf(12,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('BOO031-1.p',unknown),
[] ).
cnf(13,plain,
equal(add(multiply(A,B),add(multiply(B,C),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),12]),
[iquote('back_demod(3),demod([12])')] ).
cnf(14,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('BOO031-1.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(add(A,B),multiply(add(B,C),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),14]),
[iquote('back_demod(6),demod([14])')] ).
cnf(16,plain,
~ equal(add(multiply(b,a),multiply(c,a)),multiply(a,add(b,c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(22,plain,
equal(add(A,add(B,multiply(C,add(multiply(A,B),add(multiply(B,D),multiply(D,A)))))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),12]),
[iquote('para(1,2),demod([12])')] ).
cnf(23,plain,
equal(add(A,add(B,add(multiply(C,A),add(multiply(A,B),multiply(B,C))))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),12]),
[iquote('para(1,2),demod([12])')] ).
cnf(26,plain,
equal(add(A,multiply(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(27,plain,
equal(multiply(A,add(B,A)),A),
inference(para,[status(thm),theory(equality)],[2,5]),
[iquote('para(2,5)')] ).
cnf(34,plain,
equal(add(A,A),A),
inference(para,[status(thm),theory(equality)],[9,26]),
[iquote('para(9,26)')] ).
cnf(36,plain,
equal(add(A,multiply(A,B)),A),
inference(para,[status(thm),theory(equality)],[9,2]),
[iquote('para(9,2)')] ).
cnf(38,plain,
equal(add(A,multiply(B,n0)),A),
inference(para,[status(thm),theory(equality)],[10,2]),
[iquote('para(10,2)')] ).
cnf(39,plain,
equal(multiply(A,n0),n0),
inference(para,[status(thm),theory(equality)],[11,26]),
[iquote('para(11,26)')] ).
cnf(40,plain,
equal(add(A,n0),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),39]),
[iquote('back_demod(38),demod([39])')] ).
cnf(43,plain,
equal(multiply(A,multiply(B,add(B,A))),add(multiply(n0,B),multiply(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,1]),40,39,11]),
[iquote('para(11,1),demod([40,39,11])')] ).
cnf(44,plain,
equal(add(multiply(n0,A),multiply(A,B)),multiply(B,multiply(A,add(A,B)))),
inference(flip,[status(thm),theory(equality)],[43]),
[iquote('flip(43)')] ).
cnf(48,plain,
equal(multiply(A,add(A,B)),A),
inference(para,[status(thm),theory(equality)],[11,5]),
[iquote('para(11,5)')] ).
cnf(49,plain,
equal(add(multiply(n0,A),multiply(A,B)),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),48]),
[iquote('back_demod(44),demod([48])')] ).
cnf(50,plain,
equal(multiply(A,B),add(multiply(n0,B),multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[49]),
[iquote('flip(49)')] ).
cnf(55,plain,
equal(add(A,add(multiply(B,multiply(A,C)),D)),add(A,D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,12]),1]),
[iquote('para(2,12),flip(1)')] ).
cnf(62,plain,
equal(multiply(A,multiply(add(multiply(A,B),add(A,C)),add(C,multiply(D,A)))),add(multiply(D,A),add(multiply(add(multiply(A,B),A),C),multiply(C,multiply(D,A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,1]),12,14,27]),
[iquote('para(13,1),demod([12,14,27])')] ).
cnf(68,plain,
equal(multiply(A,A),A),
inference(para,[status(thm),theory(equality)],[11,27]),
[iquote('para(11,27)')] ).
cnf(69,plain,
equal(multiply(A,multiply(B,A)),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),14]),
[iquote('para(13,5),demod([14])')] ).
cnf(71,plain,
equal(add(multiply(A,B),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,13]),34]),
[iquote('para(5,13),demod([34])')] ).
cnf(79,plain,
equal(multiply(n0,A),n0),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,11]),1]),
[iquote('para(36,11),flip(1)')] ).
cnf(80,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[50]),79,11]),
[iquote('back_demod(50),demod([79,11])')] ).
cnf(82,plain,
equal(multiply(add(multiply(A,B),add(multiply(B,C),multiply(C,A))),D),multiply(add(A,B),multiply(add(B,C),multiply(add(C,A),D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,14]),14]),
[iquote('para(1,14),demod([14])')] ).
cnf(86,plain,
equal(multiply(A,multiply(add(B,add(A,C)),D)),multiply(A,D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,14]),1]),
[iquote('para(5,14),flip(1)')] ).
cnf(87,plain,
equal(multiply(A,add(B,multiply(C,A))),add(multiply(C,A),add(multiply(add(multiply(A,D),A),B),multiply(B,multiply(C,A))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[62]),86]),
[iquote('back_demod(62),demod([86])')] ).
cnf(88,plain,
equal(add(multiply(A,B),add(multiply(add(multiply(B,C),B),D),multiply(D,multiply(A,B)))),multiply(B,add(D,multiply(A,B)))),
inference(flip,[status(thm),theory(equality)],[87]),
[iquote('flip(87)')] ).
cnf(91,plain,
equal(add(multiply(A,multiply(B,C)),add(multiply(C,D),C)),C),
inference(para,[status(thm),theory(equality)],[14,13]),
[iquote('para(14,13)')] ).
cnf(92,plain,
equal(add(multiply(A,multiply(B,C)),add(multiply(B,multiply(C,D)),multiply(B,C))),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[14,13]),
[iquote('para(14,13)')] ).
cnf(95,plain,
equal(multiply(A,multiply(add(multiply(B,multiply(A,C)),D),multiply(B,multiply(A,C)))),multiply(B,multiply(A,C))),
inference(para,[status(thm),theory(equality)],[2,15]),
[iquote('para(2,15)')] ).
cnf(96,plain,
equal(multiply(add(A,B),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,15]),68]),
[iquote('para(2,15),demod([68])')] ).
cnf(99,plain,
equal(multiply(add(A,add(B,C)),multiply(add(C,D),C)),C),
inference(para,[status(thm),theory(equality)],[12,15]),
[iquote('para(12,15)')] ).
cnf(101,plain,
equal(multiply(add(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,13]),14,55,26]),1]),
[iquote('para(15,13),demod([14,55,26]),flip(1)')] ).
cnf(102,plain,
equal(multiply(add(A,add(B,C)),C),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[99]),101]),
[iquote('back_demod(99),demod([101])')] ).
cnf(103,plain,
equal(multiply(A,multiply(B,multiply(A,C))),multiply(B,multiply(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[95]),101]),
[iquote('back_demod(95),demod([101])')] ).
cnf(109,plain,
equal(add(multiply(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,15]),12,86,27]),1]),
[iquote('para(13,15),demod([12,86,27]),flip(1)')] ).
cnf(110,plain,
equal(add(multiply(A,multiply(B,C)),C),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[91]),109]),
[iquote('back_demod(91),demod([109])')] ).
cnf(111,plain,
equal(add(multiply(A,B),add(multiply(B,C),multiply(C,multiply(A,B)))),multiply(B,add(C,multiply(A,B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[88]),109]),
[iquote('back_demod(88),demod([109])')] ).
cnf(112,plain,
equal(multiply(A,add(B,multiply(C,A))),add(multiply(C,A),add(multiply(A,B),multiply(B,multiply(C,A))))),
inference(flip,[status(thm),theory(equality)],[111]),
[iquote('flip(111)')] ).
cnf(129,plain,
equal(add(A,add(B,add(multiply(A,B),add(multiply(B,C),multiply(C,A))))),add(A,B)),
inference(para,[status(thm),theory(equality)],[9,22]),
[iquote('para(9,22)')] ).
cnf(159,plain,
equal(multiply(A,multiply(A,B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[36,96]),
[iquote('para(36,96)')] ).
cnf(163,plain,
equal(multiply(add(multiply(A,B),C),B),add(multiply(A,multiply(B,C)),add(multiply(C,B),multiply(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,1]),96,14,69]),
[iquote('para(26,1),demod([96,14,69])')] ).
cnf(165,plain,
equal(add(A,add(multiply(B,A),C)),add(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,12]),1]),
[iquote('para(26,12),flip(1)')] ).
cnf(166,plain,
equal(add(A,add(B,add(multiply(B,C),multiply(C,A)))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[129]),165]),
[iquote('back_demod(129),demod([165])')] ).
cnf(168,plain,
equal(add(A,multiply(B,multiply(C,A))),A),
inference(para,[status(thm),theory(equality)],[14,26]),
[iquote('para(14,26)')] ).
cnf(169,plain,
equal(multiply(A,add(B,add(C,A))),A),
inference(para,[status(thm),theory(equality)],[12,27]),
[iquote('para(12,27)')] ).
cnf(171,plain,
equal(multiply(A,multiply(B,add(C,multiply(A,B)))),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,14]),1]),
[iquote('para(27,14),flip(1)')] ).
cnf(249,plain,
equal(multiply(add(multiply(A,B),C),A),add(multiply(A,multiply(B,C)),add(multiply(C,A),multiply(A,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,1]),96,14,159]),
[iquote('para(36,1),demod([96,14,159])')] ).
cnf(250,plain,
equal(add(A,add(multiply(A,B),C)),add(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,12]),1]),
[iquote('para(36,12),flip(1)')] ).
cnf(252,plain,
equal(add(A,add(B,multiply(C,A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[166]),250]),
[iquote('back_demod(166),demod([250])')] ).
cnf(256,plain,
equal(multiply(A,add(B,multiply(C,A))),add(multiply(C,A),multiply(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[112]),252]),
[iquote('back_demod(112),demod([252])')] ).
cnf(257,plain,
equal(multiply(A,add(multiply(A,B),multiply(B,C))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[171]),256]),
[iquote('back_demod(171),demod([256])')] ).
cnf(284,plain,
equal(multiply(A,multiply(add(A,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,14]),1]),
[iquote('para(48,14),flip(1)')] ).
cnf(289,plain,
equal(add(A,add(B,add(C,A))),add(A,add(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,23]),252,252,12,12]),
[iquote('para(48,23),demod([252,252,12,12])')] ).
cnf(359,plain,
equal(multiply(add(A,B),multiply(C,B)),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[26,102]),
[iquote('para(26,102)')] ).
cnf(365,plain,
equal(multiply(add(A,B),multiply(B,C)),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[36,102]),
[iquote('para(36,102)')] ).
cnf(392,plain,
equal(add(multiply(A,B),add(C,B)),add(C,B)),
inference(para,[status(thm),theory(equality)],[27,110]),
[iquote('para(27,110)')] ).
cnf(393,plain,
equal(add(multiply(A,multiply(B,C)),multiply(A,B)),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[92]),392]),
[iquote('back_demod(92),demod([392])')] ).
cnf(395,plain,
equal(add(multiply(A,B),add(B,C)),add(B,C)),
inference(para,[status(thm),theory(equality)],[48,110]),
[iquote('para(48,110)')] ).
cnf(444,plain,
equal(multiply(A,multiply(B,multiply(C,A))),multiply(B,multiply(C,A))),
inference(para,[status(thm),theory(equality)],[168,96]),
[iquote('para(168,96)')] ).
cnf(445,plain,
equal(add(A,add(B,C)),add(B,add(C,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[169,71]),289]),
[iquote('para(169,71),demod([289])')] ).
cnf(577,plain,
equal(multiply(A,multiply(B,C)),multiply(C,multiply(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[69,14]),14,444,103]),
[iquote('para(69,14),demod([14,444,103])')] ).
cnf(916,plain,
equal(multiply(add(A,add(B,C)),multiply(D,B)),multiply(B,D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[86,80]),14]),1]),
[iquote('para(86,80),demod([14]),flip(1)')] ).
cnf(925,plain,
equal(multiply(add(A,B),multiply(C,A)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[284,80]),14]),1]),
[iquote('para(284,80),demod([14]),flip(1)')] ).
cnf(952,plain,
equal(add(multiply(A,multiply(B,C)),multiply(C,A)),multiply(C,A)),
inference(para,[status(thm),theory(equality)],[577,71]),
[iquote('para(577,71)')] ).
cnf(4066,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,82]),257,249,159,14,952,393,395,925,365]),1]),
[iquote('para(163,82),demod([257,249,159,14,952,393,395,925,365]),flip(1)')] ).
cnf(7168,plain,
~ equal(add(multiply(b,a),multiply(c,a)),add(multiply(a,b),multiply(a,c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),4066]),
[iquote('back_demod(16),demod([4066])')] ).
cnf(8163,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)],[445,359]),4066,4066,925,916,4066]),
[iquote('para(445,359),demod([4066,4066,925,916,4066])')] ).
cnf(8164,plain,
$false,
inference(conflict,[status(thm)],[8163,7168]),
[iquote('conflict(8163,7168)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : BOO031-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n023.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 23:07:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.85/5.23 ----- EQP 0.9e, May 2009 -----
% 4.85/5.23 The job began on n023.cluster.edu, Wed Jun 1 23:07:41 2022
% 4.85/5.23 The command was "./eqp09e".
% 4.85/5.23
% 4.85/5.23 set(prolog_style_variables).
% 4.85/5.23 set(lrpo).
% 4.85/5.23 set(basic_paramod).
% 4.85/5.23 set(functional_subsume).
% 4.85/5.23 set(ordered_paramod).
% 4.85/5.23 set(prime_paramod).
% 4.85/5.23 set(para_pairs).
% 4.85/5.23 assign(pick_given_ratio,4).
% 4.85/5.23 clear(print_kept).
% 4.85/5.23 clear(print_new_demod).
% 4.85/5.23 clear(print_back_demod).
% 4.85/5.23 clear(print_given).
% 4.85/5.23 assign(max_mem,64000).
% 4.85/5.23 end_of_commands.
% 4.85/5.23
% 4.85/5.23 Usable:
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Sos:
% 4.85/5.23 0 (wt=-1) [] add(multiply(A,B),add(multiply(B,C),multiply(C,A))) = multiply(add(A,B),multiply(add(B,C),add(C,A))).
% 4.85/5.23 0 (wt=-1) [] add(A,multiply(B,multiply(A,C))) = A.
% 4.85/5.23 0 (wt=-1) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 4.85/5.23 0 (wt=-1) [] multiply(add(A,inverse(A)),B) = B.
% 4.85/5.23 0 (wt=-1) [] multiply(A,add(B,add(A,C))) = A.
% 4.85/5.23 0 (wt=-1) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 4.85/5.23 0 (wt=-1) [] add(multiply(A,inverse(A)),B) = B.
% 4.85/5.23 0 (wt=-1) [] add(A,inverse(A)) = n1.
% 4.85/5.23 0 (wt=-1) [] multiply(A,inverse(A)) = n0.
% 4.85/5.23 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 4.85/5.23 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.85/5.23 0 (wt=-1) [] -(multiply(a,add(b,c)) = add(multiply(b,a),multiply(c,a))).
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Demodulators:
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Passive:
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Starting to process input.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 1 (wt=23) [flip(1)] multiply(add(A,B),multiply(add(B,C),add(C,A))) = add(multiply(A,B),add(multiply(B,C),multiply(C,A))).
% 4.85/5.23 1 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 2 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 4.85/5.23 2 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 3 (wt=11) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 4.85/5.23 3 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 4 (wt=8) [] multiply(add(A,inverse(A)),B) = B.
% 4.85/5.23 4 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 5 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 4.85/5.23 5 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 6 (wt=11) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 4.85/5.23 6 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 7 (wt=8) [] add(multiply(A,inverse(A)),B) = B.
% 4.85/5.23 7 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = n1.
% 4.85/5.23 8 is a new demodulator.
% 4.85/5.23 -> 8 back demodulating 4.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 9 (wt=5) [back_demod(4),demod([8])] multiply(n1,A) = A.
% 4.85/5.23 9 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 10 (wt=6) [] multiply(A,inverse(A)) = n0.
% 4.85/5.23 10 is a new demodulator.
% 4.85/5.23 -> 10 back demodulating 7.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 11 (wt=5) [back_demod(7),demod([10])] add(n0,A) = A.
% 4.85/5.23 11 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 4.85/5.23 12 is a new demodulator.
% 4.85/5.23 -> 12 back demodulating 3.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 13 (wt=11) [back_demod(3),demod([12])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 4.85/5.23 13 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 14 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.85/5.23 14 is a new demodulator.
% 4.85/5.23 -> 14 back demodulating 6.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 15 (wt=11) [back_demod(6),demod([14])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 4.85/5.23 15 is a new demodulator.
% 4.85/5.23
% 4.85/5.23 ** KEPT: 16 (wt=13) [flip(1)] -(add(multiply(b,a),multiply(c,a)) = multiply(a,add(b,c))).
% 4.85/5.23 ---------------- PROOF FOUND ----------------
% 4.85/5.23 % SZS status Unsatisfiable
% 4.85/5.23
% 4.85/5.23
% 4.85/5.23 After processing input:
% 4.85/5.23
% 4.85/5.23 Usable:
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Sos:
% 4.85/5.23 9 (wt=5) [back_demod(4),demod([8])] multiply(n1,A) = A.
% 4.85/5.23 11 (wt=5) [back_demod(7),demod([10])] add(n0,A) = A.
% 4.85/5.23 8 (wt=6) [] add(A,inverse(A)) = n1.
% 4.85/5.23 10 (wt=6) [] multiply(A,inverse(A)) = n0.
% 4.85/5.23 2 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 4.85/5.23 5 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 4.85/5.23 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 4.85/5.23 13 (wt=11) [back_demod(3),demod([12])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 4.85/5.23 14 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.85/5.23 15 (wt=11) [back_demod(6),demod([14])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 4.85/5.23 16 (wt=13) [flip(1)] -(add(multiply(b,a),multiply(c,a)) = multiply(a,add(b,c))).
% 4.85/5.23 1 (wt=23) [flip(1)] multiply(add(A,B),multiply(add(B,C),add(C,A))) = add(multiply(A,B),add(multiply(B,C),multiply(C,A))).
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Demodulators:
% 4.85/5.23 1 (wt=23) [flip(1)] multiply(add(A,B),multiply(add(B,C),add(C,A))) = add(multiply(A,B),add(multiply(B,C),multiply(C,A))).
% 4.85/5.23 2 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 4.85/5.23 5 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 4.85/5.23 8 (wt=6) [] add(A,inverse(A)) = n1.
% 4.85/5.23 9 (wt=5) [back_demod(4),demod([8])] multiply(n1,A) = A.
% 4.85/5.23 10 (wt=6) [] multiply(A,inverse(A)) = n0.
% 4.85/5.23 11 (wt=5) [back_demod(7),demod([10])] add(n0,A) = A.
% 4.85/5.23 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 4.85/5.23 13 (wt=11) [back_demod(3),demod([12])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 4.85/5.23 14 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.85/5.23 15 (wt=11) [back_demod(6),demod([14])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 Passive:
% 4.85/5.23 end_of_list.
% 4.85/5.23
% 4.85/5.23 UNIT CONFLICT from 8163 and 7168 at 3.85 seconds.
% 4.85/5.23
% 4.85/5.23 ---------------- PROOF ----------------
% 4.85/5.23 % SZS output start Refutation
% See solution above
% 4.85/5.23 ------------ end of proof -------------
% 4.85/5.23
% 4.85/5.23
% 4.85/5.23 ------------- memory usage ------------
% 4.85/5.23 Memory dynamically allocated (tp_alloc): 50292.
% 4.85/5.23 type (bytes each) gets frees in use avail bytes
% 4.85/5.23 sym_ent ( 96) 59 0 59 0 5.5 K
% 4.85/5.23 term ( 16) 3478431 2859959 618472 36 12048.3 K
% 4.85/5.23 gen_ptr ( 8) 4953528 751618 4201910 82 32828.1 K
% 4.85/5.23 context ( 808) 950156 950154 2 21 18.1 K
% 4.85/5.23 trail ( 12) 1739166 1739166 0 8 0.1 K
% 4.85/5.24 bt_node ( 68) 119210 119207 3 38 2.7 K
% 4.85/5.24 ac_position (285432) 0 0 0 0 0.0 K
% 4.85/5.24 ac_match_pos (14044) 0 0 0 0 0.0 K
% 4.85/5.24 ac_match_free_vars_pos (4020)
% 4.85/5.24 0 0 0 0 0.0 K
% 4.85/5.24 discrim ( 12) 694252 487814 206438 47652 2977.6 K
% 4.85/5.24 flat ( 40) 8328396 8328396 0 549 21.4 K
% 4.85/5.24 discrim_pos ( 12) 122220 122220 0 1 0.0 K
% 4.85/5.24 fpa_head ( 12) 25376 0 25376 0 297.4 K
% 4.85/5.24 fpa_tree ( 28) 61176 61176 0 71 1.9 K
% 4.85/5.24 fpa_pos ( 36) 14051 14051 0 1 0.0 K
% 4.85/5.24 literal ( 12) 38441 30278 8163 1 95.7 K
% 4.85/5.24 clause ( 24) 38441 30278 8163 1 191.3 K
% 4.85/5.24 list ( 12) 5947 5891 56 5 0.7 K
% 4.85/5.24 list_pos ( 20) 41578 26425 15153 566 307.0 K
% 4.85/5.24 pair_index ( 40) 2 0 2 0 0.1 K
% 4.85/5.24
% 4.85/5.24 -------------- statistics -------------
% 4.85/5.24 Clauses input 12
% 4.85/5.24 Usable input 0
% 4.85/5.24 Sos input 12
% 4.85/5.24 Demodulators input 0
% 4.85/5.24 Passive input 0
% 4.85/5.24
% 4.85/5.24 Processed BS (before search) 16
% 4.85/5.24 Forward subsumed BS 0
% 4.85/5.24 Kept BS 16
% 4.85/5.24 New demodulators BS 15
% 4.85/5.24 Back demodulated BS 4
% 4.85/5.24
% 4.85/5.24 Clauses or pairs given 16215
% 4.85/5.24 Clauses generated 19522
% 4.85/5.24 Forward subsumed 11375
% 4.85/5.24 Deleted by weight 0
% 4.85/5.24 Deleted by variable count 0
% 4.85/5.24 Kept 8147
% 4.85/5.24 New demodulators 5873
% 4.85/5.24 Back demodulated 5510
% 4.85/5.24 Ordered paramod prunes 0
% 4.85/5.24 Basic paramod prunes 40270
% 4.85/5.24 Prime paramod prunes 1408
% 4.85/5.24 Semantic prunes 0
% 4.85/5.24
% 4.85/5.24 Rewrite attmepts 745829
% 4.85/5.24 Rewrites 118198
% 4.85/5.24
% 4.85/5.24 FPA overloads 0
% 4.85/5.24 FPA underloads 0
% 4.85/5.24
% 4.85/5.24 Usable size 0
% 4.85/5.24 Sos size 2648
% 4.85/5.24 Demodulators size 1695
% 4.85/5.24 Passive size 0
% 4.85/5.24 Disabled size 5514
% 4.85/5.24
% 4.85/5.24 Proofs found 1
% 4.85/5.24
% 4.85/5.24 ----------- times (seconds) ----------- Wed Jun 1 23:07:46 2022
% 4.85/5.24
% 4.85/5.24 user CPU time 3.85 (0 hr, 0 min, 3 sec)
% 4.85/5.24 system CPU time 0.32 (0 hr, 0 min, 0 sec)
% 4.85/5.24 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 4.85/5.24 input time 0.00
% 4.85/5.24 paramodulation time 0.07
% 4.85/5.24 demodulation time 0.66
% 4.85/5.24 orient time 0.08
% 4.85/5.24 weigh time 0.02
% 4.85/5.24 forward subsume time 0.08
% 4.85/5.24 back demod find time 1.34
% 4.85/5.24 conflict time 0.01
% 4.85/5.24 LRPO time 0.05
% 4.85/5.24 store clause time 1.19
% 4.85/5.24 disable clause time 0.25
% 4.85/5.24 prime paramod time 0.03
% 4.85/5.24 semantics time 0.00
% 4.85/5.24
% 4.85/5.24 EQP interrupted
%------------------------------------------------------------------------------