TSTP Solution File: GRP708-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP708-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:49:00 EDT 2022
% Result : Unsatisfiable 0.73s 1.30s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 4 RR)
% Number of literals : 58 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP708-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP708-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP708-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP708-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP708-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP708-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,A)),C),mult(A,mult(B,mult(A,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP708-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
equal(mult(mult(mult(op_c,op_c),A),B),mult(mult(op_c,op_c),mult(A,B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
~ equal(mult(mult(a,b),op_c),mult(a,mult(b,op_c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(12,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(13,plain,
equal(rd(A,unit),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,5]),1]),
[iquote('para(3,5),flip(1)')] ).
cnf(19,plain,
equal(mult(mult(ld(A,B),B),C),mult(ld(A,B),mult(A,mult(ld(A,B),C)))),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(22,plain,
equal(rd(mult(A,mult(B,mult(A,C))),C),mult(A,mult(B,A))),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(23,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,7]),6]),
[iquote('para(6,7),demod([6])')] ).
cnf(24,plain,
equal(mult(mult(op_c,mult(op_c,A)),B),mult(op_c,mult(op_c,mult(A,B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),23,23]),
[iquote('back_demod(10),demod([23,23])')] ).
cnf(25,plain,
equal(mult(mult(A,mult(B,mult(C,mult(B,A)))),D),mult(A,mult(B,mult(C,mult(B,mult(A,D)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,7]),7]),
[iquote('para(7,7),demod([7])')] ).
cnf(27,plain,
equal(mult(ld(op_c,A),op_c),A),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(28,plain,
equal(ld(op_c,mult(A,op_c)),A),
inference(para,[status(thm),theory(equality)],[8,2]),
[iquote('para(8,2)')] ).
cnf(35,plain,
equal(mult(op_c,mult(op_c,mult(A,B))),mult(op_c,mult(A,mult(op_c,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,7]),24]),
[iquote('para(9,7),demod([24])')] ).
cnf(36,plain,
equal(mult(op_c,mult(A,mult(op_c,B))),mult(op_c,mult(op_c,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[35]),
[iquote('flip(35)')] ).
cnf(37,plain,
equal(mult(op_c,mult(A,mult(B,A))),mult(A,mult(B,mult(A,op_c)))),
inference(para,[status(thm),theory(equality)],[9,7]),
[iquote('para(9,7)')] ).
cnf(38,plain,
equal(mult(A,mult(B,mult(A,op_c))),mult(op_c,mult(A,mult(B,A)))),
inference(flip,[status(thm),theory(equality)],[37]),
[iquote('flip(37)')] ).
cnf(39,plain,
equal(ld(ld(op_c,A),A),op_c),
inference(para,[status(thm),theory(equality)],[27,2]),
[iquote('para(27,2)')] ).
cnf(46,plain,
equal(mult(ld(A,unit),mult(A,mult(ld(A,unit),B))),mult(ld(A,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,19]),1]),
[iquote('para(5,19),flip(1)')] ).
cnf(62,plain,
equal(rd(mult(A,B),C),mult(A,mult(rd(B,mult(A,C)),A))),
inference(para,[status(thm),theory(equality)],[3,22]),
[iquote('para(3,22)')] ).
cnf(64,plain,
equal(mult(A,mult(rd(B,mult(A,B)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),62]),
[iquote('back_demod(4),demod([62])')] ).
cnf(87,plain,
equal(mult(mult(A,mult(mult(B,mult(op_c,A)),op_c)),C),mult(A,mult(op_c,mult(B,mult(op_c,mult(A,C)))))),
inference(para,[status(thm),theory(equality)],[8,25]),
[iquote('para(8,25)')] ).
cnf(103,plain,
equal(mult(A,mult(rd(ld(A,B),B),A)),A),
inference(para,[status(thm),theory(equality)],[1,64]),
[iquote('para(1,64)')] ).
cnf(105,plain,
equal(mult(A,mult(ld(A,unit),A)),A),
inference(para,[status(thm),theory(equality)],[13,103]),
[iquote('para(13,103)')] ).
cnf(107,plain,
equal(mult(ld(A,unit),A),unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[105,2]),12]),1]),
[iquote('para(105,2),demod([12]),flip(1)')] ).
cnf(110,plain,
equal(ld(ld(A,unit),unit),A),
inference(para,[status(thm),theory(equality)],[107,2]),
[iquote('para(107,2)')] ).
cnf(115,plain,
equal(mult(rd(A,mult(B,A)),B),unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,2]),12]),1]),
[iquote('para(64,2),demod([12]),flip(1)')] ).
cnf(122,plain,
equal(rd(A,mult(op_c,A)),ld(op_c,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,28]),1]),
[iquote('para(115,28),flip(1)')] ).
cnf(125,plain,
equal(mult(ld(op_c,unit),mult(op_c,A)),A),
inference(para,[status(thm),theory(equality)],[122,3]),
[iquote('para(122,3)')] ).
cnf(128,plain,
equal(mult(op_c,A),ld(ld(op_c,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[125,2]),1]),
[iquote('para(125,2),flip(1)')] ).
cnf(149,plain,
equal(mult(mult(A,mult(mult(B,ld(ld(op_c,unit),A)),op_c)),C),mult(A,ld(ld(op_c,unit),mult(B,ld(ld(op_c,unit),mult(A,C)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[87]),128,128,128]),
[iquote('back_demod(87),demod([128,128,128])')] ).
cnf(169,plain,
equal(mult(A,mult(B,mult(A,op_c))),ld(ld(op_c,unit),mult(A,mult(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),128]),
[iquote('back_demod(38),demod([128])')] ).
cnf(177,plain,
equal(ld(ld(op_c,unit),mult(A,ld(ld(op_c,unit),B))),ld(ld(op_c,unit),ld(ld(op_c,unit),mult(A,B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[36]),128,128,128,128]),
[iquote('back_demod(36),demod([128,128,128,128])')] ).
cnf(180,plain,
equal(mult(mult(A,mult(mult(B,ld(ld(op_c,unit),A)),op_c)),C),mult(A,ld(ld(op_c,unit),ld(ld(op_c,unit),mult(B,mult(A,C)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[149]),177]),
[iquote('back_demod(149),demod([177])')] ).
cnf(187,plain,
equal(mult(A,op_c),ld(ld(op_c,unit),A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),128]),
[iquote('back_demod(9),demod([128])')] ).
cnf(191,plain,
equal(mult(mult(A,ld(ld(op_c,unit),ld(ld(op_c,unit),mult(B,A)))),C),mult(A,ld(ld(op_c,unit),ld(ld(op_c,unit),mult(B,mult(A,C)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[180]),187,177]),
[iquote('back_demod(180),demod([187,177])')] ).
cnf(192,plain,
equal(mult(A,mult(B,ld(ld(op_c,unit),A))),ld(ld(op_c,unit),mult(A,mult(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[169]),187]),
[iquote('back_demod(169),demod([187])')] ).
cnf(199,plain,
~ equal(mult(a,ld(ld(op_c,unit),b)),ld(ld(op_c,unit),mult(a,b))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),187,187]),1]),
[iquote('back_demod(11),demod([187,187]),flip(1)')] ).
cnf(204,plain,
equal(mult(ld(A,unit),mult(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,46]),1]),
[iquote('para(1,46),demod([1])')] ).
cnf(210,plain,
equal(mult(ld(A,unit),B),ld(A,B)),
inference(para,[status(thm),theory(equality)],[1,204]),
[iquote('para(1,204)')] ).
cnf(212,plain,
equal(ld(A,ld(ld(A,unit),B)),B),
inference(para,[status(thm),theory(equality)],[210,1]),
[iquote('para(210,1)')] ).
cnf(218,plain,
equal(ld(ld(A,unit),ld(A,B)),B),
inference(para,[status(thm),theory(equality)],[210,2]),
[iquote('para(210,2)')] ).
cnf(220,plain,
equal(mult(A,B),ld(ld(A,unit),B)),
inference(para,[status(thm),theory(equality)],[212,1]),
[iquote('para(212,1)')] ).
cnf(235,plain,
~ equal(ld(ld(op_c,unit),ld(ld(a,unit),b)),ld(ld(a,unit),ld(ld(op_c,unit),b))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[199]),220,220]),1]),
[iquote('back_demod(199),demod([220,220]),flip(1)')] ).
cnf(242,plain,
equal(ld(ld(A,unit),ld(ld(B,unit),ld(ld(op_c,unit),A))),ld(ld(op_c,unit),ld(ld(A,unit),ld(ld(B,unit),A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[192]),220,220,220,220]),
[iquote('back_demod(192),demod([220,220,220,220])')] ).
cnf(244,plain,
equal(ld(ld(ld(ld(A,unit),ld(ld(op_c,unit),ld(ld(op_c,unit),ld(ld(B,unit),A)))),unit),C),ld(ld(A,unit),ld(ld(op_c,unit),ld(ld(op_c,unit),ld(ld(B,unit),ld(ld(A,unit),C)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[191]),220,220,220,220,220,220]),
[iquote('back_demod(191),demod([220,220,220,220,220,220])')] ).
cnf(541,plain,
equal(ld(ld(A,unit),ld(op_c,unit)),ld(op_c,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,242]),110,110,110,218]),1]),
[iquote('para(12,242),demod([110,110,110,218]),flip(1)')] ).
cnf(626,plain,
equal(ld(ld(op_c,unit),ld(ld(A,unit),ld(op_c,B))),ld(ld(A,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,244]),541,218,212,110,110,212]),1]),
[iquote('para(39,244),demod([541,218,212,110,110,212]),flip(1)')] ).
cnf(642,plain,
equal(ld(ld(op_c,unit),ld(A,ld(op_c,B))),ld(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[110,626]),110]),
[iquote('para(110,626),demod([110])')] ).
cnf(750,plain,
equal(ld(ld(op_c,unit),ld(A,B)),ld(A,ld(ld(op_c,unit),B))),
inference(para,[status(thm),theory(equality)],[212,642]),
[iquote('para(212,642)')] ).
cnf(751,plain,
$false,
inference(conflict,[status(thm)],[750,235]),
[iquote('conflict(750,235)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP708-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 12:24:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.30 ----- EQP 0.9e, May 2009 -----
% 0.73/1.30 The job began on n022.cluster.edu, Mon Jun 13 12:24:49 2022
% 0.73/1.30 The command was "./eqp09e".
% 0.73/1.30
% 0.73/1.30 set(prolog_style_variables).
% 0.73/1.30 set(lrpo).
% 0.73/1.30 set(basic_paramod).
% 0.73/1.30 set(functional_subsume).
% 0.73/1.30 set(ordered_paramod).
% 0.73/1.30 set(prime_paramod).
% 0.73/1.30 set(para_pairs).
% 0.73/1.30 assign(pick_given_ratio,4).
% 0.73/1.30 clear(print_kept).
% 0.73/1.30 clear(print_new_demod).
% 0.73/1.30 clear(print_back_demod).
% 0.73/1.30 clear(print_given).
% 0.73/1.30 assign(max_mem,64000).
% 0.73/1.30 end_of_commands.
% 0.73/1.30
% 0.73/1.30 Usable:
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Sos:
% 0.73/1.30 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.73/1.30 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.73/1.30 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.73/1.30 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.73/1.30 0 (wt=-1) [] mult(A,unit) = A.
% 0.73/1.30 0 (wt=-1) [] mult(unit,A) = A.
% 0.73/1.30 0 (wt=-1) [] mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C).
% 0.73/1.30 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 0.73/1.30 0 (wt=-1) [] mult(mult(op_c,op_c),mult(A,B)) = mult(mult(mult(op_c,op_c),A),B).
% 0.73/1.30 0 (wt=-1) [] -(mult(a,mult(b,op_c)) = mult(mult(a,b),op_c)).
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Demodulators:
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Passive:
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Starting to process input.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.30 1 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.30 2 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.30 3 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.30 4 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.30 5 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.30 6 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.73/1.30 7 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.73/1.30
% 0.73/1.30 ** KEPT: 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 0.73/1.30 clause forward subsumed: 0 (wt=7) [flip(9)] mult(op_c,A) = mult(A,op_c).
% 0.73/1.30
% 0.73/1.30 ** KEPT: 10 (wt=15) [flip(1)] mult(mult(mult(op_c,op_c),A),B) = mult(mult(op_c,op_c),mult(A,B)).
% 0.73/1.30 10 is a new demodulator.
% 0.73/1.30
% 0.73/1.30 ** KEPT: 11 (wt=11) [flip(1)] -(mult(mult(a,b),op_c) = mult(a,mult(b,op_c))).
% 0.73/1.30 ---------------- PROOF FOUND ----------------
% 0.73/1.30 % SZS status Unsatisfiable
% 0.73/1.30
% 0.73/1.30
% 0.73/1.30 After processing input:
% 0.73/1.30
% 0.73/1.30 Usable:
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Sos:
% 0.73/1.30 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.30 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.30 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.30 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.30 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.30 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.30 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.73/1.30 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 0.73/1.30 11 (wt=11) [flip(1)] -(mult(mult(a,b),op_c) = mult(a,mult(b,op_c))).
% 0.73/1.30 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.73/1.30 10 (wt=15) [flip(1)] mult(mult(mult(op_c,op_c),A),B) = mult(mult(op_c,op_c),mult(A,B)).
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Demodulators:
% 0.73/1.30 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.30 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.30 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.30 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.30 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.30 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.30 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.73/1.30 10 (wt=15) [flip(1)] mult(mult(mult(op_c,op_c),A),B) = mult(mult(op_c,op_c),mult(A,B)).
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 Passive:
% 0.73/1.30 end_of_list.
% 0.73/1.30
% 0.73/1.30 UNIT CONFLICT from 750 and 235 at 0.17 seconds.
% 0.73/1.30
% 0.73/1.30 ---------------- PROOF ----------------
% 0.73/1.30 % SZS output start Refutation
% See solution above
% 0.73/1.30 ------------ end of proof -------------
% 0.73/1.30
% 0.73/1.30
% 0.73/1.30 ------------- memory usage ------------
% 0.73/1.30 Memory dynamically allocated (tp_alloc): 3906.
% 0.73/1.30 type (bytes each) gets frees in use avail bytes
% 0.73/1.30 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.73/1.30 term ( 16) 331108 290814 40294 257 789.1 K
% 0.73/1.30 gen_ptr ( 8) 302212 37666 264546 57 2067.2 K
% 0.73/1.30 context ( 808) 185395 185393 2 4 4.7 K
% 0.73/1.30 trail ( 12) 7751 7751 0 6 0.1 K
% 0.73/1.30 bt_node ( 68) 30164 30161 3 26 1.9 K
% 0.73/1.30 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.30 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.30 ac_match_free_vars_pos (4020)
% 0.73/1.30 0 0 0 0 0.0 K
% 0.73/1.30 discrim ( 12) 40022 11384 28638 0 335.6 K
% 0.73/1.30 flat ( 40) 904785 904785 0 205 8.0 K
% 0.73/1.30 discrim_pos ( 12) 16367 16367 0 1 0.0 K
% 0.73/1.30 fpa_head ( 12) 4047 0 4047 0 47.4 K
% 0.73/1.30 fpa_tree ( 28) 6217 6217 0 45 1.2 K
% 0.73/1.30 fpa_pos ( 36) 1269 1269 0 1 0.0 K
% 0.73/1.30 literal ( 12) 3209 2459 750 1 8.8 K
% 0.73/1.30 clause ( 24) 3209 2459 750 1 17.6 K
% 0.73/1.30 list ( 12) 578 522 56 5 0.7 K
% 0.73/1.30 list_pos ( 20) 3382 1486 1896 0 37.0 K
% 0.73/1.30 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.30
% 0.73/1.30 -------------- statistics -------------
% 0.73/1.30 Clauses input 10
% 0.73/1.30 Usable input 0
% 0.73/1.30 Sos input 10
% 0.73/1.30 Demodulators input 0
% 0.73/1.30 Passive input 0
% 0.73/1.30
% 0.73/1.30 Processed BS (before search) 12
% 0.73/1.30 Forward subsumed BS 1
% 0.73/1.30 Kept BS 11
% 0.73/1.30 New demodulators BS 8
% 0.73/1.30 Back demodulated BS 0
% 0.73/1.30
% 0.73/1.30 Clauses or pairs given 2384
% 0.73/1.30 Clauses generated 2109
% 0.73/1.30 Forward subsumed 1370
% 0.73/1.30 Deleted by weight 0
% 0.73/1.30 Deleted by variable count 0
% 0.73/1.30 Kept 739
% 0.73/1.30 New demodulators 511
% 0.73/1.30 Back demodulated 300
% 0.73/1.30 Ordered paramod prunes 0
% 0.73/1.30 Basic paramod prunes 8139
% 0.73/1.30 Prime paramod prunes 251
% 0.73/1.30 Semantic prunes 0
% 0.73/1.30
% 0.73/1.30 Rewrite attmepts 146010
% 0.73/1.30 Rewrites 15896
% 0.73/1.30
% 0.73/1.30 FPA overloads 0
% 0.73/1.30 FPA underloads 0
% 0.73/1.30
% 0.73/1.30 Usable size 0
% 0.73/1.30 Sos size 449
% 0.73/1.30 Demodulators size 249
% 0.73/1.30 Passive size 0
% 0.73/1.30 Disabled size 300
% 0.73/1.30
% 0.73/1.30 Proofs found 1
% 0.73/1.30
% 0.73/1.30 ----------- times (seconds) ----------- Mon Jun 13 12:24:49 2022
% 0.73/1.30
% 0.73/1.30 user CPU time 0.17 (0 hr, 0 min, 0 sec)
% 0.73/1.30 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.73/1.30 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.30 input time 0.00
% 0.73/1.30 paramodulation time 0.01
% 0.73/1.30 demodulation time 0.07
% 0.73/1.30 orient time 0.01
% 0.73/1.30 weigh time 0.00
% 0.73/1.30 forward subsume time 0.00
% 0.73/1.30 back demod find time 0.02
% 0.73/1.30 conflict time 0.00
% 0.73/1.30 LRPO time 0.01
% 0.73/1.30 store clause time 0.03
% 0.73/1.30 disable clause time 0.00
% 0.73/1.30 prime paramod time 0.00
% 0.73/1.30 semantics time 0.00
% 0.73/1.30
% 0.73/1.30 EQP interrupted
%------------------------------------------------------------------------------