%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO016-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:08 EDT 2022
% Result : Unsatisfiable 0.82s 1.20s
% Output : Refutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 16 RR)
% Number of literals : 46 ( 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 : 56 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO016-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO016-2.p',unknown),
[] ).
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('BOO016-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(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO016-2.p',unknown),
[] ).
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('BOO016-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO016-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO016-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO016-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO016-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO016-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO016-2.p',unknown),
[] ).
cnf(19,plain,
equal(multiply(x,y),z),
file('BOO016-2.p',unknown),
[] ).
cnf(20,plain,
~ equal(add(x,z),x),
file('BOO016-2.p',unknown),
[] ).
cnf(24,plain,
equal(add(add(multiply(A,B),multiply(C,B)),add(multiply(A,D),multiply(C,D))),add(add(multiply(A,B),multiply(A,D)),add(multiply(C,B),multiply(C,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,5]),5,5,8,8]),
[iquote('para(8,5),demod([5,5,8,8])')] ).
cnf(55,plain,
equal(multiply(y,x),z),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,2]),1]),
[iquote('para(19,2),flip(1)')] ).
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(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(77,plain,
equal(add(add(multiply(A,A),multiply(A,B)),multiply(inverse(A),B)),add(A,multiply(inverse(A),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,10]),18]),
[iquote('para(14,10),demod([18])')] ).
cnf(78,plain,
equal(add(add(multiply(A,A),multiply(A,B)),multiply(inverse(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,10]),17,14,17]),
[iquote('para(14,10),demod([17,14,17])')] ).
cnf(164,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(167,plain,
equal(add(add(multiply(A,B),multiply(A,C)),multiply(inverse(B),C)),add(multiply(A,B),add(multiply(A,C),multiply(inverse(B),C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,24]),17,14,18]),1]),
[iquote('para(14,24),demod([17,14,18]),flip(1)')] ).
cnf(168,plain,
equal(add(A,multiply(inverse(A),B)),add(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[77]),167,56]),1]),
[iquote('back_demod(77),demod([167,56]),flip(1)')] ).
cnf(206,plain,
equal(multiply(inverse(inverse(A)),A),inverse(inverse(A))),
inference(para,[status(thm),theory(equality)],[2,164]),
[iquote('para(2,164)')] ).
cnf(211,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,56]),206,18]),
[iquote('para(14,56),demod([206,18])')] ).
cnf(212,plain,
equal(multiply(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[206]),211,211]),
[iquote('back_demod(206),demod([211,211])')] ).
cnf(219,plain,
equal(add(A,multiply(inverse(A),B)),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[168]),212]),
[iquote('back_demod(168),demod([212])')] ).
cnf(232,plain,
equal(add(add(A,multiply(A,B)),multiply(inverse(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[78]),212]),
[iquote('back_demod(78),demod([212])')] ).
cnf(235,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]),212]),
[iquote('back_demod(68),demod([212])')] ).
cnf(271,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)],[15,219]),11]),1]),
[iquote('para(15,219),demod([11]),flip(1)')] ).
cnf(501,plain,
equal(add(add(x,z),multiply(inverse(y),x)),x),
inference(para,[status(thm),theory(equality)],[19,232]),
[iquote('para(19,232)')] ).
cnf(503,plain,
equal(add(add(z,x),multiply(inverse(y),x)),x),
inference(para,[status(thm),theory(equality)],[1,501]),
[iquote('para(1,501)')] ).
cnf(532,plain,
equal(add(add(z,x),multiply(x,inverse(y))),x),
inference(para,[status(thm),theory(equality)],[2,503]),
[iquote('para(2,503)')] ).
cnf(538,plain,
equal(add(multiply(x,inverse(y)),add(z,x)),x),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[532,1]),1]),
[iquote('para(532,1),flip(1)')] ).
cnf(595,plain,
equal(add(add(x,multiply(x,inverse(y))),z),x),
inference(para,[status(thm),theory(equality)],[55,235]),
[iquote('para(55,235)')] ).
cnf(597,plain,
equal(add(add(multiply(x,inverse(y)),x),z),x),
inference(para,[status(thm),theory(equality)],[1,595]),
[iquote('para(1,595)')] ).
cnf(603,plain,
equal(add(add(x,multiply(inverse(y),x)),z),x),
inference(para,[status(thm),theory(equality)],[2,595]),
[iquote('para(2,595)')] ).
cnf(606,plain,
equal(add(add(multiply(inverse(y),x),x),z),x),
inference(para,[status(thm),theory(equality)],[1,603]),
[iquote('para(1,603)')] ).
cnf(643,plain,
equal(add(z,add(multiply(inverse(y),x),x)),x),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[606,1]),1]),
[iquote('para(606,1),flip(1)')] ).
cnf(830,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)],[271,5]),16,16]),1]),
[iquote('para(271,5),demod([16,16]),flip(1)')] ).
cnf(840,plain,
equal(add(z,x),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[643]),830]),
[iquote('back_demod(643),demod([830])')] ).
cnf(845,plain,
equal(add(multiply(x,inverse(y)),x),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[538]),840]),
[iquote('back_demod(538),demod([840])')] ).
cnf(846,plain,
equal(add(x,z),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[597]),845]),
[iquote('back_demod(597),demod([845])')] ).
cnf(847,plain,
$false,
inference(conflict,[status(thm)],[846,20]),
[iquote('conflict(846,20)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n020.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 15:38:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.82/1.20 ----- EQP 0.9e, May 2009 -----
% 0.82/1.20 The job began on n020.cluster.edu, Wed Jun 1 15:38:54 2022
% 0.82/1.20 The command was "./eqp09e".
% 0.82/1.20
% 0.82/1.20 set(prolog_style_variables).
% 0.82/1.20 set(lrpo).
% 0.82/1.20 set(basic_paramod).
% 0.82/1.20 set(functional_subsume).
% 0.82/1.20 set(ordered_paramod).
% 0.82/1.20 set(prime_paramod).
% 0.82/1.20 set(para_pairs).
% 0.82/1.20 assign(pick_given_ratio,4).
% 0.82/1.20 clear(print_kept).
% 0.82/1.20 clear(print_new_demod).
% 0.82/1.20 clear(print_back_demod).
% 0.82/1.20 clear(print_given).
% 0.82/1.20 assign(max_mem,64000).
% 0.82/1.20 end_of_commands.
% 0.82/1.20
% 0.82/1.20 Usable:
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Sos:
% 0.82/1.20 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.82/1.20 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.82/1.20 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.82/1.20 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.82/1.20 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.82/1.20 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.82/1.20 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.82/1.20 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.82/1.20 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.82/1.20 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.82/1.20 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.82/1.20 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.82/1.20 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.82/1.20 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.82/1.20 0 (wt=-1) [] multiply(x,y) = z.
% 0.82/1.20 0 (wt=-1) [] -(add(x,z) = x).
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Demodulators:
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Passive:
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Starting to process input.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.82/1.20 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.82/1.20
% 0.82/1.20 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.82/1.20 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.82/1.20
% 0.82/1.20 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.82/1.20 3 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.82/1.20 4 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.82/1.20 5 is a new demodulator.
% 0.82/1.20 -> 5 back demodulating 4.
% 0.82/1.20
% 0.82/1.20 ** 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)).
% 0.82/1.20 6 is a new demodulator.
% 0.82/1.20 -> 5 back demodulating 3.
% 0.82/1.20
% 0.82/1.20 ** 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).
% 0.82/1.20 7 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.82/1.20 8 is a new demodulator.
% 0.82/1.20 -> 8 back demodulating 7.
% 0.82/1.20
% 0.82/1.20 ** 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).
% 0.82/1.20 9 is a new demodulator.
% 0.82/1.20 -> 8 back demodulating 6.
% 0.82/1.20
% 0.82/1.20 ** 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)).
% 0.82/1.20 10 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.82/1.20 11 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.82/1.20 12 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.82/1.20 13 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.82/1.20 14 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.82/1.20 15 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.82/1.20 16 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.82/1.20 17 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.82/1.20 18 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 19 (wt=5) [] multiply(x,y) = z.
% 0.82/1.20 19 is a new demodulator.
% 0.82/1.20
% 0.82/1.20 ** KEPT: 20 (wt=5) [] -(add(x,z) = x).
% 0.82/1.20 ---------------- PROOF FOUND ----------------
% 0.82/1.20 % SZS status Unsatisfiable
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 After processing input:
% 0.82/1.20
% 0.82/1.20 Usable:
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Sos:
% 0.82/1.20 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.82/1.20 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.82/1.20 17 (wt=5) [] add(A,additive_identity) = A.
% 0.82/1.20 18 (wt=5) [] add(additive_identity,A) = A.
% 0.82/1.20 19 (wt=5) [] multiply(x,y) = z.
% 0.82/1.20 20 (wt=5) [] -(add(x,z) = x).
% 0.82/1.20 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.82/1.20 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.82/1.20 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.82/1.20 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.82/1.20 1 (wt=7) [] add(A,B) = add(B,A).
% 0.82/1.20 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.82/1.20 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.82/1.20 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.82/1.20 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).
% 0.82/1.20 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)).
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Demodulators:
% 0.82/1.20 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.82/1.20 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.82/1.20 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).
% 0.82/1.20 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)).
% 0.82/1.20 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.82/1.20 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.82/1.20 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.82/1.20 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.82/1.20 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.82/1.20 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.82/1.20 17 (wt=5) [] add(A,additive_identity) = A.
% 0.82/1.20 18 (wt=5) [] add(additive_identity,A) = A.
% 0.82/1.20 19 (wt=5) [] multiply(x,y) = z.
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 Passive:
% 0.82/1.20 end_of_list.
% 0.82/1.20
% 0.82/1.20 UNIT CONFLICT from 846 and 20 at 0.06 seconds.
% 0.82/1.20
% 0.82/1.20 ---------------- PROOF ----------------
% 0.82/1.20 % SZS output start Refutation
% See solution above
% 0.82/1.20 ------------ end of proof -------------
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 ------------- memory usage ------------
% 0.82/1.20 Memory dynamically allocated (tp_alloc): 1464.
% 0.82/1.20 type (bytes each) gets frees in use avail bytes
% 0.82/1.20 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.82/1.20 term ( 16) 71276 51377 19899 35 386.0 K
% 0.82/1.20 gen_ptr ( 8) 92201 14196 78005 45 609.8 K
% 0.82/1.20 context ( 808) 69949 69947 2 3 3.9 K
% 0.82/1.20 trail ( 12) 28499 28499 0 4 0.0 K
% 0.82/1.20 bt_node ( 68) 30169 30166 3 12 1.0 K
% 0.82/1.20 ac_position (285432) 0 0 0 0 0.0 K
% 0.82/1.20 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.82/1.20 ac_match_free_vars_pos (4020)
% 0.82/1.20 0 0 0 0 0.0 K
% 0.82/1.20 discrim ( 12) 11869 2607 9262 205 110.9 K
% 0.82/1.20 flat ( 40) 159719 159719 0 47 1.8 K
% 0.82/1.20 discrim_pos ( 12) 3837 3837 0 1 0.0 K
% 0.82/1.20 fpa_head ( 12) 1352 0 1352 0 15.8 K
% 0.82/1.20 fpa_tree ( 28) 1747 1747 0 17 0.5 K
% 0.82/1.20 fpa_pos ( 36) 1194 1194 0 1 0.0 K
% 0.82/1.20 literal ( 12) 4143 3297 846 1 9.9 K
% 0.82/1.20 clause ( 24) 4143 3297 846 1 19.9 K
% 0.82/1.20 list ( 12) 407 348 59 1 0.7 K
% 0.82/1.20 list_pos ( 20) 3303 900 2403 22 47.4 K
% 0.82/1.20 pair_index ( 40) 2 0 2 0 0.1 K
% 0.82/1.20
% 0.82/1.20 -------------- statistics -------------
% 0.82/1.20 Clauses input 16
% 0.82/1.20 Usable input 0
% 0.82/1.20 Sos input 16
% 0.82/1.20 Demodulators input 0
% 0.82/1.20 Passive input 0
% 0.82/1.20
% 0.82/1.20 Processed BS (before search) 22
% 0.82/1.20 Forward subsumed BS 2
% 0.82/1.20 Kept BS 20
% 0.82/1.20 New demodulators BS 17
% 0.82/1.20 Back demodulated BS 4
% 0.82/1.20
% 0.82/1.20 Clauses or pairs given 4993
% 0.82/1.20 Clauses generated 2316
% 0.82/1.20 Forward subsumed 1490
% 0.82/1.20 Deleted by weight 0
% 0.82/1.20 Deleted by variable count 0
% 0.82/1.20 Kept 826
% 0.82/1.20 New demodulators 331
% 0.82/1.20 Back demodulated 183
% 0.82/1.20 Ordered paramod prunes 0
% 0.82/1.20 Basic paramod prunes 17889
% 0.82/1.20 Prime paramod prunes 117
% 0.82/1.20 Semantic prunes 0
% 0.82/1.20
% 0.82/1.20 Rewrite attmepts 30109
% 0.82/1.20 Rewrites 2971
% 0.82/1.20
% 0.82/1.20 FPA overloads 0
% 0.82/1.20 FPA underloads 0
% 0.82/1.20
% 0.82/1.20 Usable size 0
% 0.82/1.20 Sos size 658
% 0.82/1.20 Demodulators size 223
% 0.82/1.20 Passive size 0
% 0.82/1.20 Disabled size 187
% 0.82/1.20
% 0.82/1.20 Proofs found 1
% 0.82/1.20
% 0.82/1.20 ----------- times (seconds) ----------- Wed Jun 1 15:38:54 2022
% 0.82/1.20
% 0.82/1.20 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.82/1.20 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.82/1.20 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.82/1.20 input time 0.00
% 0.82/1.20 paramodulation time 0.01
% 0.82/1.20 demodulation time 0.01
% 0.82/1.20 orient time 0.01
% 0.82/1.20 weigh time 0.00
% 0.82/1.20 forward subsume time 0.00
% 0.82/1.20 back demod find time 0.00
% 0.82/1.20 conflict time 0.00
% 0.82/1.20 LRPO time 0.00
% 0.82/1.20 store clause time 0.00
% 0.82/1.20 disable clause time 0.00
% 0.82/1.20 prime paramod time 0.00
% 0.82/1.20 semantics time 0.00
% 0.82/1.20
% 0.82/1.20 EQP interrupted
%------------------------------------------------------------------------------