%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP608-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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:11 EDT 2022
% Result : Unsatisfiable 0.71s 1.14s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 1
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 2 RR)
% Number of literals : 53 ( 0 equ; 1 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 155 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C),B),
file('GRP608-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(multiply(multiply(double_divide(A,B),inverse(C)),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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),inverse(C)),B)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(6,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),multiply(C,D)),A),B),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(8,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),multiply(multiply(double_divide(C,D),inverse(A)),C)),D),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(12,plain,
equal(double_divide(multiply(inverse(A),B),C),double_divide(D,multiply(double_divide(D,double_divide(B,C)),inverse(A)))),
inference(para,[status(thm),theory(equality)],[5,6]),
[iquote('para(5,6)')] ).
cnf(14,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),inverse(D)),A),multiply(C,multiply(inverse(D),B))),
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(multiply(multiply(double_divide(A,B),inverse(C)),A),multiply(D,multiply(inverse(C),multiply(multiply(double_divide(E,D),inverse(B)),E)))),
inference(para,[status(thm),theory(equality)],[3,14]),
[iquote('para(3,14)')] ).
cnf(26,plain,
equal(multiply(A,multiply(inverse(B),multiply(multiply(double_divide(C,A),inverse(D)),C))),multiply(multiply(double_divide(E,D),inverse(B)),E)),
inference(flip,[status(thm),theory(equality)],[25]),
[iquote('flip(25)')] ).
cnf(27,plain,
equal(double_divide(inverse(A),multiply(A,inverse(B))),B),
inference(para,[status(thm),theory(equality)],[5,8]),
[iquote('para(5,8)')] ).
cnf(29,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,2]),1]),
[iquote('para(27,2),flip(1)')] ).
cnf(33,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),inverse(C)),multiply(C,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[27,3]),
[iquote('para(27,3)')] ).
cnf(50,plain,
equal(double_divide(inverse(A),multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[29,33]),
[iquote('para(29,33)')] ).
cnf(51,plain,
equal(multiply(multiply(A,inverse(A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,2]),1]),
[iquote('para(50,2),flip(1)')] ).
cnf(52,plain,
equal(double_divide(multiply(A,B),multiply(C,inverse(C))),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,50]),
[iquote('para(2,50)')] ).
cnf(56,plain,
equal(multiply(multiply(A,inverse(A)),multiply(B,C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[52,2]),2]),1]),
[iquote('para(52,2),demod([2]),flip(1)')] ).
cnf(93,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(A,double_divide(B,double_divide(C,D))),inverse(E))),inverse(F)),multiply(inverse(E),B)),multiply(D,multiply(inverse(F),C))),
inference(para,[status(thm),theory(equality)],[12,14]),
[iquote('para(12,14)')] ).
cnf(195,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,14]),56]),
[iquote('para(50,14),demod([56])')] ).
cnf(196,plain,
equal(multiply(inverse(A),inverse(B)),multiply(multiply(double_divide(C,B),inverse(A)),C)),
inference(flip,[status(thm),theory(equality)],[195]),
[iquote('flip(195)')] ).
cnf(199,plain,
equal(multiply(inverse(A),multiply(B,C)),multiply(B,multiply(inverse(A),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,196]),14]),
[iquote('para(2,196),demod([14])')] ).
cnf(200,plain,
equal(multiply(A,multiply(inverse(B),C)),multiply(inverse(B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[199]),
[iquote('flip(199)')] ).
cnf(209,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,195]),29]),1]),
[iquote('para(50,195),demod([29]),flip(1)')] ).
cnf(210,plain,
equal(multiply(multiply(A,B),inverse(multiply(C,inverse(C)))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,209]),2]),
[iquote('para(2,209),demod([2])')] ).
cnf(212,plain,
equal(double_divide(inverse(multiply(A,inverse(A))),inverse(B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[209,52]),50]),1]),
[iquote('para(209,52),demod([50]),flip(1)')] ).
cnf(215,plain,
equal(double_divide(multiply(A,inverse(B)),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[212,3]),210]),
[iquote('para(212,3),demod([210])')] ).
cnf(218,plain,
equal(double_divide(inverse(A),inverse(multiply(B,inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[29,215]),
[iquote('para(29,215)')] ).
cnf(228,plain,
equal(double_divide(inverse(A),inverse(inverse(A))),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[209,215]),
[iquote('para(209,215)')] ).
cnf(230,plain,
equal(inverse(multiply(A,inverse(A))),multiply(inverse(inverse(B)),inverse(B))),
inference(para,[status(thm),theory(equality)],[228,2]),
[iquote('para(228,2)')] ).
cnf(264,plain,
equal(double_divide(multiply(inverse(inverse(A)),inverse(A)),inverse(B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[230,27]),51]),
[iquote('para(230,27),demod([51])')] ).
cnf(268,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[264,215]),
[iquote('para(264,215)')] ).
cnf(281,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(para,[status(thm),theory(equality)],[268,27]),
[iquote('para(268,27)')] ).
cnf(286,plain,
equal(double_divide(multiply(A,B),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[268,215]),
[iquote('para(268,215)')] ).
cnf(298,plain,
equal(double_divide(A,inverse(multiply(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[268,218]),268]),
[iquote('para(268,218),demod([268])')] ).
cnf(305,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[298,2]),1]),
[iquote('para(298,2),flip(1)')] ).
cnf(333,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[286,2]),268]),1]),
[iquote('para(286,2),demod([268]),flip(1)')] ).
cnf(369,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(A,double_divide(B,C)),inverse(D))),inverse(E)),multiply(inverse(D),B)),multiply(F,multiply(inverse(E),multiply(multiply(double_divide(G,F),inverse(C)),G)))),
inference(para,[status(thm),theory(equality)],[12,25]),
[iquote('para(12,25)')] ).
cnf(370,plain,
equal(multiply(A,multiply(inverse(B),multiply(multiply(double_divide(C,A),inverse(D)),C))),multiply(multiply(double_divide(E,multiply(double_divide(E,double_divide(F,D)),inverse(G))),inverse(B)),multiply(inverse(G),F))),
inference(flip,[status(thm),theory(equality)],[369]),
[iquote('flip(369)')] ).
cnf(399,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)],[333,286]),268]),1]),
[iquote('para(333,286),demod([268]),flip(1)')] ).
cnf(414,plain,
equal(multiply(double_divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[305]),399]),
[iquote('back_demod(305),demod([399])')] ).
cnf(420,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[298]),399]),
[iquote('back_demod(298),demod([399])')] ).
cnf(462,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[281,420]),1]),
[iquote('para(281,420),flip(1)')] ).
cnf(468,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[196]),462]),1]),
[iquote('back_demod(196),demod([462]),flip(1)')] ).
cnf(495,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),multiply(multiply(double_divide(D,multiply(double_divide(D,double_divide(E,C)),inverse(F))),inverse(B)),multiply(inverse(F),E))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[370]),468]),
[iquote('back_demod(370),demod([468])')] ).
cnf(496,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(A,double_divide(B,C)),inverse(D))),inverse(E)),multiply(inverse(D),B)),multiply(F,multiply(inverse(E),double_divide(C,F)))),
inference(flip,[status(thm),theory(equality)],[495]),
[iquote('flip(495)')] ).
cnf(559,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),double_divide(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),468,468]),
[iquote('back_demod(26),demod([468,468])')] ).
cnf(566,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(A,double_divide(B,C)),inverse(D))),inverse(E)),multiply(inverse(D),B)),double_divide(E,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[496]),559]),
[iquote('back_demod(496),demod([559])')] ).
cnf(567,plain,
equal(multiply(A,multiply(inverse(B),C)),double_divide(B,double_divide(C,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[93]),566]),1]),
[iquote('back_demod(93),demod([566]),flip(1)')] ).
cnf(588,plain,
equal(multiply(inverse(A),multiply(B,C)),double_divide(A,double_divide(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[200]),567]),1]),
[iquote('back_demod(200),demod([567]),flip(1)')] ).
cnf(589,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[333]),588]),
[iquote('back_demod(333),demod([588])')] ).
cnf(620,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[589,414]),2]),
[iquote('para(589,414),demod([2])')] ).
cnf(621,plain,
$false,
inference(conflict,[status(thm)],[620,4]),
[iquote('conflict(620,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP608-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n006.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 : Mon Jun 13 10:41:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.14 ----- EQP 0.9e, May 2009 -----
% 0.71/1.14 The job began on n006.cluster.edu, Mon Jun 13 10:41:42 2022
% 0.71/1.14 The command was "./eqp09e".
% 0.71/1.14
% 0.71/1.14 set(prolog_style_variables).
% 0.71/1.14 set(lrpo).
% 0.71/1.14 set(basic_paramod).
% 0.71/1.14 set(functional_subsume).
% 0.71/1.14 set(ordered_paramod).
% 0.71/1.14 set(prime_paramod).
% 0.71/1.14 set(para_pairs).
% 0.71/1.14 assign(pick_given_ratio,4).
% 0.71/1.14 clear(print_kept).
% 0.71/1.14 clear(print_new_demod).
% 0.71/1.14 clear(print_back_demod).
% 0.71/1.14 clear(print_given).
% 0.71/1.14 assign(max_mem,64000).
% 0.71/1.14 end_of_commands.
% 0.71/1.14
% 0.71/1.14 Usable:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Sos:
% 0.71/1.14 0 (wt=-1) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.71/1.14 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.71/1.14 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Demodulators:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Passive:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Starting to process input.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.71/1.14 1 is a new demodulator.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.14 2 is a new demodulator.
% 0.71/1.14 -> 2 back demodulating 1.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.71/1.14 3 is a new demodulator.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.71/1.14 ---------------- PROOF FOUND ----------------
% 0.71/1.14 % SZS status Unsatisfiable
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 After processing input:
% 0.71/1.14
% 0.71/1.14 Usable:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Sos:
% 0.71/1.14 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.71/1.14 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.14 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Demodulators:
% 0.71/1.14 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.14 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Passive:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 UNIT CONFLICT from 620 and 4 at 0.04 seconds.
% 0.71/1.14
% 0.71/1.14 ---------------- PROOF ----------------
% 0.71/1.14 % SZS output start Refutation
% See solution above
% 0.71/1.14 ------------ end of proof -------------
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 ------------- memory usage ------------
% 0.71/1.14 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.14 type (bytes each) gets frees in use avail bytes
% 0.71/1.14 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.14 term ( 16) 36736 24145 12591 32 244.1 K
% 0.71/1.14 gen_ptr ( 8) 69729 13860 55869 52 436.9 K
% 0.71/1.14 context ( 808) 27227 27225 2 3 3.9 K
% 0.71/1.14 trail ( 12) 4760 4760 0 8 0.1 K
% 0.71/1.14 bt_node ( 68) 8062 8059 3 17 1.3 K
% 0.71/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.14 ac_match_free_vars_pos (4020)
% 0.71/1.14 0 0 0 0 0.0 K
% 0.71/1.14 discrim ( 12) 9444 5275 4169 1963 71.9 K
% 0.71/1.14 flat ( 40) 92854 92854 0 38 1.5 K
% 0.71/1.14 discrim_pos ( 12) 1174 1174 0 1 0.0 K
% 0.71/1.14 fpa_head ( 12) 2542 0 2542 0 29.8 K
% 0.71/1.14 fpa_tree ( 28) 1783 1783 0 15 0.4 K
% 0.71/1.14 fpa_pos ( 36) 935 935 0 1 0.0 K
% 0.71/1.14 literal ( 12) 2135 1515 620 1 7.3 K
% 0.71/1.14 clause ( 24) 2135 1515 620 1 14.6 K
% 0.71/1.14 list ( 12) 374 318 56 7 0.7 K
% 0.71/1.14 list_pos ( 20) 2898 1552 1346 180 29.8 K
% 0.71/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.14
% 0.71/1.14 -------------- statistics -------------
% 0.71/1.14 Clauses input 3
% 0.71/1.14 Usable input 0
% 0.71/1.14 Sos input 3
% 0.71/1.14 Demodulators input 0
% 0.71/1.14 Passive input 0
% 0.71/1.14
% 0.71/1.14 Processed BS (before search) 4
% 0.71/1.14 Forward subsumed BS 0
% 0.71/1.14 Kept BS 4
% 0.71/1.14 New demodulators BS 3
% 0.71/1.14 Back demodulated BS 1
% 0.71/1.14
% 0.71/1.14 Clauses or pairs given 1442
% 0.71/1.14 Clauses generated 1216
% 0.71/1.14 Forward subsumed 600
% 0.71/1.14 Deleted by weight 0
% 0.71/1.14 Deleted by variable count 0
% 0.71/1.14 Kept 616
% 0.71/1.14 New demodulators 312
% 0.71/1.14 Back demodulated 333
% 0.71/1.14 Ordered paramod prunes 0
% 0.71/1.14 Basic paramod prunes 6823
% 0.71/1.14 Prime paramod prunes 38
% 0.71/1.14 Semantic prunes 0
% 0.71/1.14
% 0.71/1.14 Rewrite attmepts 14149
% 0.71/1.14 Rewrites 844
% 0.71/1.14
% 0.71/1.14 FPA overloads 0
% 0.71/1.14 FPA underloads 0
% 0.71/1.14
% 0.71/1.14 Usable size 0
% 0.71/1.14 Sos size 285
% 0.71/1.14 Demodulators size 157
% 0.71/1.14 Passive size 0
% 0.71/1.14 Disabled size 334
% 0.71/1.14
% 0.71/1.14 Proofs found 1
% 0.71/1.14
% 0.71/1.14 ----------- times (seconds) ----------- Mon Jun 13 10:41:42 2022
% 0.71/1.14
% 0.71/1.14 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.14 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.14 input time 0.00
% 0.71/1.14 paramodulation time 0.00
% 0.71/1.14 demodulation time 0.00
% 0.71/1.14 orient time 0.01
% 0.71/1.14 weigh time 0.00
% 0.71/1.14 forward subsume time 0.00
% 0.71/1.14 back demod find time 0.00
% 0.71/1.14 conflict time 0.00
% 0.71/1.14 LRPO time 0.00
% 0.71/1.14 store clause time 0.00
% 0.71/1.14 disable clause time 0.00
% 0.71/1.14 prime paramod time 0.00
% 0.71/1.14 semantics time 0.00
% 0.71/1.14
% 0.71/1.14 EQP interrupted
%------------------------------------------------------------------------------