TSTP Solution File: BOO022-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO022-1 : TPTP v8.1.0. Released v2.2.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:09 EDT 2022
% Result : Unsatisfiable 1.81s 2.22s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 4 RR)
% Number of literals : 61 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 126 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(add(A,B),B),B),
file('BOO022-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,add(B,C)),add(multiply(B,A),multiply(C,A))),
file('BOO022-1.p',unknown),
[] ).
cnf(3,plain,
equal(add(multiply(A,B),multiply(C,B)),multiply(B,add(A,C))),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(add(A,inverse(A)),n1),
file('BOO022-1.p',unknown),
[] ).
cnf(5,plain,
equal(add(multiply(A,B),B),B),
file('BOO022-1.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(add(A,B),add(C,B)),add(B,multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(multiply(A,inverse(A)),n0),
file('BOO022-1.p',unknown),
[] ).
cnf(8,plain,
~ equal(multiply(multiply(a,b),c),multiply(a,multiply(b,c))),
file('BOO022-1.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(n1,inverse(A)),inverse(A)),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(inverse(n1),n0),
inference(para,[status(thm),theory(equality)],[9,7]),
[iquote('para(9,7)')] ).
cnf(13,plain,
equal(add(n1,n0),n1),
inference(para,[status(thm),theory(equality)],[12,4]),
[iquote('para(12,4)')] ).
cnf(15,plain,
equal(multiply(multiply(A,add(B,C)),multiply(C,A)),multiply(C,A)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(18,plain,
equal(multiply(A,add(B,add(C,A))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),5]),1]),
[iquote('para(1,3),demod([5]),flip(1)')] ).
cnf(22,plain,
equal(add(add(multiply(A,B),multiply(C,B)),multiply(D,add(A,C))),multiply(add(A,C),add(B,D))),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(29,plain,
equal(multiply(A,A),A),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(30,plain,
equal(add(A,A),A),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(31,plain,
equal(multiply(A,B),add(multiply(multiply(C,B),A),multiply(B,A))),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(32,plain,
equal(add(multiply(multiply(A,B),C),multiply(B,C)),multiply(C,B)),
inference(flip,[status(thm),theory(equality)],[31]),
[iquote('flip(31)')] ).
cnf(34,plain,
equal(add(A,multiply(B,C)),add(multiply(C,add(B,A)),multiply(A,add(B,A)))),
inference(para,[status(thm),theory(equality)],[6,2]),
[iquote('para(6,2)')] ).
cnf(35,plain,
equal(add(multiply(A,add(B,C)),multiply(C,add(B,C))),add(C,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[34]),
[iquote('flip(34)')] ).
cnf(43,plain,
equal(multiply(add(A,multiply(B,C)),multiply(C,add(D,B))),add(multiply(B,C),multiply(A,multiply(D,C)))),
inference(para,[status(thm),theory(equality)],[3,6]),
[iquote('para(3,6)')] ).
cnf(47,plain,
equal(multiply(add(A,inverse(B)),n1),add(inverse(B),multiply(A,B))),
inference(para,[status(thm),theory(equality)],[4,6]),
[iquote('para(4,6)')] ).
cnf(51,plain,
equal(add(A,multiply(B,multiply(C,A))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,6]),1]),1]),
[iquote('para(5,6),demod([1]),flip(1)')] ).
cnf(57,plain,
equal(add(A,multiply(B,A)),A),
inference(para,[status(thm),theory(equality)],[29,51]),
[iquote('para(29,51)')] ).
cnf(64,plain,
equal(multiply(A,add(B,A)),A),
inference(para,[status(thm),theory(equality)],[30,18]),
[iquote('para(30,18)')] ).
cnf(66,plain,
equal(add(multiply(A,add(B,C)),C),add(C,multiply(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),64]),
[iquote('back_demod(35),demod([64])')] ).
cnf(71,plain,
equal(multiply(A,n1),add(multiply(n1,A),multiply(n0,A))),
inference(para,[status(thm),theory(equality)],[13,2]),
[iquote('para(13,2)')] ).
cnf(72,plain,
equal(add(multiply(n1,A),multiply(n0,A)),multiply(A,n1)),
inference(flip,[status(thm),theory(equality)],[71]),
[iquote('flip(71)')] ).
cnf(73,plain,
equal(multiply(n1,add(A,n0)),add(n0,multiply(n1,A))),
inference(para,[status(thm),theory(equality)],[13,6]),
[iquote('para(13,6)')] ).
cnf(84,plain,
equal(multiply(add(A,multiply(B,C)),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,15]),64,64]),
[iquote('para(6,15),demod([64,64])')] ).
cnf(101,plain,
equal(multiply(add(A,B),A),A),
inference(para,[status(thm),theory(equality)],[29,84]),
[iquote('para(29,84)')] ).
cnf(103,plain,
equal(multiply(n1,A),A),
inference(para,[status(thm),theory(equality)],[4,101]),
[iquote('para(4,101)')] ).
cnf(104,plain,
equal(add(A,n0),add(n0,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),103,103]),
[iquote('back_demod(73),demod([103,103])')] ).
cnf(105,plain,
equal(add(n0,A),add(A,n0)),
inference(flip,[status(thm),theory(equality)],[104]),
[iquote('flip(104)')] ).
cnf(106,plain,
equal(multiply(A,n1),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[72]),103,57]),1]),
[iquote('back_demod(72),demod([103,57]),flip(1)')] ).
cnf(107,plain,
equal(add(A,inverse(B)),add(inverse(B),multiply(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),106]),
[iquote('back_demod(47),demod([106])')] ).
cnf(108,plain,
equal(add(inverse(A),multiply(B,A)),add(B,inverse(A))),
inference(flip,[status(thm),theory(equality)],[107]),
[iquote('flip(107)')] ).
cnf(168,plain,
equal(multiply(add(A,B),add(C,D)),add(add(multiply(A,C),multiply(B,C)),add(multiply(A,D),multiply(B,D)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,22]),1]),
[iquote('para(2,22),flip(1)')] ).
cnf(181,plain,
equal(multiply(A,add(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,3]),57]),1]),
[iquote('para(29,3),demod([57]),flip(1)')] ).
cnf(189,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,2]),30]),
[iquote('para(30,2),demod([30])')] ).
cnf(192,plain,
equal(multiply(inverse(A),A),n0),
inference(para,[status(thm),theory(equality)],[189,7]),
[iquote('para(189,7)')] ).
cnf(199,plain,
equal(add(n0,A),A),
inference(para,[status(thm),theory(equality)],[192,5]),
[iquote('para(192,5)')] ).
cnf(202,plain,
equal(add(A,n0),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),199]),1]),
[iquote('back_demod(105),demod([199]),flip(1)')] ).
cnf(226,plain,
equal(multiply(multiply(A,B),inverse(B)),n0),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,32]),202,192]),
[iquote('para(7,32),demod([202,192])')] ).
cnf(245,plain,
equal(add(multiply(A,B),A),A),
inference(para,[status(thm),theory(equality)],[189,5]),
[iquote('para(189,5)')] ).
cnf(312,plain,
equal(multiply(inverse(A),multiply(B,A)),n0),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[226,189]),1]),
[iquote('para(226,189),flip(1)')] ).
cnf(313,plain,
equal(multiply(multiply(A,B),inverse(A)),n0),
inference(para,[status(thm),theory(equality)],[189,226]),
[iquote('para(189,226)')] ).
cnf(349,plain,
equal(multiply(inverse(A),multiply(A,B)),n0),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[313,189]),1]),
[iquote('para(313,189),flip(1)')] ).
cnf(434,plain,
equal(multiply(multiply(A,B),multiply(multiply(C,B),A)),multiply(multiply(C,B),A)),
inference(para,[status(thm),theory(equality)],[57,15]),
[iquote('para(57,15)')] ).
cnf(506,plain,
equal(add(add(A,B),B),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,66]),181]),
[iquote('para(29,66),demod([181])')] ).
cnf(508,plain,
equal(add(A,B),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[506,181]),168,29,5,29,57]),
[iquote('para(506,181),demod([168,29,5,29,57])')] ).
cnf(520,plain,
equal(add(A,multiply(A,B)),A),
inference(para,[status(thm),theory(equality)],[508,245]),
[iquote('para(508,245)')] ).
cnf(824,plain,
equal(multiply(add(A,inverse(B)),multiply(B,add(C,A))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[108,43]),312,202]),
[iquote('para(108,43),demod([312,202])')] ).
cnf(4064,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,168]),30]),
[iquote('para(30,168),demod([30])')] ).
cnf(5319,plain,
equal(multiply(A,multiply(B,add(C,A))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[824]),4064,349,202]),
[iquote('back_demod(824),demod([4064,349,202])')] ).
cnf(5480,plain,
equal(multiply(multiply(A,B),multiply(C,B)),multiply(multiply(A,B),C)),
inference(para,[status(thm),theory(equality)],[57,5319]),
[iquote('para(57,5319)')] ).
cnf(5816,plain,
equal(multiply(multiply(A,B),multiply(C,A)),multiply(multiply(A,B),C)),
inference(para,[status(thm),theory(equality)],[520,5319]),
[iquote('para(520,5319)')] ).
cnf(5917,plain,
equal(multiply(multiply(A,B),C),multiply(multiply(C,B),A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[434]),5816,5480]),
[iquote('back_demod(434),demod([5816,5480])')] ).
cnf(6220,plain,
equal(multiply(multiply(A,B),C),multiply(multiply(C,A),B)),
inference(para,[status(thm),theory(equality)],[189,5917]),
[iquote('para(189,5917)')] ).
cnf(6637,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[6220,189]),
[iquote('para(6220,189)')] ).
cnf(6638,plain,
$false,
inference(conflict,[status(thm)],[6637,8]),
[iquote('conflict(6637,8)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO022-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 22:56:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.81/2.22 ----- EQP 0.9e, May 2009 -----
% 1.81/2.22 The job began on n020.cluster.edu, Wed Jun 1 22:56:09 2022
% 1.81/2.22 The command was "./eqp09e".
% 1.81/2.22
% 1.81/2.22 set(prolog_style_variables).
% 1.81/2.22 set(lrpo).
% 1.81/2.22 set(basic_paramod).
% 1.81/2.22 set(functional_subsume).
% 1.81/2.22 set(ordered_paramod).
% 1.81/2.22 set(prime_paramod).
% 1.81/2.22 set(para_pairs).
% 1.81/2.22 assign(pick_given_ratio,4).
% 1.81/2.22 clear(print_kept).
% 1.81/2.22 clear(print_new_demod).
% 1.81/2.22 clear(print_back_demod).
% 1.81/2.22 clear(print_given).
% 1.81/2.22 assign(max_mem,64000).
% 1.81/2.22 end_of_commands.
% 1.81/2.22
% 1.81/2.22 Usable:
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Sos:
% 1.81/2.22 0 (wt=-1) [] multiply(add(A,B),B) = B.
% 1.81/2.22 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 1.81/2.22 0 (wt=-1) [] add(A,inverse(A)) = n1.
% 1.81/2.22 0 (wt=-1) [] add(multiply(A,B),B) = B.
% 1.81/2.22 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(B,A),add(C,A)).
% 1.81/2.22 0 (wt=-1) [] multiply(A,inverse(A)) = n0.
% 1.81/2.22 0 (wt=-1) [] -(multiply(multiply(a,b),c) = multiply(a,multiply(b,c))).
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Demodulators:
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Passive:
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Starting to process input.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 1 (wt=7) [] multiply(add(A,B),B) = B.
% 1.81/2.22 1 is a new demodulator.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 2 (wt=13) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 1.81/2.22
% 1.81/2.22 ** KEPT: 3 (wt=13) [flip(2)] add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)).
% 1.81/2.22 clause forward subsumed: 0 (wt=13) [flip(3)] multiply(B,add(A,C)) = add(multiply(A,B),multiply(C,B)).
% 1.81/2.22
% 1.81/2.22 ** KEPT: 4 (wt=6) [] add(A,inverse(A)) = n1.
% 1.81/2.22 4 is a new demodulator.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 5 (wt=7) [] add(multiply(A,B),B) = B.
% 1.81/2.22 5 is a new demodulator.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 6 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(B,multiply(A,C)).
% 1.81/2.22 6 is a new demodulator.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 7 (wt=6) [] multiply(A,inverse(A)) = n0.
% 1.81/2.22 7 is a new demodulator.
% 1.81/2.22
% 1.81/2.22 ** KEPT: 8 (wt=11) [] -(multiply(multiply(a,b),c) = multiply(a,multiply(b,c))).
% 1.81/2.22 ---------------- PROOF FOUND ----------------
% 1.81/2.22 % SZS status Unsatisfiable
% 1.81/2.22
% 1.81/2.22
% 1.81/2.22 After processing input:
% 1.81/2.22
% 1.81/2.22 Usable:
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Sos:
% 1.81/2.22 4 (wt=6) [] add(A,inverse(A)) = n1.
% 1.81/2.22 7 (wt=6) [] multiply(A,inverse(A)) = n0.
% 1.81/2.22 1 (wt=7) [] multiply(add(A,B),B) = B.
% 1.81/2.22 5 (wt=7) [] add(multiply(A,B),B) = B.
% 1.81/2.22 8 (wt=11) [] -(multiply(multiply(a,b),c) = multiply(a,multiply(b,c))).
% 1.81/2.22 2 (wt=13) [] multiply(A,add(B,C)) = add(multiply(B,A),multiply(C,A)).
% 1.81/2.22 3 (wt=13) [flip(2)] add(multiply(A,B),multiply(C,B)) = multiply(B,add(A,C)).
% 1.81/2.22 6 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(B,multiply(A,C)).
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Demodulators:
% 1.81/2.22 1 (wt=7) [] multiply(add(A,B),B) = B.
% 1.81/2.22 4 (wt=6) [] add(A,inverse(A)) = n1.
% 1.81/2.22 5 (wt=7) [] add(multiply(A,B),B) = B.
% 1.81/2.22 6 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(B,multiply(A,C)).
% 1.81/2.22 7 (wt=6) [] multiply(A,inverse(A)) = n0.
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 Passive:
% 1.81/2.22 end_of_list.
% 1.81/2.22
% 1.81/2.22 UNIT CONFLICT from 6637 and 8 at 0.84 seconds.
% 1.81/2.22
% 1.81/2.22 ---------------- PROOF ----------------
% 1.81/2.22 % SZS output start Refutation
% See solution above
% 1.81/2.22 ------------ end of proof -------------
% 1.81/2.22
% 1.81/2.22
% 1.81/2.22 ------------- memory usage ------------
% 1.81/2.22 Memory dynamically allocated (tp_alloc): 20996.
% 1.81/2.22 type (bytes each) gets frees in use avail bytes
% 1.81/2.22 sym_ent ( 96) 59 0 59 0 5.5 K
% 1.81/2.22 term ( 16) 762689 455083 307606 101 5984.0 K
% 1.81/2.22 gen_ptr ( 8) 1703837 156479 1547358 60 12089.2 K
% 1.81/2.22 context ( 808) 428750 428748 2 5 5.5 K
% 1.81/2.22 trail ( 12) 257210 257210 0 9 0.1 K
% 1.81/2.22 bt_node ( 68) 80106 80103 3 22 1.7 K
% 1.81/2.22 ac_position (285432) 0 0 0 0 0.0 K
% 1.81/2.22 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.81/2.22 ac_match_free_vars_pos (4020)
% 1.81/2.22 0 0 0 0 0.0 K
% 1.81/2.22 discrim ( 12) 206068 64380 141688 0 1660.4 K
% 1.81/2.22 flat ( 40) 2401665 2401665 0 187 7.3 K
% 1.81/2.22 discrim_pos ( 12) 19542 19542 0 1 0.0 K
% 1.81/2.22 fpa_head ( 12) 18691 0 18691 0 219.0 K
% 1.81/2.22 fpa_tree ( 28) 8790 8790 0 37 1.0 K
% 1.81/2.22 fpa_pos ( 36) 7813 7813 0 1 0.0 K
% 1.81/2.22 literal ( 12) 26868 20231 6637 1 77.8 K
% 1.81/2.22 clause ( 24) 26868 20231 6637 1 155.6 K
% 1.81/2.22 list ( 12) 1235 1179 56 6 0.7 K
% 1.81/2.22 list_pos ( 20) 25991 10215 15776 6 308.2 K
% 1.81/2.22 pair_index ( 40) 2 0 2 0 0.1 K
% 1.81/2.22
% 1.81/2.22 -------------- statistics -------------
% 1.81/2.22 Clauses input 7
% 1.81/2.22 Usable input 0
% 1.81/2.22 Sos input 7
% 1.81/2.22 Demodulators input 0
% 1.81/2.22 Passive input 0
% 1.81/2.22
% 1.81/2.22 Processed BS (before search) 9
% 1.81/2.22 Forward subsumed BS 1
% 1.81/2.22 Kept BS 8
% 1.81/2.22 New demodulators BS 5
% 1.81/2.22 Back demodulated BS 0
% 1.81/2.22
% 1.81/2.22 Clauses or pairs given 16398
% 1.81/2.22 Clauses generated 15217
% 1.81/2.22 Forward subsumed 8588
% 1.81/2.22 Deleted by weight 0
% 1.81/2.22 Deleted by variable count 0
% 1.81/2.22 Kept 6629
% 1.81/2.22 New demodulators 1171
% 1.81/2.22 Back demodulated 2416
% 1.81/2.22 Ordered paramod prunes 0
% 1.81/2.22 Basic paramod prunes 53926
% 1.81/2.22 Prime paramod prunes 384
% 1.81/2.22 Semantic prunes 0
% 1.81/2.22
% 1.81/2.22 Rewrite attmepts 303057
% 1.81/2.22 Rewrites 14511
% 1.81/2.22
% 1.81/2.22 FPA overloads 0
% 1.81/2.22 FPA underloads 0
% 1.81/2.22
% 1.81/2.22 Usable size 0
% 1.81/2.22 Sos size 4220
% 1.81/2.22 Demodulators size 700
% 1.81/2.22 Passive size 0
% 1.81/2.22 Disabled size 2416
% 1.81/2.22
% 1.81/2.22 Proofs found 1
% 1.81/2.22
% 1.81/2.22 ----------- times (seconds) ----------- Wed Jun 1 22:56:10 2022
% 1.81/2.22
% 1.81/2.22 user CPU time 0.84 (0 hr, 0 min, 0 sec)
% 1.81/2.22 system CPU time 0.26 (0 hr, 0 min, 0 sec)
% 1.81/2.22 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.81/2.22 input time 0.00
% 1.81/2.22 paramodulation time 0.05
% 1.81/2.22 demodulation time 0.12
% 1.81/2.22 orient time 0.04
% 1.81/2.22 weigh time 0.01
% 1.81/2.22 forward subsume time 0.04
% 1.81/2.22 back demod find time 0.03
% 1.81/2.22 conflict time 0.01
% 1.81/2.22 LRPO time 0.02
% 1.81/2.22 store clause time 0.39
% 1.81/2.22 disable clause time 0.06
% 1.81/2.22 prime paramod time 0.01
% 1.81/2.22 semantics time 0.00
% 1.81/2.22
% 1.81/2.22 EQP interrupted
%------------------------------------------------------------------------------