TSTP Solution File: BOO008-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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:04 EDT 2022
% Result : Unsatisfiable 11.56s 11.94s
% Output : Refutation 11.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 12
% Syntax : Number of clauses : 66 ( 66 unt; 0 nHn; 2 RR)
% Number of literals : 66 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 139 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO008-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO008-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('BOO008-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('BOO008-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('BOO008-2.p',unknown),
[] ).
cnf(12,plain,
equal(add(inverse(A),A),multiplicative_identity),
file('BOO008-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO008-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO008-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO008-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO008-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO008-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO008-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(add(add(a,b),c),add(a,add(b,c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(55,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(56,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(60,plain,
equal(add(multiply(A,inverse(B)),multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,8]),15]),1]),
[iquote('para(12,8),demod([15]),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,56]),1]),
[iquote('para(13,10),demod([17,56]),flip(1)')] ).
cnf(73,plain,
equal(add(A,multiply(inverse(B),inverse(B))),add(multiply(A,B),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,9]),56,18]),
[iquote('para(14,9),demod([56,18])')] ).
cnf(74,plain,
equal(add(multiply(A,B),inverse(B)),add(A,multiply(inverse(B),inverse(B)))),
inference(flip,[status(thm),theory(equality)],[73]),
[iquote('flip(73)')] ).
cnf(75,plain,
equal(add(multiply(inverse(A),inverse(A)),B),add(inverse(A),multiply(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,10]),17,60]),
[iquote('para(14,10),demod([17,60])')] ).
cnf(76,plain,
equal(add(inverse(A),multiply(B,A)),add(multiply(inverse(A),inverse(A)),B)),
inference(flip,[status(thm),theory(equality)],[75]),
[iquote('flip(75)')] ).
cnf(92,plain,
equal(multiply(inverse(A),inverse(A)),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,55]),18]),
[iquote('para(13,55),demod([18])')] ).
cnf(93,plain,
equal(add(inverse(A),multiply(B,A)),add(inverse(A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[76]),92]),
[iquote('back_demod(76),demod([92])')] ).
cnf(94,plain,
equal(add(multiply(A,B),inverse(B)),add(A,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[74]),92]),
[iquote('back_demod(74),demod([92])')] ).
cnf(97,plain,
equal(multiply(A,inverse(inverse(A))),inverse(inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,55]),17]),
[iquote('para(13,55),demod([17])')] ).
cnf(98,plain,
equal(multiply(inverse(inverse(A)),A),inverse(inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[97,2]),1]),
[iquote('para(97,2),flip(1)')] ).
cnf(113,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,55]),98,18]),
[iquote('para(14,55),demod([98,18])')] ).
cnf(114,plain,
equal(multiply(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[98]),113,113]),
[iquote('back_demod(98),demod([113,113])')] ).
cnf(126,plain,
equal(add(A,multiply(B,inverse(A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),114]),
[iquote('back_demod(66),demod([114])')] ).
cnf(157,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,126]),11]),1]),
[iquote('para(16,126),demod([11]),flip(1)')] ).
cnf(232,plain,
equal(add(multiply(multiply(A,B),C),multiply(multiply(inverse(A),B),C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[55,5]),1]),
[iquote('para(55,5),flip(1)')] ).
cnf(287,plain,
equal(add(inverse(A),add(multiply(B,A),multiply(C,A))),add(inverse(A),add(B,C))),
inference(para,[status(thm),theory(equality)],[5,93]),
[iquote('para(5,93)')] ).
cnf(292,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)],[157,5]),16,16]),1]),
[iquote('para(157,5),demod([16,16]),flip(1)')] ).
cnf(299,plain,
equal(add(A,multiply(B,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[292,1]),1]),
[iquote('para(292,1),flip(1)')] ).
cnf(464,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)],[292,5]),1]),
[iquote('para(292,5),flip(1)')] ).
cnf(495,plain,
equal(multiply(A,multiply(B,A)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[114,464]),299]),1]),
[iquote('para(114,464),demod([299]),flip(1)')] ).
cnf(497,plain,
equal(multiply(multiply(A,B),B),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[495,2]),1]),
[iquote('para(495,2),flip(1)')] ).
cnf(507,plain,
equal(multiply(multiply(A,B),inverse(B)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,464]),17,13]),
[iquote('para(13,464),demod([17,13])')] ).
cnf(508,plain,
equal(multiply(multiply(A,inverse(B)),B),additive_identity),
inference(para,[status(thm),theory(equality)],[113,507]),
[iquote('para(113,507)')] ).
cnf(561,plain,
equal(multiply(inverse(multiply(A,B)),inverse(B)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[507,55]),18]),
[iquote('para(507,55),demod([18])')] ).
cnf(570,plain,
equal(multiply(inverse(multiply(A,inverse(B))),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[113,561]),113]),
[iquote('para(113,561),demod([113])')] ).
cnf(583,plain,
equal(multiply(A,inverse(multiply(B,inverse(A)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[570,2]),1]),
[iquote('para(570,2),flip(1)')] ).
cnf(601,plain,
equal(multiply(inverse(A),inverse(multiply(B,A))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[561,2]),1]),
[iquote('para(561,2),flip(1)')] ).
cnf(1459,plain,
equal(multiply(multiply(A,multiply(B,C)),inverse(C)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[507,464]),17,507]),
[iquote('para(507,464),demod([17,507])')] ).
cnf(1589,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(B))),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[583,1459]),113]),
[iquote('para(583,1459),demod([113])')] ).
cnf(1615,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(A))),additive_identity),
inference(para,[status(thm),theory(equality)],[2,1589]),
[iquote('para(2,1589)')] ).
cnf(1647,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),additive_identity),
inference(para,[status(thm),theory(equality)],[2,1615]),
[iquote('para(2,1615)')] ).
cnf(2357,plain,
equal(multiply(multiply(A,B),inverse(multiply(inverse(A),C))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1647,56]),18]),
[iquote('para(1647,56),demod([18])')] ).
cnf(2358,plain,
equal(multiply(multiply(inverse(A),B),inverse(multiply(A,C))),multiply(inverse(A),B)),
inference(para,[status(thm),theory(equality)],[113,2357]),
[iquote('para(113,2357)')] ).
cnf(3286,plain,
equal(multiply(A,inverse(multiply(B,A))),multiply(inverse(B),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,232]),2358,18]),1]),
[iquote('para(13,232),demod([2358,18]),flip(1)')] ).
cnf(3296,plain,
equal(inverse(multiply(A,B)),add(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3286,55]),601,94]),1]),
[iquote('para(3286,55),demod([601,94]),flip(1)')] ).
cnf(4044,plain,
equal(add(inverse(A),add(multiply(B,A),multiply(A,C))),add(inverse(A),add(B,C))),
inference(para,[status(thm),theory(equality)],[2,287]),
[iquote('para(2,287)')] ).
cnf(22971,plain,
equal(add(inverse(A),add(multiply(B,A),C)),add(inverse(A),add(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[497,287]),287]),1]),
[iquote('para(497,287),demod([287]),flip(1)')] ).
cnf(22973,plain,
equal(add(inverse(A),add(B,multiply(A,C))),add(inverse(A),add(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4044]),22971]),
[iquote('back_demod(4044),demod([22971])')] ).
cnf(23550,plain,
equal(add(add(inverse(A),B),add(C,B)),add(add(inverse(A),B),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[508,22973]),3296,113,17,3296,113]),1]),
[iquote('para(508,22973),demod([3296,113,17,3296,113]),flip(1)')] ).
cnf(23567,plain,
equal(add(add(A,B),add(C,B)),add(add(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[113,23550]),113]),
[iquote('para(113,23550),demod([113])')] ).
cnf(23596,plain,
equal(add(add(A,B),C),add(add(C,B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23567,1]),23567]),
[iquote('para(23567,1),demod([23567])')] ).
cnf(23629,plain,
equal(add(add(A,B),C),add(add(C,A),B)),
inference(para,[status(thm),theory(equality)],[1,23596]),
[iquote('para(1,23596)')] ).
cnf(23692,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(para,[status(thm),theory(equality)],[23629,1]),
[iquote('para(23629,1)')] ).
cnf(23693,plain,
$false,
inference(conflict,[status(thm)],[23692,19]),
[iquote('conflict(23692,19)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : BOO008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 17:14:30 EDT 2022
% 0.13/0.33 % CPUTime :
% 11.56/11.94 ----- EQP 0.9e, May 2009 -----
% 11.56/11.94 The job began on n029.cluster.edu, Wed Jun 1 17:14:31 2022
% 11.56/11.94 The command was "./eqp09e".
% 11.56/11.94
% 11.56/11.94 set(prolog_style_variables).
% 11.56/11.94 set(lrpo).
% 11.56/11.94 set(basic_paramod).
% 11.56/11.94 set(functional_subsume).
% 11.56/11.94 set(ordered_paramod).
% 11.56/11.94 set(prime_paramod).
% 11.56/11.94 set(para_pairs).
% 11.56/11.94 assign(pick_given_ratio,4).
% 11.56/11.94 clear(print_kept).
% 11.56/11.94 clear(print_new_demod).
% 11.56/11.94 clear(print_back_demod).
% 11.56/11.94 clear(print_given).
% 11.56/11.94 assign(max_mem,64000).
% 11.56/11.94 end_of_commands.
% 11.56/11.94
% 11.56/11.94 Usable:
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Sos:
% 11.56/11.94 0 (wt=-1) [] add(A,B) = add(B,A).
% 11.56/11.94 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 11.56/11.94 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 11.56/11.94 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 11.56/11.94 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 11.56/11.94 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 11.56/11.94 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 11.56/11.94 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 11.56/11.94 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 11.56/11.94 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 11.56/11.94 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 11.56/11.94 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 11.56/11.94 0 (wt=-1) [] add(A,additive_identity) = A.
% 11.56/11.94 0 (wt=-1) [] add(additive_identity,A) = A.
% 11.56/11.94 0 (wt=-1) [] -(add(a,add(b,c)) = add(add(a,b),c)).
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Demodulators:
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Passive:
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Starting to process input.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 11.56/11.94 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 11.56/11.94
% 11.56/11.94 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 11.56/11.94 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 11.56/11.94
% 11.56/11.94 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 11.56/11.94 3 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 11.56/11.94 4 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 11.56/11.94 5 is a new demodulator.
% 11.56/11.94 -> 5 back demodulating 4.
% 11.56/11.94
% 11.56/11.94 ** 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)).
% 11.56/11.94 6 is a new demodulator.
% 11.56/11.94 -> 5 back demodulating 3.
% 11.56/11.94
% 11.56/11.94 ** 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).
% 11.56/11.94 7 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 11.56/11.94 8 is a new demodulator.
% 11.56/11.94 -> 8 back demodulating 7.
% 11.56/11.94
% 11.56/11.94 ** 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).
% 11.56/11.94 9 is a new demodulator.
% 11.56/11.94 -> 8 back demodulating 6.
% 11.56/11.94
% 11.56/11.94 ** 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)).
% 11.56/11.94 10 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 11.56/11.94 11 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 11.56/11.94 12 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 11.56/11.94 13 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 11.56/11.94 14 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 11.56/11.94 15 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 11.56/11.94 16 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 11.56/11.94 17 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 11.56/11.94 18 is a new demodulator.
% 11.56/11.94
% 11.56/11.94 ** KEPT: 19 (wt=11) [flip(1)] -(add(add(a,b),c) = add(a,add(b,c))).
% 11.56/11.94 ---------------- PROOF FOUND ----------------
% 11.56/11.94 % SZS status Unsatisfiable
% 11.56/11.94
% 11.56/11.94
% 11.56/11.94 After processing input:
% 11.56/11.94
% 11.56/11.94 Usable:
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Sos:
% 11.56/11.94 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 11.56/11.94 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 11.56/11.94 17 (wt=5) [] add(A,additive_identity) = A.
% 11.56/11.94 18 (wt=5) [] add(additive_identity,A) = A.
% 11.56/11.94 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 11.56/11.94 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 11.56/11.94 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 11.56/11.94 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 11.56/11.94 1 (wt=7) [] add(A,B) = add(B,A).
% 11.56/11.94 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 11.56/11.94 19 (wt=11) [flip(1)] -(add(add(a,b),c) = add(a,add(b,c))).
% 11.56/11.94 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 11.56/11.94 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 11.56/11.94 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).
% 11.56/11.94 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)).
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Demodulators:
% 11.56/11.94 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 11.56/11.94 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 11.56/11.94 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).
% 11.56/11.94 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)).
% 11.56/11.94 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 11.56/11.94 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 11.56/11.94 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 11.56/11.94 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 11.56/11.94 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 11.56/11.94 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 11.56/11.94 17 (wt=5) [] add(A,additive_identity) = A.
% 11.56/11.94 18 (wt=5) [] add(additive_identity,A) = A.
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 Passive:
% 11.56/11.94 end_of_list.
% 11.56/11.94
% 11.56/11.94 UNIT CONFLICT from 23692 and 19 at 8.69 seconds.
% 11.56/11.94
% 11.56/11.94 ---------------- PROOF ----------------
% 11.56/11.94 % SZS output start Refutation
% See solution above
% 11.56/11.94 ------------ end of proof -------------
% 11.56/11.94
% 11.56/11.94
% 11.56/11.94 ------------- memory usage ------------
% 11.56/11.94 Memory dynamically allocated (tp_alloc): 57128.
% 11.56/11.94 type (bytes each) gets frees in use avail bytes
% 11.56/11.94 sym_ent ( 96) 59 0 59 0 5.5 K
% 11.56/11.94 term ( 16) 6613184 5707915 905269 25 17589.0 K
% 11.56/11.94 gen_ptr ( 8) 5245450 1193069 4052381 65 31659.7 K
% 11.56/11.94 context ( 808) 5140331 5140329 2 6 6.3 K
% 11.56/11.94 trail ( 12) 3620340 3620340 0 7 0.1 K
% 11.56/11.94 bt_node ( 68) 2193072 2193069 3 24 1.8 K
% 11.56/11.94 ac_position (285432) 0 0 0 0 0.0 K
% 11.56/11.94 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.56/11.94 ac_match_free_vars_pos (4020)
% 11.56/11.94 0 0 0 0 0.0 K
% 11.56/11.94 discrim ( 12) 445339 35680 409659 0 4800.7 K
% 11.56/11.95 flat ( 40) 14358867 14358867 0 95 3.7 K
% 11.56/11.95 discrim_pos ( 12) 476055 476055 0 1 0.0 K
% 11.56/11.95 fpa_head ( 12) 5577 0 5577 0 65.4 K
% 11.56/11.95 fpa_tree ( 28) 51881 51881 0 25 0.7 K
% 11.56/11.95 fpa_pos ( 36) 31471 31471 0 1 0.0 K
% 11.56/11.95 literal ( 12) 229265 205573 23692 1 277.7 K
% 11.56/11.95 clause ( 24) 229265 205573 23692 1 555.3 K
% 11.56/11.95 list ( 12) 7838 7782 56 5 0.7 K
% 11.56/11.95 list_pos ( 20) 84256 12624 71632 0 1399.1 K
% 11.56/11.95 pair_index ( 40) 2 0 2 0 0.1 K
% 11.56/11.95
% 11.56/11.95 -------------- statistics -------------
% 11.56/11.95 Clauses input 15
% 11.56/11.95 Usable input 0
% 11.56/11.95 Sos input 15
% 11.56/11.95 Demodulators input 0
% 11.56/11.95 Passive input 0
% 11.56/11.95
% 11.56/11.95 Processed BS (before search) 21
% 11.56/11.95 Forward subsumed BS 2
% 11.56/11.95 Kept BS 19
% 11.56/11.95 New demodulators BS 16
% 11.56/11.95 Back demodulated BS 4
% 11.56/11.95
% 11.56/11.95 Clauses or pairs given 202159
% 11.56/11.95 Clauses generated 168950
% 11.56/11.95 Forward subsumed 145277
% 11.56/11.95 Deleted by weight 0
% 11.56/11.95 Deleted by variable count 0
% 11.56/11.95 Kept 23673
% 11.56/11.95 New demodulators 7763
% 11.56/11.95 Back demodulated 2660
% 11.56/11.95 Ordered paramod prunes 0
% 11.56/11.95 Basic paramod prunes 595276
% 11.56/11.95 Prime paramod prunes 24726
% 11.56/11.95 Semantic prunes 0
% 11.56/11.95
% 11.56/11.95 Rewrite attmepts 2498691
% 11.56/11.95 Rewrites 422779
% 11.56/11.95
% 11.56/11.95 FPA overloads 0
% 11.56/11.95 FPA underloads 0
% 11.56/11.95
% 11.56/11.95 Usable size 0
% 11.56/11.95 Sos size 21027
% 11.56/11.95 Demodulators size 5887
% 11.56/11.95 Passive size 0
% 11.56/11.95 Disabled size 2664
% 11.56/11.95
% 11.56/11.95 Proofs found 1
% 11.56/11.95
% 11.56/11.95 ----------- times (seconds) ----------- Wed Jun 1 17:14:42 2022
% 11.56/11.95
% 11.56/11.95 user CPU time 8.69 (0 hr, 0 min, 8 sec)
% 11.56/11.95 system CPU time 2.19 (0 hr, 0 min, 2 sec)
% 11.56/11.95 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.56/11.95 input time 0.00
% 11.56/11.95 paramodulation time 0.77
% 11.56/11.95 demodulation time 0.66
% 11.56/11.95 orient time 0.35
% 11.56/11.95 weigh time 0.07
% 11.56/11.95 forward subsume time 0.25
% 11.56/11.95 back demod find time 2.47
% 11.56/11.95 conflict time 0.02
% 11.56/11.95 LRPO time 0.16
% 11.56/11.95 store clause time 3.09
% 11.56/11.95 disable clause time 0.35
% 11.56/11.95 prime paramod time 0.23
% 11.56/11.95 semantics time 0.00
% 11.56/11.95
% 11.56/11.95 EQP interrupted
%------------------------------------------------------------------------------