TSTP Solution File: GRP587-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP587-1 : TPTP v8.1.0. Released v2.6.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 : Sat Jul 16 08:48:05 EDT 2022
% Result : Unsatisfiable 1.14s 1.51s
% Output : Refutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 2
% Syntax : Number of clauses : 66 ( 66 unt; 0 nHn; 3 RR)
% Number of literals : 66 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 160 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))),C),
file('GRP587-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP587-1.p',unknown),
[] ).
cnf(5,plain,
equal(double_divide(A,multiply(B,multiply(multiply(C,D),double_divide(A,B)))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(multiply(multiply(A,multiply(inverse(B),double_divide(C,A))),C),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(A,multiply(multiply(B,multiply(inverse(C),double_divide(A,B))),multiply(inverse(D),C))),D),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(12,plain,
equal(double_divide(A,multiply(B,inverse(C))),double_divide(multiply(inverse(C),double_divide(double_divide(A,B),D)),D)),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(15,plain,
equal(multiply(A,multiply(inverse(B),double_divide(double_divide(C,D),A))),multiply(multiply(D,inverse(B)),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,2]),2]),
[iquote('para(12,2),demod([2])')] ).
cnf(25,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(27,plain,
equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,2]),1]),
[iquote('para(25,2),flip(1)')] ).
cnf(29,plain,
equal(double_divide(multiply(inverse(A),B),multiply(inverse(B),multiply(inverse(C),A))),C),
inference(para,[status(thm),theory(equality)],[25,3]),
[iquote('para(25,3)')] ).
cnf(34,plain,
equal(double_divide(multiply(inverse(multiply(inverse(A),B)),C),multiply(inverse(C),inverse(A))),B),
inference(para,[status(thm),theory(equality)],[27,29]),
[iquote('para(27,29)')] ).
cnf(35,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[27,29]),
[iquote('para(27,29)')] ).
cnf(36,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,2]),1]),
[iquote('para(35,2),flip(1)')] ).
cnf(37,plain,
equal(double_divide(multiply(inverse(A),A),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,35]),
[iquote('para(2,35)')] ).
cnf(39,plain,
equal(multiply(multiply(A,B),multiply(inverse(C),C)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,2]),2]),1]),
[iquote('para(37,2),demod([2]),flip(1)')] ).
cnf(57,plain,
equal(double_divide(multiply(inverse(multiply(inverse(A),A)),B),multiply(inverse(B),inverse(C))),C),
inference(para,[status(thm),theory(equality)],[36,29]),
[iquote('para(36,29)')] ).
cnf(84,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,15]),39]),
[iquote('para(35,15),demod([39])')] ).
cnf(85,plain,
equal(multiply(inverse(A),inverse(B)),multiply(C,multiply(inverse(B),double_divide(A,C)))),
inference(flip,[status(thm),theory(equality)],[84]),
[iquote('flip(84)')] ).
cnf(88,plain,
equal(multiply(multiply(A,B),inverse(C)),multiply(D,multiply(inverse(C),double_divide(double_divide(B,A),D)))),
inference(para,[status(thm),theory(equality)],[2,85]),
[iquote('para(2,85)')] ).
cnf(89,plain,
equal(multiply(A,multiply(inverse(B),double_divide(double_divide(C,D),A))),multiply(multiply(D,C),inverse(B))),
inference(flip,[status(thm),theory(equality)],[88]),
[iquote('flip(88)')] ).
cnf(92,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,84]),27]),1]),
[iquote('para(35,84),demod([27]),flip(1)')] ).
cnf(93,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(B,C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,92]),2]),
[iquote('para(2,92),demod([2])')] ).
cnf(98,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[92,37]),35]),1]),
[iquote('para(92,37),demod([35]),flip(1)')] ).
cnf(101,plain,
equal(double_divide(inverse(A),multiply(inverse(B),A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),93]),
[iquote('para(98,3),demod([93])')] ).
cnf(106,plain,
equal(double_divide(inverse(multiply(inverse(A),B)),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[27,101]),
[iquote('para(27,101)')] ).
cnf(126,plain,
equal(double_divide(inverse(inverse(A)),inverse(A)),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[92,101]),
[iquote('para(92,101)')] ).
cnf(128,plain,
equal(inverse(multiply(inverse(A),A)),multiply(inverse(B),inverse(inverse(B)))),
inference(para,[status(thm),theory(equality)],[126,2]),
[iquote('para(126,2)')] ).
cnf(187,plain,
equal(double_divide(inverse(A),multiply(inverse(B),inverse(inverse(B)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[128,25]),36]),
[iquote('para(128,25),demod([36])')] ).
cnf(191,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[187,101]),
[iquote('para(187,101)')] ).
cnf(204,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[191,25]),
[iquote('para(191,25)')] ).
cnf(207,plain,
equal(double_divide(inverse(A),multiply(B,A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[191,101]),
[iquote('para(191,101)')] ).
cnf(216,plain,
equal(double_divide(inverse(multiply(A,B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[191,106]),191]),
[iquote('para(191,106),demod([191])')] ).
cnf(235,plain,
equal(multiply(A,inverse(multiply(A,B))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[216,2]),1]),
[iquote('para(216,2),flip(1)')] ).
cnf(236,plain,
equal(multiply(inverse(multiply(inverse(A),A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[191,92]),191]),
[iquote('para(191,92),demod([191])')] ).
cnf(239,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[57]),236]),
[iquote('back_demod(57),demod([236])')] ).
cnf(254,plain,
equal(multiply(multiply(A,B),inverse(B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[207,2]),191]),1]),
[iquote('para(207,2),demod([191]),flip(1)')] ).
cnf(341,plain,
equal(inverse(multiply(A,B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[254,207]),191]),1]),
[iquote('para(254,207),demod([191]),flip(1)')] ).
cnf(348,plain,
equal(multiply(A,double_divide(B,A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[235]),341]),
[iquote('back_demod(235),demod([341])')] ).
cnf(354,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[216]),341]),
[iquote('back_demod(216),demod([341])')] ).
cnf(370,plain,
equal(double_divide(multiply(double_divide(A,inverse(B)),C),multiply(inverse(C),inverse(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[34]),341]),
[iquote('back_demod(34),demod([341])')] ).
cnf(399,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[204,354]),1]),
[iquote('para(204,354),flip(1)')] ).
cnf(400,plain,
equal(double_divide(multiply(double_divide(A,inverse(B)),C),double_divide(C,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[370]),399]),
[iquote('back_demod(370),demod([399])')] ).
cnf(403,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[239]),399]),
[iquote('back_demod(239),demod([399])')] ).
cnf(404,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[85]),399]),1]),
[iquote('back_demod(85),demod([399]),flip(1)')] ).
cnf(473,plain,
equal(multiply(multiply(A,B),inverse(C)),double_divide(double_divide(B,A),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[89]),404]),1]),
[iquote('back_demod(89),demod([404]),flip(1)')] ).
cnf(485,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[254]),473]),
[iquote('back_demod(254),demod([473])')] ).
cnf(536,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[485,354]),
[iquote('para(485,354)')] ).
cnf(547,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[485,348]),2]),
[iquote('para(485,348),demod([2])')] ).
cnf(585,plain,
equal(double_divide(inverse(A),B),multiply(inverse(B),A)),
inference(para,[status(thm),theory(equality)],[101,403]),
[iquote('para(101,403)')] ).
cnf(586,plain,
equal(multiply(inverse(A),B),double_divide(inverse(B),A)),
inference(flip,[status(thm),theory(equality)],[585]),
[iquote('flip(585)')] ).
cnf(625,plain,
equal(double_divide(multiply(A,B),inverse(B)),inverse(A)),
inference(para,[status(thm),theory(equality)],[536,207]),
[iquote('para(536,207)')] ).
cnf(626,plain,
equal(inverse(A),double_divide(multiply(A,B),inverse(B))),
inference(flip,[status(thm),theory(equality)],[625]),
[iquote('flip(625)')] ).
cnf(645,plain,
equal(double_divide(inverse(A),B),multiply(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[586,547]),
[iquote('para(586,547)')] ).
cnf(678,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[645,403]),2]),
[iquote('para(645,403),demod([2])')] ).
cnf(1025,plain,
equal(multiply(A,multiply(B,double_divide(multiply(A,C),inverse(C)))),B),
inference(para,[status(thm),theory(equality)],[626,678]),
[iquote('para(626,678)')] ).
cnf(1644,plain,
~ equal(multiply(multiply(b3,a3),c3),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[547,4]),
[iquote('para(547,4)')] ).
cnf(2956,plain,
equal(multiply(double_divide(A,inverse(B)),C),double_divide(A,double_divide(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[400,354]),1]),
[iquote('para(400,354),flip(1)')] ).
cnf(3484,plain,
equal(multiply(A,double_divide(multiply(A,B),double_divide(C,B))),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[547,1025]),2956]),
[iquote('para(547,1025),demod([2956])')] ).
cnf(3485,plain,
equal(multiply(A,double_divide(multiply(A,B),C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[354,3484]),
[iquote('para(354,3484)')] ).
cnf(3486,plain,
equal(multiply(A,B),double_divide(double_divide(multiply(A,C),B),C)),
inference(para,[status(thm),theory(equality)],[403,3485]),
[iquote('para(403,3485)')] ).
cnf(3487,plain,
equal(double_divide(double_divide(multiply(A,B),C),B),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[3486]),
[iquote('flip(3486)')] ).
cnf(3617,plain,
equal(multiply(A,multiply(B,C)),multiply(C,multiply(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3487,348]),2]),
[iquote('para(3487,348),demod([2])')] ).
cnf(3619,plain,
equal(multiply(multiply(A,B),C),multiply(B,multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3617,547]),1]),
[iquote('para(3617,547),flip(1)')] ).
cnf(3620,plain,
$false,
inference(conflict,[status(thm)],[3619,1644]),
[iquote('conflict(3619,1644)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP587-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 08:19:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.14/1.51 ----- EQP 0.9e, May 2009 -----
% 1.14/1.51 The job began on n029.cluster.edu, Tue Jun 14 08:19:26 2022
% 1.14/1.51 The command was "./eqp09e".
% 1.14/1.51
% 1.14/1.51 set(prolog_style_variables).
% 1.14/1.51 set(lrpo).
% 1.14/1.51 set(basic_paramod).
% 1.14/1.51 set(functional_subsume).
% 1.14/1.51 set(ordered_paramod).
% 1.14/1.51 set(prime_paramod).
% 1.14/1.51 set(para_pairs).
% 1.14/1.51 assign(pick_given_ratio,4).
% 1.14/1.51 clear(print_kept).
% 1.14/1.51 clear(print_new_demod).
% 1.14/1.51 clear(print_back_demod).
% 1.14/1.51 clear(print_given).
% 1.14/1.51 assign(max_mem,64000).
% 1.14/1.51 end_of_commands.
% 1.14/1.51
% 1.14/1.51 Usable:
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Sos:
% 1.14/1.51 0 (wt=-1) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 1.14/1.51 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 1.14/1.51 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Demodulators:
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Passive:
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Starting to process input.
% 1.14/1.51
% 1.14/1.51 ** KEPT: 1 (wt=14) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 1.14/1.51 1 is a new demodulator.
% 1.14/1.51
% 1.14/1.51 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 1.14/1.51 2 is a new demodulator.
% 1.14/1.51 -> 2 back demodulating 1.
% 1.14/1.51
% 1.14/1.51 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 1.14/1.51 3 is a new demodulator.
% 1.14/1.51
% 1.14/1.51 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 1.14/1.51 ---------------- PROOF FOUND ----------------
% 1.14/1.51 % SZS status Unsatisfiable
% 1.14/1.51
% 1.14/1.51
% 1.14/1.51 After processing input:
% 1.14/1.51
% 1.14/1.51 Usable:
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Sos:
% 1.14/1.51 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 1.14/1.51 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 1.14/1.51 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Demodulators:
% 1.14/1.51 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 1.14/1.51 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 Passive:
% 1.14/1.51 end_of_list.
% 1.14/1.51
% 1.14/1.51 UNIT CONFLICT from 3619 and 1644 at 0.24 seconds.
% 1.14/1.51
% 1.14/1.51 ---------------- PROOF ----------------
% 1.14/1.51 % SZS output start Refutation
% See solution above
% 1.14/1.51 ------------ end of proof -------------
% 1.14/1.51
% 1.14/1.51
% 1.14/1.51 ------------- memory usage ------------
% 1.14/1.51 Memory dynamically allocated (tp_alloc): 4882.
% 1.14/1.51 type (bytes each) gets frees in use avail bytes
% 1.14/1.51 sym_ent ( 96) 57 0 57 0 5.3 K
% 1.14/1.51 term ( 16) 268314 194587 73727 20 1426.2 K
% 1.14/1.51 gen_ptr ( 8) 409189 81945 327244 65 2557.1 K
% 1.14/1.51 context ( 808) 198775 198773 2 4 4.7 K
% 1.14/1.51 trail ( 12) 34210 34210 0 11 0.1 K
% 1.14/1.51 bt_node ( 68) 66574 66571 3 24 1.8 K
% 1.14/1.51 ac_position (285432) 0 0 0 0 0.0 K
% 1.14/1.51 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.14/1.51 ac_match_free_vars_pos (4020)
% 1.14/1.51 0 0 0 0 0.0 K
% 1.14/1.51 discrim ( 12) 46574 25772 20802 145 245.5 K
% 1.14/1.51 flat ( 40) 666797 666797 0 55 2.1 K
% 1.14/1.51 discrim_pos ( 12) 10701 10701 0 1 0.0 K
% 1.14/1.51 fpa_head ( 12) 6972 0 6972 0 81.7 K
% 1.14/1.51 fpa_tree ( 28) 8975 8975 0 25 0.7 K
% 1.14/1.51 fpa_pos ( 36) 4979 4979 0 1 0.0 K
% 1.14/1.51 literal ( 12) 17293 13674 3619 1 42.4 K
% 1.14/1.51 clause ( 24) 17293 13674 3619 1 84.8 K
% 1.14/1.51 list ( 12) 1419 1363 56 5 0.7 K
% 1.14/1.51 list_pos ( 20) 15502 6770 8732 0 170.5 K
% 1.14/1.51 pair_index ( 40) 2 0 2 0 0.1 K
% 1.14/1.51
% 1.14/1.51 -------------- statistics -------------
% 1.14/1.51 Clauses input 3
% 1.14/1.51 Usable input 0
% 1.14/1.51 Sos input 3
% 1.14/1.51 Demodulators input 0
% 1.14/1.51 Passive input 0
% 1.14/1.51
% 1.14/1.51 Processed BS (before search) 4
% 1.14/1.51 Forward subsumed BS 0
% 1.14/1.51 Kept BS 4
% 1.14/1.51 New demodulators BS 3
% 1.14/1.51 Back demodulated BS 1
% 1.14/1.51
% 1.14/1.51 Clauses or pairs given 15854
% 1.14/1.51 Clauses generated 9969
% 1.14/1.51 Forward subsumed 6354
% 1.14/1.51 Deleted by weight 0
% 1.14/1.51 Deleted by variable count 0
% 1.14/1.51 Kept 3615
% 1.14/1.51 New demodulators 1357
% 1.14/1.51 Back demodulated 1425
% 1.14/1.51 Ordered paramod prunes 0
% 1.14/1.51 Basic paramod prunes 51482
% 1.14/1.51 Prime paramod prunes 673
% 1.14/1.51 Semantic prunes 0
% 1.14/1.51
% 1.14/1.51 Rewrite attmepts 95221
% 1.14/1.51 Rewrites 6357
% 1.14/1.51
% 1.14/1.51 FPA overloads 0
% 1.14/1.51 FPA underloads 0
% 1.14/1.51
% 1.14/1.51 Usable size 0
% 1.14/1.51 Sos size 2192
% 1.14/1.51 Demodulators size 730
% 1.14/1.51 Passive size 0
% 1.14/1.51 Disabled size 1426
% 1.14/1.51
% 1.14/1.51 Proofs found 1
% 1.14/1.51
% 1.14/1.51 ----------- times (seconds) ----------- Tue Jun 14 08:19:27 2022
% 1.14/1.51
% 1.14/1.51 user CPU time 0.24 (0 hr, 0 min, 0 sec)
% 1.14/1.51 system CPU time 0.21 (0 hr, 0 min, 0 sec)
% 1.14/1.51 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.14/1.51 input time 0.00
% 1.14/1.51 paramodulation time 0.04
% 1.14/1.51 demodulation time 0.03
% 1.14/1.51 orient time 0.03
% 1.14/1.51 weigh time 0.01
% 1.14/1.51 forward subsume time 0.01
% 1.14/1.51 back demod find time 0.01
% 1.14/1.51 conflict time 0.00
% 1.14/1.51 LRPO time 0.01
% 1.14/1.51 store clause time 0.06
% 1.14/1.51 disable clause time 0.01
% 1.14/1.51 prime paramod time 0.01
% 1.14/1.51 semantics time 0.00
% 1.14/1.51
% 1.14/1.51 EQP interrupted
%------------------------------------------------------------------------------